Constrained Quasi-Newton algorithm for CDMA mobile communications

This work presents the derivation of the constrained version of a Quasi-Newton (QN) algorithm. Application of such algorithm to the problem of direct-sequence code-division multiple access (DS-CDMA) is investigated through simulations. The algorithm is compared to other constrained adaptation algorithms known in the literature in terms of convergence rate for a similar misadjustment level. Two scenarios describing synchronous and asynchronous transmission are used in simulations of interference suppression in DS-CDMA communication, showing the great capabilities of the algorithm in such applications.