New Correlation Bound and Construction of Quasi-Complementary Code Sets
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929206865166336 |
|---|---|
| author | Sarkar, Palash Li, Chunlei Majhi, Sudhan Liu, Zilong |
| author_facet | Sarkar, Palash Li, Chunlei Majhi, Sudhan Liu, Zilong |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2204_13538 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | New Correlation Bound and Construction of Quasi-Complementary Code Sets Sarkar, Palash Li, Chunlei Majhi, Sudhan Liu, Zilong Information Theory Signal Processing Combinatorics 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. |
| title | New Correlation Bound and Construction of Quasi-Complementary Code Sets |
| topic | Information Theory Signal Processing Combinatorics |
| url | https://arxiv.org/abs/2204.13538 |