A novel algorithm for calculating the QR decomposition of a polynomial matrix

Foster, J., McWhirter, John ORCID: https://orcid.org/0000-0003-1810-3318 and Chambers, J. A. 2009. A novel algorithm for calculating the QR decomposition of a polynomial matrix. Presented at: 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, Taipei, Taiwan, 19-24 April 2009. 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing proceedings. IEEE, 3177 -3190. 10.1109/ICASSP.2009.4960299

Full text not available from this repository.

Abstract

A 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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Engineering
Additional Information:	ICASSP 2009
Publisher:	IEEE
ISBN:	9781424423538
Last Modified:	18 Oct 2022 14:08
URI:	https://orca.cardiff.ac.uk/id/eprint/16591

Citation Data

Cited 8 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item