Complexity and search space reduction in cyclic-by-row PEVD algorithms

Fraser K. Coutts, Jamie Corr, Keith Thompson, Stephan Weiss, Ian K. Proudler, John G. McWhirter

Research output: Contribution to conferencePaperpeer-review

1 Citation (Scopus)
97 Downloads (Pure)

Abstract

In recent years, several algorithms for the iterative calculation of a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and uses paraunitary operations to diagonalise a parahermitian matrix. This paper addresses potential computational savings that can be applied to existing cyclic-by-row approaches for the PEVD. These savings are found during the search and rotation stages, and do not significantly impact on algorithm accuracy. We demonstrate that with the proposed techniques, computations can be significantly reduced. The benefits of this are important for a number of broadband multichannel problems.
Original languageEnglish
Pages1-5
Number of pages5
DOIs
Publication statusPublished - 6 Mar 2017
Event50th Asilomar Conference on Signals, Systems and Computers - Asilomar Conference Ground, Pacific Grove, CA, United States
Duration: 6 Nov 20169 Nov 2016
http://www.asilomarsscconf.org/

Conference

Conference50th Asilomar Conference on Signals, Systems and Computers
Abbreviated titleAsilomar 2016
Country/TerritoryUnited States
CityPacific Grove, CA
Period6/11/169/11/16
Internet address

Keywords

  • polynomial matrix eigenvalue decomposition
  • PEVD
  • space-time covariance matrices
  • algorithmic cost reductions
  • SMDCbR
  • sequential matrix diagonalisation

Fingerprint

Dive into the research topics of 'Complexity and search space reduction in cyclic-by-row PEVD algorithms'. Together they form a unique fingerprint.

Cite this