Shortening the order of paraunitary matrices in SBR2 algorithm

Ta, C.H. and Weiss, S. (2007) Shortening the order of paraunitary matrices in SBR2 algorithm. In: 6th Conference on Information, Communications, and Signal Processing, 2007-12-10 - 2007-12-13. (http://dx.doi.org/10.1109/ICICS.2007.4449828)

[thumbnail of ta07d.pdf]
Preview
 PDF. Filename: ta07d.pdf
Final Published Version
Download (334kB)| Preview

Abstract

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

CORE (COnnecting REpositories)