By Topic

Search algorithms based on eliminating-highest-error and fastest-metric-descent criteria 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
$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

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

In Sun (1998), the fastest-metric-descent (FMD) and eliminating-highest-error (EHE) criteria were proposed for the improvement of iterative algorithms for bit-synchronous CDMA multiuser detection. In this paper, the EHE and FMD criteria are proposed to apply to search algorithms. The FMD and EHE criteria applicable to the search algorithm are presented. It is shown that at each bit demodulation, the FMD criterion achieves the largest amount of metric descent, while the EHE criterion achieves the largest correct demodulation probability. Two search algorithms are proposed based on the FMD and EHE criteria, respectively. Analysis shows that the FMD and EHE search algorithms have advantages for the systems near perfect power control, but suffer from the near-far problem. Then we propose that the FMD and EHE search algorithms are followed by the FMD and EHE iterative algorithms, respectively, which are near-far resistant and guarantee to achieve local minimum points of the metric. Simulation results show that the FMD and EHE search algorithms performed much better than the original search algorithm in perfect power control. The FMD and EHE search-iterative algorithms show even better performance in all situations. All proposed algorithms have linear computational complexity

Published in:

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

Date of Conference:

7-11 Jun 1998