By Topic

Eliminating-highest-error and fastest-metric-descent criteria and iterative algorithms for bit-synchronous CDMA multiuser detection

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
$33 $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

1 Author(s)
Yi Sun ; Dept. of Electr. & Syst. Eng., Connecticut Univ., Storrs, CT, USA

In this paper, the approach of iterative, metric descent algorithms to bit-synchronous CDMA multiuser detection is proposed. An iterative algorithm in the sequential flip mode is presented. Then the fastest-metric-descent (FMD) and eliminating-highest-error (EHE) criteria are proposed for the determination of the bit to be flipped at each time. The FMD criterion achieves the largest amount of metric descent at each bit flip, while the EHE criterion achieves the highest probability that the bit flip is correct. In perfect power control, the FMD and EHE criteria are equivalent. Two algorithms under the FMD and EHE criteria are proposed for matched filter outputs. The EHE based algorithm for decorrelating noise whitening filter outputs is also proposed. It is shown that in a finite number of bit flips the proposed four algorithms converge to fixed points. It is also shown that these fixed points are local minimum points of the metric, and vice versa. When a user is strong enough, it approaches the single user bound. If the signature waveforms are orthogonal, all users achieve the single user bound. Simulation results show that the FMD and EHE based algorithms have improved performance. The proposed algorithms are attractive in the near-far situation. They have linear computational complexity per demodulated bit in the number of users and are suitable for implementation in Hopfield neural networks for fast parallel computation

Published in:

Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on  (Volume:3 )

Date of Conference:

7-11 Jun 1998