arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.10062cs.ITeess.SPmath.IT
收藏

最优Z-互补码集的伪布尔函数

Pseudo-Boolean Functions for Optimal Z-Complementary Code Sets with Flexible Lengths

Palash Sarkar, Sudhan Majhi, Zilong Liu

摘要:

本文旨在构造非二次幂(NPT)长度的最优Z互补码集(ZCCS),以实现无干扰的多载波码分多址(MC-CDMA)系统。现有的ZCCS与NPT长度,这是从广义布尔函数(GBF)构造的,是次优的集合大小上限。在文献中的第一次,我们主张使用伪布尔函数(PBFs)(其中每个转换一个二进制变量的一个实数作为一个自然的推广GBF)直接建设的最佳ZCCS与NPT长度。

英文摘要:

This paper aims to construct optimal Z-complementary code set (ZCCS) with non-power-of-two (NPT) lengths to enable interference-free multicarrier code-division multiple access (MC-CDMA) systems. The existing ZCCSs with NPT lengths, which are constructed from generalized Boolean functions (GBFs), are sub-optimal only with respect to the set size upper bound. For the first time in the literature, we advocate the use of pseudo-Boolean functions (PBFs) (each of which transforms a number of binary variables to a real number as a natural generalization of GBF) for direct constructions of optimal ZCCSs with NPT lengths.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑