M sequence generator-based primitive polynomial pseudo-random sequence generator

Abstract

The invention discloses an m sequence generator-based primitive polynomial pseudo-random sequence generator. The m sequence generator-based primitive polynomial pseudo-random sequence generator comprises a primitive polynomial unit, a multilevel M bit parameter setting unit, a linear feedback logic unit, a shift register unit, an add operation unit, a constant accumulation unit and a modular 2M operation unit, wherein the add operation unit is used for performing add operation on an output result of the linear feedback logic unit and a constant term in the constant accumulation unit and inputting a result to the modular 2M operation unit, an output of the modular 2M operation unit is connected with an input of the shift register unit, and an output of the shift register unit is connected with an input of the linear feedback logic unit so as to iteratively generate a multilevel pseudo-random sequence consisting of M bit pseudo-random numbers. Through simple arithmetical operation, the pseudo-random sequence consisting of the multilevel pseudo-random numbers with a period of 2M-1 or 2M-2 times the original m sequence period can be obtained, and the safety in adoption of the pseudo-random sequence communication equipment is enhanced.

Description

technical field [0001] The invention relates to the field of remote control and telemetering of communication, in particular to spread spectrum communication technology in a digital information transmission system, and is a method for realizing a pseudo-random sequence generator. technical background [0002] Pseudo-random sequences have some statistical properties similar to random noise, and at the same time can be generated repeatedly. Because it has the advantages of random noise and avoids the disadvantages of random noise, pseudo-random sequences have been widely used in many important fields, such as cryptography, spread spectrum communication, navigation, electronic countermeasures in modern warfare, and so on. [0003] Such as figure 2 As shown, the commonly used pseudo-random sequence is the m-sequence, which is the abbreviation of the longest linear feedback shift register sequence, and usually we use the feedback shift register to generate it. We often hope to ...

AI Technical Summary

Problems solved by technology

When making an m-sequence generator, the number of feedback lines of the shift register is directly determined by the number of terms of the primitive polynomial. In order to make the composition of the m-sequence generator as simple as possible, we hope to use the primitive polynomial with the least number of terms. The original polynomial is not very simple. After a lot of calculations by the predecessors, only some original polynomials have been found, and the period of the generated sequence is also limited, and each original polynomial only corresponds to a pseudo-random sequence.

However, in practical applications, for example, the frequency hopping communication system uses m-sequences to control frequency point hopping during combat, and sends control codes to control UAVs. Due to the limited periodicity of m-sequences, when the enemy intercepts our After a short-term detection of the control signal sent by the ground, its frequency hopping pattern is easy to be identified, thus causing a fatal blow to our communication system, which may determine the outcome of the war; similarly, in cryptography Encrypting information also requires the required period of the pseudo-random sequence to be as long as possible, thereby reducing the probability of being cracked by the enemy

Images