Algorithms for Interpolation-Based QR Decomposition in MIMO-OFDM Systems

Authors:
D. Cescato;H. Bölcskei
Affiliations:
Dept. of Inf. Technol. & Electr. Eng., ETH Zurich, Zurich, Switzerland;-
Venue:
IEEE Transactions on Signal Processing
Year:
2011

Citing 0
Cited 2

QR decomposition of Laurent polynomial matrices sampled on the unit circle

IEEE Transactions on Information Theory
Use of upper triangular matrix tracking for complexity reduction in a linear ZF MIMO system

Signal Processing

Quantified Score

Hi-index	35.74

Visualization

Abstract

Detection algorithms for multiple-input multiple-output (MIMO) wireless systems based on orthogonal frequency-division multiplexing (OFDM) typically require the computation of a QR decomposition for each of the data-carrying OFDM tones. The resulting computational complexity will, in general, be significant. Motivated by the fact that the channel matrices arising in MIMO-OFDM systems result from oversampling of a polynomial matrix, we formulate interpolation-based QR decomposition algorithms. An in-depth complexity analysis, based on a metric relevant for very large scale integration (VLSI) implementations, shows that the proposed algorithms, for a sufficiently large number of data-carrying tones and sufficiently small channel order, provably exhibit significantly smaller complexity than brute-force per-tone QR decomposition.