Interpolation-based QR decomposition in MIMO-OFDM systems

Author

Cescato, Davide ; Borgmann, M. ; Bölcskei, Helmut ; Hansen, Jan ; Burg, Andreas

Author_Institution

Commun. Technol. Lab., Swiss Fed. Inst. of Technol., Zurich, Switzerland

fYear

2005

fDate

5-8 June 2005

Firstpage

945

Lastpage

949

Abstract

The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requires the computation of a QR decomposition for each of the data-carrying OFDM tones. Since the number of data-carrying tones ranges from 48 (as in the IEEE 802.11a/g standards) to 6817 (as in the DVB-T standard), the corresponding computational complexity will in general be significant. This paper presents two algorithms for interpolation-based QR decomposition in MIMO-OFDM systems. An in-depth computational complexity analysis shows that the proposed algorithms, for a sufficiently high number of data-carrying tones and small channel order exhibit significantly smaller complexity than brute-force per-tone QR decomposition.

Keywords

MIMO systems; OFDM modulation; broadband networks; computational complexity; decoding; interpolation; MIMO; QR decomposition; computational complexity; data-carrying OFDM tone; interpolation; multiple-input multiple-output sphere decoding; orthogonal frequency division multiplexing; wideband system; Algorithm design and analysis; Communications technology; Computational complexity; Decoding; Digital video broadcasting; Frequency division multiplexing; MIMO; Matrix decomposition; OFDM; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Advances in Wireless Communications, 2005 IEEE 6th Workshop on

Print_ISBN

0-7803-8867-4

Type

conf

DOI

10.1109/SPAWC.2005.1506279

Filename

1506279