By Topic

A recursive linear detection algorithm for asynchronous CDMA communication 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

3 Author(s)
He, R. ; Hughes Network Syst., San Diego, CA, USA ; Reed, Irving S. ; Trieu-Kien Truong

A recursive linear detection algorithm is proposed for the detection of signals from an asynchronous direct-sequence code-division multiple-access (DS-CDMA) communication system. This algorithm works for short as well as long codes. Under some reasonable conditions, this algorithm is proved to be stable and converges to the ideal decorrelating detector (IDD) with a sufficiently large memory length. The performance of the algorithm is analyzed in some detail. Upper and lower bounds for the bit-error probabilities are developed. It is demonstrated that the two bounds converge to the bit-error probabilities of the IDD as the large memory length increases. Simulation results show that the recursive detector proposed outperforms the truncated decorrelating detector with less memory and less computational complexity

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 7 )