Projects per year
Abstract
In recent years, several algorithms for the iterative calculation of a polynomial matrix QR decomposition (PQRD) have been introduced. The PQRD is a generalisation of the ordinary QRD and uses paraunitary operations to uppertriangularise a polynomial matrix. This paper addresses a multiple shift strategy that can be applied to an existing PQRD algorithm. We demonstrate that with the proposed strategy, the computation time of the algorithm can be reduced. The benefits of this are important for a number of broadband multichannel problems.
Original language  English 

Title of host publication  11th IMA International Conference on Mathematics in Signal Processing 
Pages  14 
Number of pages  4 
Publication status  Published  12 Dec 2016 
Event  11th IMA International Conference on Mathematics in Signal Processing  IET Austin Court, Birmingham, United Kingdom Duration: 12 Dec 2016 → 14 Dec 2016 http://www.ima.org.uk/conferences/conferences_calendar/11th_maths_in_signal_processing.html 
Conference
Conference  11th IMA International Conference on Mathematics in Signal Processing 

Country/Territory  United Kingdom 
City  Birmingham 
Period  12/12/16 → 14/12/16 
Internet address 
Keywords
 polynomial matrix representations
 QR decomposition
 finite impulse response
 sequential matrix diagonalisation
 polynomial eigenvalue decomposition
 PQRD by steps algorithms
 polynomial matrices
Fingerprint
Dive into the research topics of 'Multiple shift QR decomposition for polynomial matrices'. Together they form a unique fingerprint.Projects
 1 Finished

Signal Processing Solutions for the Networked Battlespace
EPSRC (Engineering and Physical Sciences Research Council)
1/04/13 → 31/03/18
Project: Research