Linear bijections and the fast Fourier transform

DOI10.1007/S002000050059zbMath0888.65143OpenAlexW2055024656WikidataQ61782968 ScholiaQ61782968MaRDI QIDQ677564

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

zbMATH Keywords

fast Fourier transformgroup representationcyclic groupsgroup extensionssignal processingscientific computingCooley-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