For example,Бобцов

GENERATION OF TERNARY GORDON—MILLS—WELCH SEQUENCES ON THE BASE OF SHIFT REGISTERS

Annotation

An algorithm for the generation of ternary Gordon—Mills—Welch (GMW) sequences and for determining the initial states of the shift registers, incorporated into the generation device, is developed. Ternary GMW-sequences, as well as binary, may be formed on the base of set of shift registers, which linear feedback are determined by coefficients of indivisible polynomials being the factors of testing polynomials of GMW-sequences. The main problem in the construction of devices generating ternary GMWsequences based on shift registers is absence in literature of algorithms of definition of their initial states. In accordance with the proposed algorithm the initial state of shift registers is determined by the decimation of the symbols of the base M-sequence, on which GMW-sequence is formed. Decimation index depends on the ratio of the degrees of the roots of polynomials-factors and roots of polynomial of the base M-sequence.

Keywords

Постоянный URL

Articles in current issue

CONTENT © ITMO UNIVERSITY 1993-2024