A Systematic Framework for the Construction of Optimal Complete Complementary Codes

DOI10.1109/TIT.2011.2162182MaRDI QIDQ5272380zbMATH OpenFDO

Authors Chenggao Han, Naoki Suehiro, Takeshi Hashimoto

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1003.2681

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial codes (94B25)

Abstract: The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for inter-channel interference (ICI)-free communication with improved spectral efficiency. In this paper, we propose a systematic framework for the construction of CCCs based on $N$-shift cross-orthogonal sequence families ($N$-CO-SFs). We show theoretical bounds on the size of $N$-CO-SFs and CCCs, and give a set of four algorithms for their generation and extension. The algorithms are optimal in the sense that the size of resulted sequence families achieves theoretical bounds and, with the algorithms, we can construct an optimal CCC consisting of sequences whose lengths are not only almost arbitrary but even variable between sequence families. We also discuss the family size, alphabet size, and lengths of constructible CCCs based on the proposed algorithms.

Cited in

(5)

• New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes
• Concurrent coupling of atomistic and continuum models at finite temperature
• Design of concatenative complete complementary codes for CCC-CDMA via specific sequences and extended Boolean functions
• New spectrally null constrained mutually orthogonal complementary sets and Z-complementary code sets
• New construction of complete complementary codes with low PAPR for column sequences

This page was built for publication: A Systematic Framework for the Construction of Optimal Complete Complementary Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272380)