m序列优选对及平衡Gold码序列

Optimum m - Sequence Pairs and Blanced Gold Group

目前,在扩频选址通信中,国内外应用较广泛的Gold码,其构成采用的m序列优选对并非是最优的,有的还不是平衡的。本文提供一种求m序列优选对及其构成平衡Gold码的计算机算法。实际表明,这种方法使计算量大为减小,计算速度提高,计算结果准确,因而是一种较好的方法。

Gold code is now widely used in spread spectrum addressing comunica -tions . However , the m sequence pairs adopted are usually not optimum , or even unbalanced . This paper provides an algorithm for the realization of optimum m-sequence pairs and balanced Gold codes with the help of a computer . The amount of computation is much reduced and the high speed in calculation is supported by a high degree of accuracy . Results of calculation show that it is an algorithm worthy of recommendation .