deposit_your_work

Complexity Analysis of MMSE Detector Architectures for MIMO OFDM Systems

Files in this item

Files Size Format View
2005_Asilomar_Markus.pdf 602.7Kb application/pdf Thumbnail

Show full item record

Item Metadata

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
Type: Conference Paper
Publisher: IEEE
Citation: M. Myllylä, J. Hintikka, J. R. Cavallaro, M. Juntti, M. Limingoja and A. Byman,"Complexity Analysis of MMSE Detector Architectures for MIMO OFDM Systems," in 39th Asilomar Conference on Signals, Systems and Computers, 2005, pp. 75-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 the parallelism in the computations. An FPGA hardware implementation is presented and computational complexity of each implementation is evaluated and compared.
Date Published: 2005-11-01

This item appears in the following Collection(s)

  • ECE Publications [1082 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • CMC Publications [275 items]
    Publications by Rice Faculty and graduate students in multimedia communications