NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A fast DFT algorithm using complex integer transformsWinograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.
Document ID
19780016260
Document Type
Other
Authors
Reed, I. S.
(Univ. of Southern Calif. Los Angeles, United States)
Truong, T. K.
(Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Date Acquired
August 9, 2013
Publication Date
February 15, 1978
Publication Information
Publication: The Deep Space Network
Subject Category
Lunar And Planetary Exploration
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

IDRelationTitle19780016244Analytic PrimaryThe deep space network
Document Inquiry
No Preview Available