Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding

Authors:
Konstantinos Nikitopoulos;Dan Zhang;I-Wei Lai;Gerd Ascheid
Affiliations:
Institute for Integrated Signal Processing Systems, RWTH Aachen University, Aachen, Germany;Institute for Integrated Signal Processing Systems, RWTH Aachen University, Aachen, Germany;Institute for Integrated Signal Processing Systems, RWTH Aachen University, Aachen, Germany;Institute for Integrated Signal Processing Systems, RWTH Aachen University, Aachen, Germany
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 0

Lattice basis reduction: improved practical algorithms and solving subset sum problems

Mathematical Programming: Series A and B
Reduced-complexity mimo detector with close-to ml error rate performance

Proceedings of the 17th ACM Great Lakes symposium on VLSI
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory
Soft-output sphere decoding: algorithms and VLSI implementation

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper two complexity efficient soft sphere-decoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure during the tree traversal without compromising the max-log performance. It is shown that despite the resulting increase in the number of expanded nodes, they can be more computationally efficient than the typical soft sphere decoders by avoiding the unnecessary complexity of FES.