Polynomial matrix QR decomposition for the decoding of frequency selective multiple-input multiple-output communication channels
Authors:
- 14 September 2012
- journal article
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 6 (7) , 704-712
Abstract
This study proposes a new technique for communicating over multiple-input multiple-output (MIMO) frequency selective channels. This approach operates by calculating the QR decomposition of the polynomial channel matrix at the receiver on the basis of channel state information, which in this work is assumed to be perfectly known. This then enables the frequency selective MIMO system to be transformed into a set of frequency selective single-input single-output systems without altering the statistical properties of the receiver noise, which can then be individually equalised. A like-for-like comparison with the orthogonal frequency division multiplexing scheme, which is typically used to communicate over channels of this form, is provided. The polynomial matrix system is shown to achieve improved performance in terms of average bit error rate results, as a consequence of time-domain symbol decoding.Keywords
This publication has 8 references indexed in Scilit:
- An Algorithm for Calculating the QR and Singular Value Decompositions of Polynomial MatricesIEEE Transactions on Signal Processing, 2009
- An EVD Algorithm for Para-Hermitian Polynomial MatricesIEEE Transactions on Signal Processing, 2007
- Advances in smart antennas - MIMO-OFDM wireless systems: basics, perspectives, and challengesIEEE Wireless Communications, 2006
- Space—Time Coding for Broadband Wireless Communication2006
- Wireless Communications2005
- Turbo equalizationIEEE Signal Processing Magazine, 2004
- Frequency domain equalization for single-carrier broadband wireless systemsIEEE Communications Magazine, 2002
- Spatio-temporal coding for wireless communicationIEEE Transactions on Communications, 1998