DocumentCode
2141909
Title
Robust noise suppression least square constant modulus interference cancellation
Author
Meng, Yan ; You, Mingli ; Liu, Jin
Author_Institution
Res. & Innovation Center, Alcatel-Lucent Shanghai Bell, Co., Ltd., Shanghai, China
fYear
2009
fDate
13-16 Sept. 2009
Firstpage
526
Lastpage
530
Abstract
This paper presents noise suppression linearly constrained least square constant modulus algorithm (LSCMA) for blind suppression of multiuser interferences cancellation in CDMA system. The conventional least square constant modulus algorithm (LSCMA) is difficult to converge to the desired user in the system that has several constant modulus signals. To overcome this shortage, a linearly constrained LSCMA algorithm is proposed by applying the linear constrained condition to the LSCMA. To further enhance the performance, we make orthonormalize the weight vector and the noise subspace, and use the noise subspace to impose multiple constraints on the cost function of LSCMA. The Lagrange method and the partial Taylor-series expansion are combined to update the weight vector. In addition, the stational points and output SINR performance are analyzed in theory. The simulation results demonstrate that the proposed algorithm has superior performance and is more robust in the case of random initial value.
Keywords
code division multiple access; interference suppression; least squares approximations; CDMA system; Lagrange method; blind suppression; least square constant modulus interference cancellation; multiuser interferences cancellation; noise suppression; partial Taylor-series expansion; Cost function; Interference cancellation; Interference constraints; Interference suppression; Least squares methods; Multiaccess communication; Noise cancellation; Noise robustness; Subspace constraints; Vectors; CDMA; LSCMA; multiuser detection; subspace;
fLanguage
English
Publisher
ieee
Conference_Titel
Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th International Symposium on
Conference_Location
Tokyo
Print_ISBN
978-1-4244-5122-7
Electronic_ISBN
978-1-4244-5123-4
Type
conf
DOI
10.1109/PIMRC.2009.5450373
Filename
5450373
Link To Document