A Tree Search Method for Iterative Decoding of Underdetermined Multiuser Systems
| dc.creator | Kind, Adriel | |
| dc.creator | Grant, Alex | |
| dc.date | 2005-01-28 | |
| dc.date.accessioned | 2026-07-07T08:15:19Z | |
| dc.date.available | 2026-07-07T08:15:19Z | |
| dc.description | 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. | |
| dc.description | Submitted to IEEE International Symposium on Information Theory | |
| dc.identifier | https://arxiv.org/abs/cs/0501081 | |
| dc.identifier | http://arxiv.org/abs/cs/0501081 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133412 | |
| dc.subject | Information Theory | |
| dc.title | A Tree Search Method for Iterative Decoding of Underdetermined Multiuser Systems | |
| dc.type | text |