A prime factor FTT algorithm using distributed arithmetic
- 1 April 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 30 (2), 217-227
- https://doi.org/10.1109/tassp.1982.1163875
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An in-place, in-order prime factor FFT algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- Digital filter structures described by distributed arithmeticIEEE Transactions on Circuits and Systems, 1977
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Index mappings for multidimensional formulation of the DFT and convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A new hardware realization of digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Fast Hardware Fourier Transformation Through CountingIEEE Transactions on Computers, 1973
- The Relationship Between Two Fast Fourier TransformsIEEE Transactions on Computers, 1971
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968