PERIODIC PSEUDORANDOM BINARY SEQUENCE GENERATOR OF COMPLEX STRUCTURE Russian patent published in 2019 - IPC G06F7/58 

FIELD: calculating; counting.

SUBSTANCE: invention relates to the computer equipment. Device comprises generator of m-sequence of length (GML) over GF(p^m) of length pⁿ-1, where n = 2m, (p^m-l)≡0 (mod 4), with arithmetic in GF(p^m), conversion unit (CU) of output symbol of m-sequence in the form of m -p-ary coefficients in ⎡m (log₂p)⎤-bit binary number, binary outputs of which are connected to corresponding address inputs of ROM with volume p^m×1 bit. GML over GF (p^m) of length pⁿ-1 is implemented in the form of serially connected m-sequence generator over GF(p) of length pⁿ-1, consisting of n-bit shift register of p-ary numbers, which output bits are connected to inputs of scalar multiplication unit (SMU), at that output of SMU is connected to input of shift register, and unit for multiplication by matrix (UMM) of p-ary numbers of order n×m, first column of which corresponds to zero shift and is equal to (1 0 0…0)^T, respectively, i-column of said matrix corresponds to m-sequence shift by (i-1) (p^m+1), 1 = 2,…,m, wherein n UMM inputs are connected to corresponding shift register bits outputs, and m UMM outputs are connected to binary m-bit p-to-binary CU m inputs, wherein series-connected zero and unit decimator are introduced, as well as a two-input OR element connected at the first input to the decimator output of units, and at the second input - to the ROM output, wherein the input of the zero decoder is connected to the output of the CU.

EFFECT: technical result consists in improvement of high-speed generator of pseudorandom binary sequences of complex structure.

1 cl, 3 dwg, 1 tbl