Algorithms for Interpolation-Based QR Decomposition in MIMO-OFDM Systems
Authors:
- 6 January 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 59 (4) , 1719-1733
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.Keywords
This publication has 21 references indexed in Scilit:
- OFDM channel estimation algorithm and ASIC implementation2008
- Interpolation-based QR decomposition in MIMO-OFDM systems2005
- Interpolation based transmit beamforming for MIMO-OFDM with limited feedback2004
- Design of a parameterizable silicon intellectual property core for QR-based RLS filteringIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- On the achievable throughput of a multiantenna Gaussian broadcast channelIEEE Transactions on Information Theory, 2003
- OFDM channel estimation by singular value decompositionIEEE Transactions on Communications, 1998
- Robust channel estimation for OFDM systems with rapid dispersive fading channelsIEEE Transactions on Communications, 1998
- Spatio-temporal coding for wireless communicationIEEE Transactions on Communications, 1998
- Matrix Analysis1985
- Improved methods for calculating vectors of short length in a lattice, including a complexity analysisMathematics of Computation, 1985