Advanced receiver algorithms for MIMO wireless communications
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Reduced-complexity mimo detector with close-to ml error rate performance
Proceedings of the 17th ACM Great Lakes symposium on VLSI
An architecture for energy efficient sphere decoding
ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Algorithm and implementation of the K-best sphere decoding for MIMO detection
IEEE Journal on Selected Areas in Communications
Algorithm and hardware complexity reduction techniques for k-best sphere decoders
Proceedings of the 20th symposium on Great lakes symposium on VLSI
A low-area flexible MIMO detector for WiFi/WiMAX standards
Proceedings of the Conference on Design, Automation and Test in Europe
Area-Efficient Antenna-Scalable MIMO Detector for K-best Sphere Decoding
Journal of Signal Processing Systems
| Hi-index | 0.00 |
Sphere Decoders (SD) have found more popularity among other MIMO detectors because of their close-to-ML error-rate performance and lower hardware complexity. One of the variants of SD is the K-best algorithm. The conventional implementations of K-best are not fast enough to be considered for hardware implementation of the emerging standards like 802.11n because of the throughput bottleneck which is the sort operation. In this work we have proposed the parallel merge algorithm (PMA), which enables us to use more pipeline levels in the system because of its short critical path, resulting in throughput increase, about 4 times compared to the other K-best implementations. Also, we have modified the K-best algorithm by discarding the calculation of unnecessary paths ,which results in a 20% decrease in area and 44% decrease in the number of operations compared to the original K-best.