A Tree Search Method for Iterative Decoding of Underdetermined Multiuser Systems

Application of the turbo principle to multiuser decoding results in an exchange of probability distributions between two sets of constraints. Firstly, constraints imposed by the multiple-access channel, and secondly, individual constraints imposed by each users' error control code. A-posteriori...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Kind, Adriel, Grant, Alex
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 28.01.2005
Subjects
Complexity
Decoding
Iterative methods
Multiuser systems
Search methods
Online AccessGet full text

Cover

More Information
Summary:Application of the turbo principle to multiuser decoding results in an exchange of probability distributions between two sets of constraints. Firstly, constraints imposed by the multiple-access channel, and secondly, individual constraints imposed by each users' error control code. A-posteriori probability computation for the first set of constraints is prohibitively complex for all but a small number of users. Several lower complexity approaches have been proposed in the literature. One class of methods is based on linear filtering (e.g. LMMSE). A more recent approach is to compute approximations to the posterior probabilities by marginalising over a subset of sequences (list detection). Most of the list detection methods are restricted to non-singular systems. In this paper, we introduce a transformation that permits application of standard tree-search methods to underdetermined systems. We find that the resulting tree-search based receiver outperforms existing methods.
ISSN:2331-8422