Linear bijections and the fast Fourier transform

DOI10.1007/S002000050059zbMATH Open0888.65143OpenAlexW2055024656WikidataQ61782968 ScholiaQ61782968MaRDI QIDQ677564FDOQ677564

Authors: Markus Hegland, Wayne W. Wheeler 

Publication date: 12 May 1998

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050059

Recommendations

• The Fast Fourier Transform
• scientific article; zbMATH DE number 3974248
• The Cooley-Tukey FFT and group theory.
• Fast Fourier transforms on finite groups as a method in synthesis for regularity
• Recent progress and applications in group FFTs

zbMATH Keywords

scientific computingsignal processingfast Fourier transformgroup representationgroup extensionscyclic groupsCooley-Tukey algorithmsFFT algorithmsprime factor algorithmsplitting pair

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary representations and characters (20C15) Numerical methods for discrete and fast Fourier transforms (65T50) Primality (11Y11)

This page was built for publication: Linear bijections and the fast Fourier transform

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