An iterative approximate MAP symbol estimator for uncoded synchronous CDMA

This paper proposes an iterative algorithm for multiuser detection in uncoded synchronous code division multiple access communication systems based upon an approximate maximum a posteriori (MAP) formulation. For symbol estimation in the continuous domain, direct use of the a priori symbol distributi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2005-07, Vol.4 (4), p.1663-1673
Main Authors: Blunt, S.D., Ho, K.C.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Approximation
Code Division Multiple Access
Code division multiple access (CDMA)
Code division multiplexing
Constellations
Detectors
Estimators
Exact sciences and technology
Gaussian distribution
Iterative algorithms
Iterative methods
Mathematical analysis
maximum a posteriori (MAP) estimation
Mean square error methods
Mean square errors
Multiaccess communication
multiuser communications
Multiuser detection
Phase modulation
Phase shift keying
Studies
Symbols
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes an iterative algorithm for multiuser detection in uncoded synchronous code division multiple access communication systems based upon an approximate maximum a posteriori (MAP) formulation. For symbol estimation in the continuous domain, direct use of the a priori symbol distribution in the estimation process is prohibited because it is not differentiable. The proposed algorithm approximates the discrete finite alphabet symbol distribution by a sum of continuous Gaussian distributions centered at the true values of the symbol constellation. This approximation allows the development of a gradient-based iterative MAP estimator that employs the structure of the particular symbol constellation to improve estimation accuracy. Although iterative, the proposed method does not use a tentative solution from another multiuser detector. Simplifications of the proposed algorithm for constant modulus modulation and its special forms for M-ary phase-shift keying are given. Also, an optimum step size is derived to achieve fast convergence. The performance of the proposed algorithm is shown to outperform other well-known multiuser detectors such as minimum mean square error, the decorrelator, and the multistage hard-decision parallel interference canceller, especially for the near/far scenario.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2005.850370