Inversion of Parahermitian matrices

Weiss, Stephan and Millar, Andrew P. and Stewart, Robert W. (2010) Inversion of Parahermitian matrices. In: 18th European Signal Processing Conference, 2010-08-23 - 2010-08-28.

[thumbnail of strathprints020620.pdf]
Preview
 PDF. Filename: strathprints020620.pdf
Download (1MB)| Preview

Abstract

Parahermitian matrices arise in broadband multiple-input multiple-output (MIMO) systems or array processing, and require inversion in some instances. In this paper, we apply a polynomial eigenvalue decomposition obtained by the sequential best rotation algorithm to decompose a parahermitian matrix into a product of two paraunitary, i.e.lossless and easily invertible matrices, and a diagonal polynomial matrix. The inversion of the overall parahermitian matrix therefore reduces to the inversion of auto-correlation sequences in this diagonal matrix. We investigate a number of different approaches to obtain this inversion, and and assessment of the numerical stability and complexity of the inversion process.

ORCID iDs

Weiss, Stephan ORCID logoORCID: https://orcid.org/0000-0002-3486-7206, Millar, Andrew P. and Stewart, Robert W. ORCID logoORCID: https://orcid.org/0000-0002-7779-8597;
CORE (COnnecting REpositories)