Inversion of Parahermitian matrices

Stephan Weiss, Andrew P. Millar, Robert W. Stewart

Research output: Contribution to conferencePaper

6 Citations (Scopus)
67 Downloads (Pure)

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.
Original languageEnglish
Pages447-451
Number of pages5
Publication statusPublished - 23 Aug 2010
Event18th European Signal Processing Conference - Aalborg, Denmark
Duration: 23 Aug 201028 Aug 2010

Conference

Conference18th European Signal Processing Conference
CityAalborg, Denmark
Period23/08/1028/08/10

Keywords

  • parahermitian matrices
  • inversion
  • electrical engineering
  • signal processing

Fingerprint Dive into the research topics of 'Inversion of Parahermitian matrices'. Together they form a unique fingerprint.

Cite this