Passer à la navigation principale Passer à la recherche Passer au contenu principal

Turbo multiuser detection for coded DS-CDMA systems: A Gibbs sampling approach

  • Telecom Paris

Résultats de recherche: Contribution à un journalArticle de conférenceRevue par des pairs

11 Citations (Scopus)

Résumé

This paper deals with joint detection and decoding techniques for coded CDMA (Code Division Multiple Access) systems. A promising approach in this context consists of combining the results of a soft output multiuser detector (MUD) with single user soft-input soft-output (SISO) decoders in an iterative fashion (so called "turbo" principle). In a first part of the paper we describe the CDMA channel under the form of a probabilistic graphical model (also known as Bayesian, or belief, network) which provides a very generic and natural way of deriving turbo algorithms. The structure of the algorithm is then obtained by direct application of general probability propagation rules rather than by using the context dependent notions of intrinsic and extrinsic information. It turns out however that the obtained algorithm still requires soft output multiuser detection in a pseudo model where the symbols emitted by the user are a priori independent, which is not computationally feasible. The second part of the paper describes a simulation based MUD scheme which draws upon recent advances in Markov Chain Monte Carlo methods. The performance of the overall turbo multiuser decoder is compared with that of a state-of-the-art algorithm with comparable computational cost.

langue originaleAnglais
Pages (de - à)1426-1430
Nombre de pages5
journalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume2
étatPublié - 1 déc. 2000
Evénement34th Asilomar Conference - Pacific Grove, CA, États-Unis
Durée: 29 oct. 20001 nov. 2000

Empreinte digitale

Examiner les sujets de recherche de « Turbo multiuser detection for coded DS-CDMA systems: A Gibbs sampling approach ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation