Cart (Loading....) | Create Account
Close category search window
 

Novel algorithms for the accurate, efficient, and parallel computation of multidimensional, regional discrete Fourier transforms

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
$31 $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

1 Author(s)
Pattichis, M.S. ; Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA

A novel class of discrete Fourier transform algorithms is presented. First, a new algorithm is presented for computing the DFT spectrum along any given direction. Then, computation of the entire DFT spectrum is computed using a minimal set of independent directions. It is shown that the new class of algorithms is both faster and more accurate than the traditional tensor decomposition of the DFT computation. Furthermore, the new algorithms allow for each direction to be computed independently of the others, hence allowing a parallel implementation.

Published in:

Electrotechnical Conference, 2000. MELECON 2000. 10th Mediterranean  (Volume:2 )

Date of Conference:

2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.