In recent years, complementary sequence sets have found many important applications in multi-carrier code-division multiple-access (MC-CDMA) systems for their good correlation properties. In this paper, we propose a construction, which can generate multiple sets of complete complementary codes (CCCs) over $\mathbb{Z}_N$, where $N~(N\geq 3)$ is a positive integer of the form $N=p_0^{e^0}p_1^{e^1}\dots p_{n-1}^{e^{n-1}}$, $p_0<p_1<\cdots<p_{n-1}$ are prime factors of $N$ and $e_0,e_1,\cdots,e_{n-1}$ are non-negative integers. Interestingly, the maximum inter-set aperiodic cross-correlation magnitude of the proposed CCCs is upper bounded by $N$. When $N$ is odd, the combination of the proposed CCCs results to a new set of sequences to obtain asymptotically optimal and near-optimal aperiodic quasi-complementary sequence sets (QCSSs) with more flexible parameters.
翻译:近些年来, 补充序列组在多载代码-多存取系统( MC- CDMA) 多存取( MC- CDMA) 中发现许多重要应用。 在本文中, 我们提出一个构建方案, 它可以产生数组完整代码( CCCs), 超过$gathbb ⁇ N$, 其中$N~( geq 3) 是表格$N=p_ 0 ⁇ @ e ⁇ 0}p_ 1 ⁇ 1 ⁇ 1 ⁇ dots p ⁇ 1 ⁇ e ⁇ n-1 $, $p_ 0 < p_ 1 ⁇ cdosts < p ⁇ n-1} 。 我们建议构建一个构建方案, 能够产生数组完整代码( CCCs) 的多重组合, 超过 $_ 0, e_ 1,\\\ cdots, e\\ { n} 美元, 美元, 其中, $N=p_ = p_ 0. 0. { { { { { { { { { { { { { { { { } { { {, {, {, $ p_ 1} $_ $_ 1} { { { { { { { { { {, {, { } } { } } } { } } } 。 。 $; $; $ $ $; $; $; $ $ 1 < = $ = = = = = = = = = = = = = = = = = = $ = = = = = = = = = = = = = = 和 和 和 = ycd = = y- y- ir- ir- = = = y- y- ir- ir- ir- ir- ir- ir- = = y- = ir- ir- y- = ir-