A novel algorithm for calculatingthe QR decomposition of a polynomial matrix.pdf (159.25 kB)
A novel algorithm for calculating the QR decomposition of a polynomial matrix
conference contribution
posted on 2010-01-28, 09:26 authored by Joanne Foster, Jonathon Chambers, John McWhirterA novel algorithm for calculating the QR decomposition (QRD) of
polynomial matrix is proposed. The algorithm operates by applying
a series of polynomial Givens rotations to transform a polynomial
matrix into an upper-triangular polynomial matrix and, therefore,
amounts to a generalisation of the conventional Givens method
for formulating the QRD of a scalar matrix. A simple example is
given to demonstrate the algorithm, but also illustrates two clear
advantages of this algorithm when compared to an existing method
for formulating the decomposition. Firstly, it does not demonstrate
the same unstable behaviour that is sometimes observed with the
existing algorithm and secondly, it typically requires less iterations
to converge. The potential application of the decomposition is highlighted
in terms of broadband multi-input multi-output (MIMO)
channel equalisation.
History
School
- Mechanical, Electrical and Manufacturing Engineering
Citation
FOSTER, J., CHAMBERS, J. and MCWHIRTER, J., 2009. A novel algorithm for calculating the QR decomposition of a polynomial matrix. IN: IEEE International Conference Acoustics, Speech and Signal Processing ICASSP, pp. 3177-3180.Publisher
© IEEEVersion
- NA (Not Applicable or Unknown)
Publication date
2009Notes
This is a conference paper [© IEEE]. It is also available at: http://ieeexplore.ieee.org/ Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.ISBN
9781424423545Language
- en