By Topic

Multidimensional DFT processing in subspaces whose dimensions are relatively prime

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Elliott ; Rockwell International Company, Anaheim, California ; D. Orton

Practical algorithms for computing the discrete Fourier transform (DFT) result from the Kronecker product of small N algorithms. This paper shows that several options exist for indexing of the input and output of this DFT. If the Chinese remainder theorem (CRT) is used to expand the output index, then an alternate integer representation (AIR) is shown to determine the input index. It is shown that the roles of the CRT and AIR can be reversed so that the CRT and AIR determine input and output indices, respectively. As a consequence of the indexing the DFT must be processed in subspaces whose dimensions are relatively prime.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '79.  (Volume:4 )

Date of Conference:

Apr 1979