We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Algorithm for Generating Extra-Long Gordon–Mills–Welch Sequences.
- Authors
Starodubtsev, V. G.
- Abstract
The modification of an algorithm for determining polynomial multipliers hci(x) of test polynomial hGMWS(x), which is the main component of the method for synthesizing Gordon–Mills–Welch sequences (GMWSs), is set as a basis for developing the software implementation of the algorithm for generating extra-long GMWSs having a two-level periodic autocorrelation function and high structural latency and generated over the finite field with double extension GF(2S) = GF[(2m)n]. In the modified algorithm, the expressions for the number of operations in computing the vector of alternatives, from which the vector of decimation indices is formed, are derived for different values of parameter n. These expressions also serve as upper estimates for the number of summed sequences. To generate extra-long GMWSs with periods from N = 212 – 1 = 4095 to N = 220 – 1 = 1 048 575, the sets of vectors of decimation indices are obtained for admissible values of parameters m and n.
- Subjects
ALGORITHMS; FINITE fields; PERIODIC functions
- Publication
Journal of Communications Technology & Electronics, 2021, Vol 66, Issue 4, p433
- ISSN
1064-2269
- Publication type
Article
- DOI
10.1134/S1064226921030189