Shortening the order of paraunitary matrices in SBR2 algorithm

Chi Hieu Ta, Stephan Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

23 Citations (Scopus)


The second order sequential best rotation (SBR2) algorithm has recently been proposed as a very effective tool in decomposing a para-Hermitian polynomial matrix R(z) into a diagonal polynomial matrix T(z) and a paraunitary matrix B(,z), extending the eigenvalue decomposition to polynomial matrices, R-(z) = B(z)T(z)~B(z). However, the algorithm results in polynomials of very high order, which limits its applicability. Therefore, in this paper we evaluate approaches to reduce the order of the paraunitary matrices, either within each step of SBR2, or after convergence. The paraunitary matrix B(z) is replaced by a near-paraunitary quantity BN(z), whose error will be assessed. Simulation results show that the proposed truncation can greatly reduce the polynomial order while retaining good near-paraunitariness of BN(z).
Original languageEnglish
Title of host publication2007 6th International conference on information, communications & signal processing
Place of PublicationNew York
Number of pages5
ISBN (Print)9781424409822
Publication statusPublished - 13 Dec 2007
Event6th Conference on Information, Communications, and Signal Processing - , Singapore
Duration: 10 Dec 200713 Dec 2007


Conference6th Conference on Information, Communications, and Signal Processing


  • hermitian matrices
  • polynomial matrices
  • eigenvalues
  • eigenfunctions
  • paraunitary matrices
  • SBR2 algorithm
  • matrix decomposition
  • signal processing algorithms


Dive into the research topics of 'Shortening the order of paraunitary matrices in SBR2 algorithm'. Together they form a unique fingerprint.

Cite this