Maximum energy sequential matrix diagonalisation for parahermitian matrices

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

3 Citations (Scopus)

Abstract

Sequential matrix diagonalisation (SMD) refers to a family of algorithms to iteratively approximate a polynomial matrix eigenvalue decomposition. Key is to transfer as much energy as possible from off-diagonal elements to the diagonal per iteration, which has led to fast converging SMD versions involving judicious shifts within the polynomial matrix. Through an exhaustive search, this paper determines the optimum shift in terms of energy transfer. Though costly to implement, this scheme yields an important benchmark to which limited search strategies can be compared. In simulations, multiple-shift SMD algorithms can perform within 10% of the optimum energy transfer per iteration step.
LanguageEnglish
Title of host publicationConference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers
EditorsMichael B. Matthews
Place of PublicationPiscataway, NJ.
PublisherIEEE
Pages470-474
Number of pages5
ISBN (Print)9781479982950
DOIs
Publication statusPublished - 2014
Event2014 48th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: 2 Nov 20145 Nov 2014

Conference

Conference2014 48th Asilomar Conference on Signals, Systems and Computers
CountryUnited States
CityPacific Grove, CA
Period2/11/145/11/14

Fingerprint

Energy transfer
Polynomials
Decomposition

Keywords

  • channel coding
  • direction-of-arrival estimation
  • eigenvalues and eigenfunctions
  • iterative methods
  • polynomial matrices
  • precoding

Cite this

Corr, J., Thompson, K., Weiss, S., McWhirter, J. G., & Proudler, I. K. (2014). Maximum energy sequential matrix diagonalisation for parahermitian matrices. In M. B. Matthews (Ed.), Conference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers (pp. 470-474). Piscataway, NJ.: IEEE. https://doi.org/10.1109/ACSSC.2014.7094487
Corr, Jamie ; Thompson, Keith ; Weiss, Stephan ; McWhirter, John G. ; Proudler, Ian K. / Maximum energy sequential matrix diagonalisation for parahermitian matrices. Conference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers. editor / Michael B. Matthews. Piscataway, NJ. : IEEE, 2014. pp. 470-474
@inproceedings{a8c983730df04c2b8561e50e33ce8249,
title = "Maximum energy sequential matrix diagonalisation for parahermitian matrices",
abstract = "Sequential matrix diagonalisation (SMD) refers to a family of algorithms to iteratively approximate a polynomial matrix eigenvalue decomposition. Key is to transfer as much energy as possible from off-diagonal elements to the diagonal per iteration, which has led to fast converging SMD versions involving judicious shifts within the polynomial matrix. Through an exhaustive search, this paper determines the optimum shift in terms of energy transfer. Though costly to implement, this scheme yields an important benchmark to which limited search strategies can be compared. In simulations, multiple-shift SMD algorithms can perform within 10{\%} of the optimum energy transfer per iteration step.",
keywords = "channel coding, direction-of-arrival estimation, eigenvalues and eigenfunctions, iterative methods, polynomial matrices, precoding",
author = "Jamie Corr and Keith Thompson and Stephan Weiss and McWhirter, {John G.} and Proudler, {Ian K.}",
note = "(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.",
year = "2014",
doi = "10.1109/ACSSC.2014.7094487",
language = "English",
isbn = "9781479982950",
pages = "470--474",
editor = "Matthews, {Michael B.}",
booktitle = "Conference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers",
publisher = "IEEE",

}

Corr, J, Thompson, K, Weiss, S, McWhirter, JG & Proudler, IK 2014, Maximum energy sequential matrix diagonalisation for parahermitian matrices. in MB Matthews (ed.), Conference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers. IEEE, Piscataway, NJ., pp. 470-474, 2014 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, United States, 2/11/14. https://doi.org/10.1109/ACSSC.2014.7094487

Maximum energy sequential matrix diagonalisation for parahermitian matrices. / Corr, Jamie; Thompson, Keith; Weiss, Stephan; McWhirter, John G. ; Proudler, Ian K.

Conference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers. ed. / Michael B. Matthews. Piscataway, NJ. : IEEE, 2014. p. 470-474.

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - Maximum energy sequential matrix diagonalisation for parahermitian matrices

AU - Corr, Jamie

AU - Thompson, Keith

AU - Weiss, Stephan

AU - McWhirter, John G.

AU - Proudler, Ian K.

N1 - (c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

PY - 2014

Y1 - 2014

N2 - Sequential matrix diagonalisation (SMD) refers to a family of algorithms to iteratively approximate a polynomial matrix eigenvalue decomposition. Key is to transfer as much energy as possible from off-diagonal elements to the diagonal per iteration, which has led to fast converging SMD versions involving judicious shifts within the polynomial matrix. Through an exhaustive search, this paper determines the optimum shift in terms of energy transfer. Though costly to implement, this scheme yields an important benchmark to which limited search strategies can be compared. In simulations, multiple-shift SMD algorithms can perform within 10% of the optimum energy transfer per iteration step.

AB - Sequential matrix diagonalisation (SMD) refers to a family of algorithms to iteratively approximate a polynomial matrix eigenvalue decomposition. Key is to transfer as much energy as possible from off-diagonal elements to the diagonal per iteration, which has led to fast converging SMD versions involving judicious shifts within the polynomial matrix. Through an exhaustive search, this paper determines the optimum shift in terms of energy transfer. Though costly to implement, this scheme yields an important benchmark to which limited search strategies can be compared. In simulations, multiple-shift SMD algorithms can perform within 10% of the optimum energy transfer per iteration step.

KW - channel coding

KW - direction-of-arrival estimation

KW - eigenvalues and eigenfunctions

KW - iterative methods

KW - polynomial matrices

KW - precoding

UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7066991

UR - http://www.asilomarsscconf.org/

U2 - 10.1109/ACSSC.2014.7094487

DO - 10.1109/ACSSC.2014.7094487

M3 - Conference contribution book

SN - 9781479982950

SP - 470

EP - 474

BT - Conference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers

A2 - Matthews, Michael B.

PB - IEEE

CY - Piscataway, NJ.

ER -

Corr J, Thompson K, Weiss S, McWhirter JG, Proudler IK. Maximum energy sequential matrix diagonalisation for parahermitian matrices. In Matthews MB, editor, Conference Record of the Forty-Eighth Asilomar Conference on Signals, Systems & Computers. Piscataway, NJ.: IEEE. 2014. p. 470-474 https://doi.org/10.1109/ACSSC.2014.7094487