Iterative joint symbol detection and channel estimation for DS/CDMA via the SAGE algorithm

Author

Kocian, Alexander ; Fleury, Bernard H.

Author_Institution

Center for PersonKommunikation, Aalborg Univ., Denmark

Volume

2

fYear

2000

fDate

2000

Firstpage

1410

Abstract

We present a method of tractable complexity for joint data detection and channel estimation of DS/CDMA signals. The scheme results from an application of the SAGE algorithm. Monte Carlo simulations of a synchronous scenario show that the method is near-far resistant and that it is robust against estimation errors of the channel parameters. Moreover, very short training sequences are required for the scheme to converge. Simulation results further demonstrate that a better performance is obtained when the users´ bit sequences are cyclically updated in the order of increasing strength of the users´ signals at the output of the whitening filter in the receiver

Keywords

Monte Carlo methods; Rayleigh channels; code division multiple access; convergence of numerical methods; filtering theory; multiuser channels; optimisation; parameter estimation; signal detection; spread spectrum communication; DS/CDMA signals; EM algorithm; Monte Carlo simulations; SAGE algorithm; channel estimation; channel parameters; complexity; convergence; estimation errors; flat Rayleigh fading; iterative joint symbol detection; joint data detection; near-far resistant method; performance; receiver; short training sequences; simulation results; user bit sequences; whitening filter; Channel estimation; Convergence; Estimation error; Fading; Gaussian noise; Iterative algorithms; Multiaccess communication; Multiple access interference; Rayleigh channels; Robustness;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 2000. PIMRC 2000. The 11th IEEE International Symposium on

Conference_Location

London

Print_ISBN

0-7803-6463-5

Type

conf

DOI

10.1109/PIMRC.2000.881650

Filename

881650