Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Fundamentals of wireless communication
Fundamentals of wireless communication
Relaxed K-best MIMO signal detector design and VLSI implementation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
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 presents a VLSI implementation of a high-throughput and area-efficient MIMO detector. We propose a modified Dijkstra's algorithm and a pre-calculation technique to improve the throughput by allowing overlapped processing. In addition, we propose a simple approximation of L2-norm to reduce the computational complexity without degrading the error performance noticeably. A MIMO detector based on the proposed algorithm is implemented using a 0.18-µm CMOS technology, which occupies 0.49 mm2 with 25.1K equivalent gates and shows a throughput of over 300 Mbps.