EFFICIENT ARCHITECTURES FOR IMPLEMENTING THE PRIME-FACTOR FOURIER TRANSFORM MODULES.
Document Type
Conference Proceeding
Date of Original Version
12-1-1985
Abstract
The author presents efficient architectures for implementing the discrete Fourier transform (DFT) and the discrete Hartley transform (DHART) based on prime factor decomposition. He uses the multiplierless distributed arithmetic in this architecture. The lookup table sizes needed for implementing the short DFT/DHART modules are minimized by judiciously decomposing the short DFT/DHART matrices.
Publication Title, e.g., Journal
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Citation/Publisher Attribution
Kumaresan, R.. "EFFICIENT ARCHITECTURES FOR IMPLEMENTING THE PRIME-FACTOR FOURIER TRANSFORM MODULES.." ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (1985): 768-771. https://digitalcommons.uri.edu/ele_facpubs/724