Computer Science – Information Theory
Scientific paper
2009-08-24
Computer Science
Information Theory
The original submission to Appl. Comput. Harmon. Anal. in Aug. 2009 was withdrawn. The paper was split in two parts, which wer
Scientific paper
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, as the number of data-carrying tones ranges from 48 (as in the IEEE 802.11a/g standards) to 1728 (as in the IEEE 802.16e standard). Motivated by the fact that the channel matrices arising in MIMO-OFDM systems are highly oversampled polynomial matrices, 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 sufficiently high number of data-carrying tones and sufficiently small channel order, provably exhibit significantly smaller complexity than brute-force per-tone QR decomposition.
Bölcskei Helmut
Cescato Davide
No associations
LandOfFree
Interpolation-Based QR Decomposition in MIMO-OFDM Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interpolation-Based QR Decomposition in MIMO-OFDM Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interpolation-Based QR Decomposition in MIMO-OFDM Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-698969