New Correlation Bound and Construction of Quasi-Complementary Sequence Sets
Palash Sarkar, Chunlei Li, Sudhan Majhi, Zilong Liu
Abstract
Quasi-complementary sequence sets (QCSSs) have attracted sustained research interests for simultaneously supporting more active users in multi-carrier code-division multiple-access (MC-CDMA) systems compared to complete complementary codes (CCCs). In this paper, we investigate a novel class of QCSSs composed of multiple CCCs. We derive a new aperiodic correlation lower bound for this type of QCSSs, which is tighter than the existing bounds for QCSSs. We then present a systematic construction of such QCSSs with a flexible alphabet size and a low maximum correlation magnitude, and also show that the constructed aperiodic QCSSs can meet the newly derived bound asymptotically.
Topics & Concepts
Aperiodic graphCode division multiple accessUpper and lower boundsSequence (biology)AlphabetCode (set theory)MathematicsCorrelationDiscrete mathematicsComputer scienceAlgorithmTheoretical computer scienceCombinatoricsTelecommunicationsSet (abstract data type)Mathematical analysisLinguisticsGeometryPhilosophyBiologyGeneticsProgramming languageWireless Communication Networks ResearchAdvanced Wireless Communication TechniquesCoding theory and cryptography