NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A new fast algorithm for computing a complex number: Theoretic transformsA high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), 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
19780007135
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Reed, I. S.
(Univ. of S. Calif. Los Angeles, United States)
Liu, K. Y.
(Univ. of S. 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
June 15, 1977
Publication Information
Publication: The Deep Space Network, Vol. 39
Subject Category
Computer Programming And Software
Accession Number
78N15078
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

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