NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Fast algorithm for computing a primitive /2 to power p + 1/p-th root of unity in GF/q squared/A quick method is described for finding the primitive (2 to power p + 1)p-th root of unity in the Galois field GF(q squared), where q = (2 to power p) - 1 and is known as a Mersenne prime. Determination of this root is necessary to implement complex integer transforms of length (2 to power k) times p over the Galois field, with k varying between 3 and p + 1.
Document ID
19780061808
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Reed, I. S.
(Southern California, University Los Angeles, Calif., United States)
Truong, T. K.
(University of Southern California Los Angeles, CA, United States)
Miller, R. L.
(California Institute of Technology, Jet Propulsion Laboratory, Tracking and Data Acquisition Laboratory, Pasadena Calif., United States)
Date Acquired
August 9, 2013
Publication Date
July 20, 1978
Publication Information
Publication: Electronics Letters
Volume: 14
Subject Category
Computer Programming And Software
Accession Number
78A45717
Funding Number(s)
CONTRACT_GRANT: AF-AFOSR-75-2798
Distribution Limits
Public
Copyright
Other

Available Downloads

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