NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Fast algorithm for computing complex number-theoretic transformsA high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
Document ID
19770051516
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Reed, I. S.
(University of Southern California Los Angeles, CA, United States)
Liu, K. Y.
(Southern California, University Los Angeles, Calif., United States)
Truong, T. K.
(California Institute of Technology Jet Propulsion Laboratory Pasadena, Calif., United States)
Date Acquired
August 9, 2013
Publication Date
May 12, 1977
Publication Information
Publication: Electronics Letters
Volume: 13
Subject Category
Computer Programming And Software
Accession Number
77A34368
Funding Number(s)
CONTRACT_GRANT: AF-AFOSR-75-2798
CONTRACT_GRANT: NAS7-100
Distribution Limits
Public
Copyright
Other

Available Downloads

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