By Topic

A New Reduced-Complexity ML Joint Detection Algorithm Based Sphere Decoder for LS-CDMA System

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

2 Author(s)
Rao Wenyuan ; Sch. of Electron. Sci., Jiangxi Univ. of Finance & Econ., Nanchang ; Dai Liyun

A new reduced-complexity joint detection algorithm based on sphere decoder for LS-CDMA system is proposed in this paper. This algorithm can approach ML performance in polynomial complexity. Special zero correlation window property of LS code can reduce complexity of this algorithm greatly. Simulation indicates it is more insensitive to the choice of initial radius. Thus, by making the choice of radius sufficiently large, the ML solution is guaranteed with low complexity, even for large constellations. We then extend this joint detection algorithm to MIMO case and compare it with MMSE, ZF multicode detectors. Numerical results show performance of this algorithm is good even at very high speed such as 160 Km/h, this give us some insights on developing high efficient practical joint detection algorithm for further LS-CDMA system

Published in:

Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on

Date of Conference:

22-24 Sept. 2006