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

A New Algorithm of Normalized LMS Blind Multiuser Detector Based on Kalman Filter

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)
Shao-bin Guo ; Dept. of Autom., Harbin Eng. Univ., Harbin, China ; Ping Huang ; Shao-jing Guo

To solve the strong MAI in the stable CDMA system a new algorithm of normalized LMS blind multiuser detector based on Kalman filter is proposed. The algorithm which combines the Kalman filter and normalized LMS can estimates the adaptive vector to get the optimal estimation of the detection vector. Both theory analysis and experimental simulation show that the algorithm not only has fast convergence, high accuracy in tracking, excellent capability of anti-multiple access interference, but also the low computation complexity, about a quarter of the Kalman filter algorithm, and has high engineering practical value.

Published in:

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Date of Conference:

24-26 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.