DocumentCode :
3325883
Title :
Complexity Analysis of MMSE Detector Architectures for MIMO OFDM Systems
Author :
Myllylä, Markus ; Hintikka, Juha-Matti ; Cavallaro, Joseph R. ; Juntti, Markku ; Limingoja, Matti ; Byman, Aaron
Author_Institution :
Centre for Wireless Commun., Oulu Univ.
fYear :
2005
fDate :
Oct. 28 2005-Nov. 1 2005
Firstpage :
75
Lastpage :
81
Abstract :
In this paper, a field programmable gate array (FPGA) implementation of a linear minimum mean square error (LMMSE) detector is considered for MIMO-OFDM systems. Two square root free algorithms based on QR decomposition (QRD) are introduced for the implementation of LMMSE detector. Both algorithms are based on QRD via Givens rotations, namely coordinate rotation digital computer (CORDIC) and squared Givens rotation (SGR) algorithms. Linear and triangular shaped array architectures are considered to exploit (he parallelism in the computations. An FPGA hardware implementation is presented and computational complexity of each implementation is evaluated and compared
Keywords :
MIMO systems; OFDM modulation; computational complexity; digital arithmetic; field programmable gate arrays; least mean squares methods; radio receivers; signal detection; signal processing; CORDIC; FPGA; LMMSE; MIMO OFDM systems; MMSE detector architectures; complexity analysis; coordinate rotation digital computer; field programmable gate array; linear minimum mean square error; squared Givens rotation; triangular shaped array architectures; Computer architecture; Concurrent computing; Detectors; Field programmable gate arrays; Hardware; MIMO; Mean square error methods; OFDM; Parallel processing; Sensor arrays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signals, Systems and Computers, 2005. Conference Record of the Thirty-Ninth Asilomar Conference on
Conference_Location :
Pacific Grove, CA
ISSN :
1058-6393
Print_ISBN :
1-4244-0131-3
Type :
conf
DOI :
10.1109/ACSSC.2005.1599705
Filename :
1599705
Link To Document :
بازگشت