DocumentCode
2816888
Title
Approximate matrix inversion for high-throughput data detection in the large-scale MIMO uplink
Author
Wu, Min ; Bei Yin ; Vosoughi, Aida ; Studer, Christoph ; Cavallaro, J.R. ; Dick, Chris
Author_Institution
Rice Univ., Houston, TX, USA
fYear
2013
fDate
19-23 May 2013
Firstpage
2155
Lastpage
2158
Abstract
The high processing complexity of data detection in the large-scale multiple-input multiple-output (MIMO) uplink necessitates high-throughput VLSI implementations. In this paper, we propose - to the best of our knowledge - first matrix inversion implementation suitable for data detection in systems having hundreds of antennas at the base station (BS). The underlying idea is to carry out an approximate matrix inversion using a small number of Neumann-series terms, which allows one to achieve near-optimal performance at low complexity. We propose a novel VLSI architecture to efficiently compute the approximate inverse using a systolic array and show reference FPGA implementation results for various system configurations. For a system where 128 BS antennas receive data from 8 single-antenna users, a single instance of our design processes 1.9M matrices/s on a Xilinx Virtex-7 FPGA, while using only 3.9% of the available slices and 3.6% of the available DSP48 units.
Keywords
MIMO communication; VLSI; antennas; approximation theory; communication complexity; field programmable gate arrays; matrix inversion; radio links; BS antennas; Neumann-series terms; VLSI architecture; Xilinx Virtex-7 FPGA; approximate matrix inversion; base station; high processing complexity; high-throughput VLSI implementations; high-throughput data detection; large-scale MIMO uplink; large-scale multiple-input multiple-output uplink; single-antenna users; Approximation methods; Complexity theory; Computer architecture; Field programmable gate arrays; MIMO; Throughput; Uplink;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems (ISCAS), 2013 IEEE International Symposium on
Conference_Location
Beijing
ISSN
0271-4302
Print_ISBN
978-1-4673-5760-9
Type
conf
DOI
10.1109/ISCAS.2013.6572301
Filename
6572301
Link To Document