Please use this identifier to cite or link to this item:
|Title:||Constant modulus algorithm (CMA) for CDMA communications systems||Authors:||He, Ping
Rasmussen, Lars K.
|Issue Date:||1998||Citation:||He, Ping,Tjhung, T.T.,Rasmussen, Lars K. (1998). Constant modulus algorithm (CMA) for CDMA communications systems. IEEE Vehicular Technology Conference 2 : 949-953. ScholarBank@NUS Repository.||Abstract:||Blind adaptive multiuser detection based on the constant modulus algorithm (CMA) has received a lot of attention recently. In the blind detectors proposed previously, the CMA is applied to the output of the chip match filters. In this paper, we consider the use of the CMA at the output of a bank of filters matched to the signature waveforms of each user. For simplicity, a synchronous code division multiple access (CDMA) system is adopted. The convergence performance of the blind detector is also analyzed and the results indicate that the CMA does not have the stable undesired equilibrium, which has been proven to exist for the practical Godard Algorithm with the finite tap equalizer when used in intersymbol interference (ISI) channels. However, the permutation ambiguity and the phase ambiguity occur. To avoid the permutation and phase ambiguities, some constraints are introduced into the CMA and their validity is also proven by analysis and simulations. When the CMA for each user converges to the desired solution, the blind detector is approaching to the decorrelating detector.||Source Title:||IEEE Vehicular Technology Conference||URI:||http://scholarbank.nus.edu.sg/handle/10635/72541||ISSN:||07400551|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.