NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Techniques for computing the discrete Fourier transform using the quadratic residue Fermat number systemsThe complex integer multiplier and adder over the direct sum of two copies of finite field developed by Cozzens and Finkelstein (1985) is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.
Document ID
19870034901
Document Type
Reprint (Version printed in journal)
Authors
Truong, T. K. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Chang, J. J. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Hsu, I. S. (California Institute of Technology Jet Propulsion Laboratory, Pasadena, United States)
Pei, D. Y. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Reed, I. S. (Southern California, University Los Angeles, CA, United States)
Date Acquired
August 13, 2013
Publication Date
November 1, 1986
Publication Information
Publication: IEEE Transactions on Computers
Volume: C-35
ISSN: 0018-9340
Subject Category
COMPUTER OPERATIONS AND HARDWARE
Funding Number(s)
CONTRACT_GRANT: NAS7-100
CONTRACT_GRANT: F19628-83-K-0009
Distribution Limits
Public
Copyright
Other