NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
A pipeline design of a fast prime factor DFT on a finite fieldA conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented.
Document ID
19880042114
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
doi:10.1109/12.2163
Authors
Truong, T. K. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Hsu, In-Shek (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Shao, H. M. (California Institute of Technology Jet Propulsion Laboratory, Pasadena, United States)
Reed, Irving S. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Shyu, Hsuen-Chyun (Southern California, University Los Angeles, CA, United States)
Date Acquired
August 13, 2013
Publication Date
March 1, 1988
Publication Information
Publication: IEEE Transactions on Computers
Volume: 37
ISSN: 0018-9340
Subject Category
Cybernetics
Accession Number
88A29341
Funding Number(s)
CONTRACT_GRANT: N00164-86-C-0025
CONTRACT_GRANT: NAS7-100
CONTRACT_GRANT: F19628-83-K-0009
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.

Related Records

There are no records associated with this record.
No Preview Available