Construction of group transforms subject to several performance criteria

DOI10.1109/TASSP.1985.1164736MaRDI QIDQ3757262zbMATH OpenOpenAlexFDO

Authors E. A. Trachtenberg

Publication date 1985

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tassp.1985.1164736

zbMATH Keywords

computational complexitydiscrete Fourier transformfast Fourier transformWalsh-Hadamard transformunitary transformcomputational effectivenessgroup matricesHilbert- Schmidt normfast Haar transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms for construction of groups of transformations
• Fast group-theoretical transform
• Group Convolutions and Matrix Transforms
• scientific article; zbMATH DE number 1756458
• Efficient Computation of the Fourier Transform on Finite Groups
• Efficient computation of Fourier transforms on compact groups
• scientific article; zbMATH DE number 687583
• Group theoretical decomposition and fast parallel algorithms for the discrete Fourier transform
• On the translation groups and non-iterative transformation methods
• Generating fast Fourier transforms of solvable groups

Cited in

(2)

• Fast group-theoretical transform
• Fault tolerant computing and reliable communication: A unified approach

This page was built for publication: Construction of group transforms subject to several performance criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757262)