Fast Fourier Transforms on Finite Non-Abelian Groups

DOI10.1109/TC.1977.1674739zbMath0371.65027OpenAlexW2059734651MaRDI QIDQ4147573

Mark G. Karpovsky

Publication date: 1977

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1977.1674739

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40) Other transforms and operators of Fourier type (43A32)

Related Items

On the computational complexity of the general discrete Fourier transform, Fault tolerant computing and reliable communication: A unified approach, Symmetry-based matrix factorization, Fast generalized Fourier transforms, Extensions of irreducible representations, Multi-dimensional option pricing using radial basis functions and the generalized Fourier transform, Applications of the generalized Fourier transform in numerical linear algebra, On the amplitude and phase response in the non-abelian Fourier transform, Efficient computation of Fourier transforms on compact groups, Generalizing the discrete Fourier transform, A note on differential operators on finite non-abelian groups, Improved upper complexity bounds for the discrete Fourier transform