Research on the First Class M Subsequence

For the difficulty of pseudo-random sequence generation, on the basis of construction research of the first class m subsequence, this paper realizes m subsequence based on shift register theory and deduces feedback function expression of m subsequence and analyses linear complexity of sequence by applying B-M algorithm. The analysis shows that linear complexity of m subsequence is larger than linear complexity of m sequence, close to a half of m sequence period.