DocumentCode
1459555
Title
Index mapping approach of deriving the PM DFT algorithms
Author
Sundararajan, Duraisamy ; Ahmad, M. Omair
Author_Institution
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume
47
Issue
12
fYear
1998
fDate
12/1/1998 12:00:00 AM
Firstpage
1418
Lastpage
1424
Abstract
Recently, it has been shown that radix-2 DFT algorithms can be designed based on vector representation of data providing several advantages. 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
Keywords
computational complexity; discrete Fourier transforms; PM DFT algorithms; computational complexity; index mapping; radix-2 DFT algorithms; vector representation; Algorithm design and analysis; Computational complexity; Discrete Fourier transforms; Indexing; Merging; Signal mapping; Signal processing algorithms; Software algorithms; Software performance; Vectors;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.737688
Filename
737688
Link To Document