An architecture for energy efficient sphere decoding
ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
Probabilistic spherical detection and VLSI implementation for multiple-antenna systems
IEEE Transactions on Circuits and Systems Part I: Regular Papers
High-throughput and area-efficient MIMO symbol detection based on modified Dijkstra's search
IEEE Transactions on Circuits and Systems Part I: Regular Papers
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
Algorithm and implementation of the K-best sphere decoding for MIMO detection
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper proposes a new K-best detection method that can realize a small-area and low-energy MIMO detector. To reduce the complexity required in K-best operations, tree expansion is relaxed by early evicting inferior children. Additionally, an efficient pipeline scheduling called early forwarding is proposed to reduce the overall processing latency and the number registers. A 4×4 16-QAM MIMO detector integrating four K-best detection units is implemented to demonstrate the proposed method. In a 0.18-μm CMOS technology, the entire detector occupies 1.9 mm2 and shows a throughput of 584 Mbps. The energy consumption is 443 pJ per bit at 1.8 V.