Hard and Soft Spherical-Bound Stack decoder for MIMO systems
| dc.creator | Ouertani, Rym | |
| dc.creator | Ben-Othman, Ghaya Rekaya | |
| dc.creator | Salah, Abdellatif | |
| dc.date | 2008-11-06 | |
| dc.date.accessioned | 2026-07-07T10:16:26Z | |
| dc.date.available | 2026-07-07T10:16:26Z | |
| dc.description | Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a novel sequential algorithm which combines the stack algorithm search strategy and the sphere decoder search region. The proposed decoder that we call the Spherical-Bound-Stack decoder (SB-Stack) can then be used to resolve lattice and large size constellations decoding with a reduced complexity compared to the classical ML decoders. The SB-Stack decoder will be further extended to support soft-output detection over linear channels. It will be shown that the soft SB-Stack decoder outperforms other MIMO soft decoders in term of performance and complexity. | |
| dc.identifier | https://arxiv.org/abs/0811.1000 | |
| dc.identifier | http://arxiv.org/abs/0811.1000 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173509 | |
| dc.subject | Information Theory | |
| dc.title | Hard and Soft Spherical-Bound Stack decoder for MIMO systems | |
| dc.type | text |