K-Best MIMO detection VLSI architectures achieving up to 424 mbps

From an error rate performance perspective, maximum likelihood (ML) detection is the preferred detection method for multiple-input multiple-output (MIMO) communication systems. However, for high transmission rates a straight forward exhaustive search implementation suffers from prohibitive complexity. The K-best algorithm provides close-to-ML bit error rate (BIER) performance, while its circuit complexity is reduced compared to an exhaustive search. In this paper, a new VLSI architecture for the implementation of the K-best algorithm is presented. Instead of the mostly sequential processing that has been applied in previous VLSI implementations of the algorithm, the presented solution takes a more parallel approach. Further-more, the application of a simplified norm is discussed. The implementation in an ASIC achieves up to 424 Mbps throughput with an area that is almost on par with current state-of-the-art implementations.


Published in:
2006 Ieee International Symposium On Circuits And Systems, Vols 1-11, Proceedings, 1151-1154
Presented at:
IEEE International Symposium on Circuits and Systems, Kos Isl, GREECE, May 21-24, 2006
Year:
2006
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-0-7803-9389-9
Laboratories:




 Record created 2011-06-06, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)