DocumentCode
948226
Title
Simple method for computing elements of order 2kn, where n|2p¿1¿1 and 2 ¿ k ¿ p+1, in GF[(2p¿1)2]
Author
Reed, I.S. ; Truong, T.K. ; Miller, R.L.
Author_Institution
University of Southern California, Department of Electrical Engineering, Los Angeles, USA
Volume
14
Issue
21
fYear
1978
Firstpage
697
Lastpage
698
Abstract
A simple method is developed for computing elements of order 2kn, where n|2p¿1¿1 and 2 ¿ k ¿ p+1, in the Galois field GF(q2), and q = 2p¿1 is a Mersenne prime. Such primitive elements are needed to implement complex number-theoretic transforms.
Keywords
digital arithmetic; fast Fourier transforms; number theory; Galois field; Mersenne prime; complex number theoretic transforms; digital arithmetic;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19780470
Filename
4242668
Link To Document