A Generalized Construction of Multiple Complete Complementary Codes and Asymptotically Optimal Aperiodic Quasi-Complementary Sequence Sets
Zhengchun Zhou, Fangrui Liu, Avik Ranjan Adhikary, Pingzhi Fan
Abstract
In recent years, complete complementary codes (CCCs) and quasi-complementary sequence sets (QCSSs) 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 generic construction of multiple sets of CCCs over Z <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sub> , consisting of sequences of length N, where N ≥ 3 is an arbitrary odd integer. Interestingly, the maximum inter-set aperiodic cross-correlation magnitude of the proposed CCCs is upper bounded by N. It turns out that the combination of the generated CCCs results in a new set of sequences to obtain asymptotically optimal and near-optimal aperiodic QCSSs. The proposed construction includes a recent optimal construction of QCSSs with prime length as a special case and leads to asymptotically optimal QCSSs with new flexible parameters.