Papers
Topics
Authors
Recent
Search
2000 character limit reached

New Correlation Bound and Construction of Quasi-Complementary Code Sets

Published 28 Apr 2022 in cs.IT, eess.SP, math.CO, and math.IT | (2204.13538v3)

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 small alphabet size and low maximum correlation magnitude, and also show that the constructed aperiodic QCSSs can meet the newly derived bound asymptotically.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.