论文部分内容阅读
引言把最大长度线性移位寄存器序列(简称m序列)子序列的重量看作随机变量,在一定的条件下,近似地服从一些著名的概率分布。十多年前,人们发现了这一事实,从不同角度注意了这一事实,开始了m序列子序列重量分布的研究,目前已广泛地用于雷达和通讯技术,十多年来,人们从模拟实验,计算机模拟和理论分析等几个方面对重量分布进行了研究。1963年Bartee和Wood为解决雷达测距中的快速捕获问题,详尽地比较了长度不超过2~(14)-1=16383的所有m序列,对于给定的子序列长度和确定长度的m序列提出了选择某种意义下“最佳”m序列的方法[1]。1964年,Shepertycki把由m序列构
INTRODUCTION The weight of subsequences of the maximum length linear shift register sequence (abbreviated as m-sequence) is considered as a random variable, and under certain conditions, some well-known probability distributions are approximately obeyed. More than a decade ago, people discovered this fact, paid attention to this fact from different angles, started the research on weight distribution of m-sequence subsequences, and have been widely used in radar and communication technologies. For more than a decade, Simulation experiments, computer simulation and theoretical analysis of several aspects of the weight distribution were studied. In 1963 Bartee and Wood to solve the rapid acquisition of radar ranging, exhaustive comparison of all m sequences less than 2 ~ (14) -1 = 16383, for a given sub-sequence length and length of the m sequence Proposed a choice of a sense of “best” m sequence method [1]. In 1964, Shepertycki put the sequence by m