NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
On the number of multiplications necessary to compute a length-2 exp n DFTThe number of multiplications necessary and sufficient to compute a length-2 exp n DFT is determined. The method of derivation is shown to apply to the multiplicative complexity results of Winograd (1980, 1981) for a length-p exp n DFT, for p an odd prime number. The multiplicative complexity of the one-dimensional DFT is summarized for many possible lengths.
Document ID
19860037892
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Heideman, M. T.
(Lockheed Engineering and Management Services Co., Inc. Houston, TX, United States)
Burrus, C. S.
(Rice University Houston, TX, United States)
Date Acquired
August 12, 2013
Publication Date
February 1, 1986
Publication Information
Publication: IEEE Transactions on Acoustics, Speech, and Signal Processing
Volume: ASSP-34
ISSN: 0096-3518
Subject Category
Computer Operations And Hardware
Accession Number
86A22630
Funding Number(s)
CONTRACT_GRANT: NSF ECS-83-14006
CONTRACT_GRANT: NGT-44-006-804
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available