Index Mapping Approach of Deriving the PM DFT Algorithms

Authors:
Duraisamy Sundararajan;M. Omair Ahmad
Affiliations:
Concordia Univ., Montreal, Quebec, Canada;Concordia Univ., Montreal, Quebec, Canada
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 3
Cited 1

Discrete-time signal processing

Discrete-time signal processing
Fast fourier transforms: a tutorial review and a state of the art

Signal Processing
DFT/FFT and Convolution Algorithms: Theory and Implementation

DFT/FFT and Convolution Algorithms: Theory and Implementation

Five-step FFT algorithm with reduced computational complexity

Information Processing Letters

Quantified Score

Hi-index	14.98

Visualization

Abstract

Recently, it has been shown that radix-2 DFT algorithms can be designed based on vector representation of data providing several advantages [6], [7], [8]. In this paper, an index mapping approach is used to derive these algorithms. This approach makes the derivation simpler and provides a better insight into the functioning of the algorithms. The computational complexity and the performance of the software implementation of the algorithms are also presented.