A Generalization of the Fast Fourier Transform

DOI10.1109/T-C.1970.222875MaRDI QIDQ5578026zbMATH OpenOpenAlexFDO

Authors J. A. Glassman

Publication date 1970

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

Full work available at URL https://doi.org/10.1109/t-c.1970.222875

zbMATH Keywords

numerical analysis

Cited in

(10)

• Self-sorting mixed-radix fast Fourier transforms
• A numerical study of 2-D turbulence
• A simple derivation of Glassman's general N fast Fourier transform
• Fast decoding of non-binary first order Reed-Muller codes
• Analysis of an ADA based version of Glassman's general \(N\) point fast Fourier transform
• Generalized orthogonal discrete W transform and its fast algorithm
• A Vector Implementation of the Fast Fourier Transform Algorithm
• An extension ofR-transform to patterns of arbitrary lengths
• On a matrix factorization algorithm
• Complex BIFORE transform†

This page was built for publication: A Generalization of the Fast Fourier Transform

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