The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1998 vol.47)
pp: 1418-1424
ABSTRACT
<p><b>Abstract</b>—Recently, it has been shown that radix-2 DFT algorithms can be designed based on vector representation of data providing several advantages [<ref rid="bibt14186" type="bib">6</ref>], [<ref rid="bibt14187" type="bib">7</ref>], [<ref rid="bibt14188" type="bib">8</ref>]. 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.</p>
INDEX TERMS
Discrete Fourier transform, fast Fourier transform, DFT, FFT, fast algorithms.
CITATION
Duraisamy Sundararajan, M. Omair Ahmad, "Index Mapping Approach of Deriving the PM DFT Algorithms", IEEE Transactions on Computers, vol.47, no. 12, pp. 1418-1424, December 1998, doi:10.1109/12.737688
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool