High speed DFT's using residue numbers
- 24 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 238-242
- https://doi.org/10.1109/icassp.1980.1170905
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- New algorithms for digital convolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fixed-point error analysis of winograd Fourier transform algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977
- An introduction to programming the Winograd Fourier transform algorithm (WFTA)IEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- A new hardware realization of digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Fast Convolution using fermat number transforms with applications to digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Fast one-dimensional digital convolution by multidimensional techniquesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968