Name
Abstract | ||
|---|---|---|
Near-capacity performance can be achieved in multiple-antenna systems by using a list sequential (LISS) detector for iterative equalization. Path augmentation is known to increase the performance of this detector, while a so-called bias term has been used to reduce its computational complexity, in applications other than MIMO detection. In this work, we extend the LISS MIMO detector [1] to incorporate different implementations of the bias term. We show that following the traditional approach of using an auxiliary stack for this purpose leads to a strong narrowing of the search tree, but also to a significant performance degradation, due to a reduced quality of the detector soft output. We therefore propose to use a so-called noise bias term instead, which can be implemented with negligible effort, significantly reduces the size of the search tree, but allows for almost retaining detector performance. Finally, we demonstrate that the extension of only a small fraction of the incomplete stack entries is sufficient to leverage the full gains of path augmentation, thus enabling further substantial savings in computational complexity. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICC.2006.254928 | Communications, 2006. ICC '06. IEEE International Conference |
Keywords | Field | DocType |
detectors,degradation,noise reduction,mimo,computational complexity,radio frequency,mobile communication,radio transmitters | Noise reduction,Transmitter,Telecommunications,Equalization (audio),Computer science,Algorithm,MIMO,Real-time computing,Detector,Mobile telephony,Search tree,Computational complexity theory | Conference |
Volume | ISSN | ISBN |
3 | 8164-9547 E-ISBN : 1-4244-0355-3 | 1-4244-0355-3 |
Citations | PageRank | References |
3 | 0.42 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steffen Bittner | 1 | 185 | 18.70 |
| Ernesto Zimmermann | 2 | 225 | 15.73 |
| Wolfgang Rave | 3 | 310 | 30.92 |
| Gerhard Fettweis | 4 | 3553 | 410.41 |