Computer Science – Information Theory
Scientific paper
2010-03-13
Computer Science
Information Theory
Scientific paper
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.
Han Chenggao
Hashimoto Takeshi
Suehiro Naoki
No associations
LandOfFree
A Systematic Framework for the Construction of Optimal Complete Complementary Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Systematic Framework for the Construction of Optimal Complete Complementary Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Systematic Framework for the Construction of Optimal Complete Complementary Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-191979