New Complete Complementary Codes and Their Analysis
New Complete Complementary Codes and Their Analysis
复制标题
DOI：
10.1109/glocom.2007.741
复制
发表时间：
2007-12
期刊：
影响因子：
--
通讯作者：
Xing Yang;Yong Mo;Daoben Li;Mingzhe Bian
中科院分区：
文献类型：
--
作者：
Xing Yang;Yong Mo;Daoben Li;Mingzhe Bian
构造了一种新的完全互补码集，其中每个码由任意长度的任意偶数序列组成。在自相关函数条件不完备的情况下，提出了一种准完备互补码集，其中每个码由任意长度的任意N个序列组成。随后，给出了拟完美完全互补码集的一个自然推广。此外，本文还提出了一种基于解方程组构造完全互补码集的一般方法。仿真结果验证了上述构造方法的正确性。并与Schweitzer的构造方法进行了比较，结果表明，完全互补码集的阶数不限于2m，序列长度也可以是任意的。
A new complete complementary code set, where each code consists of arbitrary even number sequences with arbitrary length, is constructed. When the condition of auto correlation function is imperfect, a quasi-perfect complete complementary code set, where each code consists of arbitrary N sequences with arbitrary length, is presented. Subsequently, a natural extension of the quasi-perfect complete complementary code set is given. In addition, a general way to construct complete complementary code set based on solving equations is also demonstrated in this paper. Simulation results validate the correctness of all the construction methods above. A comparison between these new construction methods and Schweitzer's one is made, it shows that the order of complete complementary code set is not restricted to 2m and each sequence length can also be arbitrary.