Fast group-theoretical transform

MaRDI QIDQ918183zbMATH OpenFDO

Authors A. L. Vishnevetskij

Publication date 1990

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformfast group-theoretic transformG-complex spectrumnumber of operationssignal

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Review text

The author introduces a group G of order n, where \(n=q^{2m}\), \(q/2^ m-1\), for which he obtains the G-complex spectrum of the signal of the length n, using n log\({}_ 2(n/q)\) operations. For \(q=2^ m-1\) the number of operations is twice less than the number of operation used in the fast Fourier transform.

Recommendations

• scientific article; zbMATH DE number 475354
• Generating fast Fourier transforms of solvable groups
• Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
• Efficient Computation of the Fourier Transform on Finite Groups
• Group theoretical decomposition and fast parallel algorithms for the discrete Fourier transform
• Fast Fourier Transforms for Metabelian Groups
• Efficient computation of Fourier transforms on compact groups
• Group Convolutions and Matrix Transforms
• Construction of group transforms subject to several performance criteria
• scientific article; zbMATH DE number 1756458

Cited in

(4)

• Towards a theory of group convolution
• Construction of group transforms subject to several performance criteria
• Fast summation of functions on the rotation group
• The theory of discrete signal processing

This page was built for publication: Fast group-theoretical transform

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