Complexity Analysis of MMSE Detector Architectures for MIMO OFDM Systems

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 ar...

Full description

Saved in:
Bibliographic Details
Main Authors: Myllyla, M., Hintikka, J.-M., Cavallaro, J.R., Juntti, M., Limingoja, M., Byman, A.
Format: Conference Proceeding
Language:English
Subjects:
Computer architecture
Concurrent computing
Detectors
Field programmable gate arrays
Hardware
Mean square error methods
MIMO
OFDM
Parallel processing
Sensor arrays
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:1058-6393
2576-2303
DOI:10.1109/ACSSC.2005.1599705