RTL Design of High-Speed Sorted QR Decomposition for MIMO Decoder

Yuya, Miyaoka; Nagao, Yuhei; Kurosaki, Masayuki; Ochi, Hiroshi

doi:10.1587/transfun.e95.a.1991

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10], the authors have shown that a low complex SQRD can be designed by using the modified Gram-Schmidt algorithm with pipelining and resource sharing.…”

Section: The Proposed Algorithmmentioning

confidence: 99%

Algorithm and hardware design of a 2D sorter-based K-best MIMO decoder

Tran

Nagao²,

Ochi

2014

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

In the field of multiple input multiple output (MIMO) decoder, K-best has been well investigated because it guarantees an SNR-independent fixed-throughput with a performance close to the optimal maximum likelihood detection (MLD). However, the complexity of its expansion and sorting tasks is significantly affected by the constellation size W. In this paper, we propose an algorithm and hardware design of a 2D sorter-based K-best MIMO decoder whose complexity is negligibly affected by W. The main novelties of the algorithm are the following: (1) Direct expansion and parent node grouping ideas are proposed for reducing the expansion task's complexity.(2) Two-dimensional (2D) sorter is proposed for simplifying the sorting task. The hardware design of the decoder supports up to 256-QAM modulation, which aims to apply into 4 × 4 MIMO 802.11n and 11ac systems. The paper shows that the proposed decoder outperforms the Bell Labs layered space-time (BLAST) minimum mean square error (MMSE) and lattice-reduction aided (LRA) MMSE, and is close to the full K-best in terms of bit error rate (BER) performance. The hardware design of the decoder is synthesized in application specific integrated circuit (ASIC) and compared with the previous works. As a result, it achieves the highest throughput (up to 2.7 Gbps), consumes the least power (56 mW), obtains the best hardware efficiency (15.2 Mbps/Kgate), and has the shortest latency (0.07 μs).

show abstract

“…In [10], the authors have shown that a low complex SQRD can be designed by using the modified Gram-Schmidt algorithm with pipelining and resource sharing.…”

Section: The Proposed Algorithmmentioning

confidence: 99%