Parallel algorithm for computation of second-order sequential best rotations

Algorithms for computing an approximate polynomial matrix eigenvalue decomposition of para-Hermitian systems have emerged as a powerful, generic signal processing tool. A technique that has shown much success in this regard is the sequential best rotation (SBR2) algorithm. Proposed is a scheme for p...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of electronics Vol. 100; no. 12; pp. 1646 - 1651
Main Authors Redif, Soydan, Kasap, Server
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.12.2013
Taylor & Francis LLC
Subjects
Algorithms
Approximation
Computation
CORDIC
Eigenvalues
Field programmable gate arrays
FPGA
Matrix
polynomial matrix eigenvalue decomposition
Polynomials
SBR2
Signal processing
Xilinx System Generator tool
Online AccessGet full text
ISSN0020-7217
1362-3060
DOI10.1080/00207217.2012.751343

Cover

More Information
Summary:Algorithms for computing an approximate polynomial matrix eigenvalue decomposition of para-Hermitian systems have emerged as a powerful, generic signal processing tool. A technique that has shown much success in this regard is the sequential best rotation (SBR2) algorithm. Proposed is a scheme for parallelising SBR2 with a view to exploiting the modern architectural features and inherent parallelism of field-programmable gate array (FPGA) technology. Experiments show that the proposed scheme can achieve low execution times while requiring minimal FPGA resources.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-7217
1362-3060
DOI:10.1080/00207217.2012.751343