【摘要】 本文首先讨论PN序列的“伪随机特性”,根据已发现的事实得出:凡达到包莫特-王-威尔士自相关函数界的二元序列是二元PN序列的完备集合。进而讨论p元(p>2,素数)域上m序列经过特定变换生成二元M序列的方法,最后给出p元域上存在类勾尔德序列的初步结果,此序列集合可作为一类新的CDMA码。本文提出的一些思想和理论,为建立统一的M序列生成方法提供了一种可能的途径。更多还原

【Abstract】 The characteristics of PN sequences are discussed based on the results obtained in recent years. A conjecture that the binary sequences which reach the Baumert-Wang-Wel-ch’s lower bounds are the complete set of binary PN sequences is proposed. Further, an approach for generating the non-linear M-sequences through some specific transformations over GF (p) is given. Finally, some primitive results about the Gold-like sequences over GF(p) are presented and these sequences may be applied to the p-ary channels as a new class of CDMA cades.更多还原