Logo image
A 3.1 Gb/s 8 × 8 sorting reduced K-best detector with lattice reduction and QR decomposition
Journal article   Peer reviewed

A 3.1 Gb/s 8 × 8 sorting reduced K-best detector with lattice reduction and QR decomposition

Chun-Fu Liao, Jhong-Yu Wang and Yuan-Hao Huang
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol.22(12), pp.2675-2688
2014

Abstract

K-best detector lattice reduction (LR) multipleinput multiple-output (MIMO) detection
This paper presents the VLSI implementation of a lattice-reduction-aided (LRA) detection system. The proposed system includes a QR decomposition, lattice reduction (LR) processor, and sorting-reduced (SR) K-best detector for 8 × 8 multiple-input multiple-output (MIMO) systems. The bit error rate of the proposed MIMO detection system only incurs approximately 3 dB of implementation loss compared with optimal maximum likelihood detection with 64-quadratic-amplitude modulation. The proposed processor can also support different throughput requirements by adjusting the stage number of LR. The SR K-best detector can achieve 3.1 Gb/s throughput with 0.24-ns latency. The throughput of the system reaches 585 Mb/s if one channel preprocessing can support 72 symbol detections. The corresponding energy per bit is 63 pJ/bit, which is the smallest value achieved to date. This paper presents the first VLSI implementation of a complete LRA K-best detector with an 8 × 8 dimension. © 1993-2012 IEEE.

Metrics

1 Record Views

Details

Logo image