By Topic

A matrix version of the fast Fourier transform

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)
Theilheimer, F. ; Naval Ship Research and Development Center, Washington, D.C.

The fast Fourier transform is considered to owe its speed to the fact that a certain matrix, none of whose elements is zero, can be factored into matrices with very many zeros. This paper describes and discusses a procedure for explicitly carrying out such a factorization.

Published in:

Audio and Electroacoustics, IEEE Transactions on  (Volume:17 ,  Issue: 2 )