Reduced-complexity mimo detector with close-to ml error rate performance
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Decoding the golden code: a VLSI design
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
From theory to practice: an overview of MIMO space-time coded wireless systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Multiple Input Multiple Output (MIMO) systems are recognized as a key enabling technology in high performance wireless communications. Among known MIMO detectors, the Sphere Decoding Algorithm (SDA) is capable of optimal performance with a reduced computational complexity, compared to a Maximum Likelihood (ML) detector. However the hardware implementation of the SDA still is a major design challenge, especially with high throughput constraints. This paper proposed a modified version of the SDA, which achieves a significant throughput increase and guarantees ML performance, at the price of limited additional complexity. This new solution, called LASDA (Look-Ahead SDA) is mainly based on formal algorithm transformations, namely look-ahead, pipelining and retiming, applied at signal processing level. In addition, a modified tree search strategy, called test&restart, allows a limited increase of the iteration number. The analysis of the proposed LASDA shows that it is almost twice as fast as SDA, while simulation results exhibit ML performance.