Cart (Loading....) | Create Account
Close category search window
 

Robust noise suppression least square constant modulus interference cancellation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan Meng ; Res. & Innovation Center, Alcatel-Lucent Shanghai Bell, Co., Ltd., Shanghai, China ; Mingli You ; Jin Liu

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.

Published in:

Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th International Symposium on

Date of Conference:

13-16 Sept. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.