By Topic

A Polynomial Matrix QR Decomposition with Application to MIMO Channel Equalisation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Foster, J. ; Cardiff Univ., Cardiff ; McWhirter, J. ; Chambers, J.

An algorithm for computing the QR decomposition of a polynomial matrix is introduced. The algorithm proceeds to perform the decomposition by following the same strategy in eliminating entries of the matrix as is used in the Givens method for a QR decomposition of a scalar matrix, however polynomial Givens rotations are now required. A possible application of the decomposition is in MIMO communications, where it is often required to reconstruct data sequences that have been distorted due to the effects of co-channel interference and multipath propagation, leading to intersymbol interference. If the channel matrix for the system is known, its QR decomposition can be calculated and used to transform the MIMO channel equalisation problem into a set of single channel problems, which can then be solved using a maximum likelihood sequence estimator. Some simulated average bit error rate results are presented to support the potential application to MIMO channel equalisation.

Published in:

Signals, Systems and Computers, 2007. ACSSC 2007. Conference Record of the Forty-First Asilomar Conference on

Date of Conference:

4-7 Nov. 2007