Fast givens rotation approach to second order sequential best rotation algorithms

Research output: Contribution to conferencePaperpeer-review

Abstract

The second order sequential best rotation (SBR2) algorithm is a popular algorithm to decompose a parahermitian matrix into approximated polynomial eigenvalues and eigen-vectors. The work horse behind SBR2 is a Givens rotation interspersed by delay operations. In this paper, we investigate and analyse the application of a fast Givens rotation in order to reduce the computation complexity of SBR2. The proposed algorithm inherits the SBR2's proven convergence to a diagonalised and spectrally majorised solution for the polynomial eigenvalues. We provide some analysis and examples for the execution speed of this fast Givens-based SBR2 compared to a standard SBR2 implementation.
Original languageEnglish
Number of pages5
Publication statusPublished - 15 Sep 2021
EventInternational Conference in Sensor Signal Processing for Defence: from Sensor to Decision - Edinburgh, United Kingdom
Duration: 14 Sep 202115 Sep 2021
Conference number: 10
https://sspd.eng.ed.ac.uk

Conference

ConferenceInternational Conference in Sensor Signal Processing for Defence
Abbreviated titleSSPD
Country/TerritoryUnited Kingdom
CityEdinburgh
Period14/09/2115/09/21
Internet address

Keywords

  • sequential best rotation (SBR2)
  • Givens rotation
  • algorithm
  • polynomial eigenvalues
  • broadband signals

Fingerprint

Dive into the research topics of 'Fast givens rotation approach to second order sequential best rotation algorithms'. Together they form a unique fingerprint.

Cite this