论文部分内容阅读
本文阐明了以下的见解: (1) 某些循环码具有良好的自相关系数和互相关系数,适合用作CDMA中的码序列。本文分析了这些循环码的性质,并从数学上作了证明。 (2) 本文定义的(2~λ-1,2λ)循环码具有和Gold优选组相当的相关性能和相同的地址数目。 (3) 循环码比Gold优选组灵活。(2λ-1,2λ+1)循环码能比相应的Gold优选组获得两倍的地址数;(2~λ-1,λ+1)循环码虽然只有两个地址,但自相关系数和互相关系数非常良好;此外,循环码可以不受码长为n=2~λ-1的限制。
This paper clarifies the following observations: (1) Some cyclic codes have good autocorrelation and cross-correlation coefficients and are suitable for use as code sequences in CDMA. The paper analyzes the properties of these cyclic codes and proves them mathematically. (2) The (2 ~ λ-1,2λ) cyclic codes defined in this paper have the same relative performance and the same number of addresses as the Gold preferred group. (3) The cyclic code is more flexible than the Gold preferred group. (2λ - 1, 2λ + 1) cyclic codes can double the number of addresses compared to the corresponding Gold preferred group. Although the cyclic codes have only two addresses, the autocorrelation coefficients and the mutual The number of correlations is very good; in addition, the cyclic codes may not be limited by the code length n = 2 ~ λ-1.