A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform
- 1 August 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 34 (4) , 979-989
- https://doi.org/10.1109/tassp.1986.1164888
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the multiplicative complexity of the Discrete Fourier TransformAdvances in Mathematics, 1979
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- New algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- An introduction to programming the Winograd Fourier transform algorithm (WFTA)IEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976
- Introduction to the Role of Redundancy in Computer ArithmeticComputer, 1975
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Signed-Digit Numbe Representations for Fast Parallel ArithmeticIEEE Transactions on Electronic Computers, 1961