Time complexity modeling and comparison of parallel architectures for Fourier transform oriented algorithms
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Highly parallel architectures and algorithms for speech analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The application of gallium arsenide integrated circuit technology to the design and fabrication of future generation digital signal processors: promises and problemsProceedings of the IEEE, 1988
- Modular architecture for high performance implementation of FFT algorithmACM SIGARCH Computer Architecture News, 1986
- Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- A Discrete Fourier-Cosine Transform ChipIEEE Journal on Selected Areas in Communications, 1986
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- ‘Split radix’ FFT algorithmElectronics Letters, 1984
- Signal processing with Occam and the transputerIEE Proceedings F Communications, Radar and Signal Processing, 1984
- Fourier Transforms in VLSIIEEE Transactions on Computers, 1983