Index mapping approach of deriving the PM DFT algorithms

The DFT is of fundamental importance in many areas of science and engineering due to its efficient evaluation of frequently used operations such as signal analysis, convolution, and correlation. It has been shown that radix-2 DFT (discrete Fourier transform) algorithms can be designed based on vector representation of data providing several advantages. These algorithms provide more efficient solution for the problem of DFT computation. 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 signal flow graph of the algorithm is also presented.