A Systematic Framework for the Construction of Optimal Complete Complementary Codes

@article{Han2011ASF,
  title={A Systematic Framework for the Construction of Optimal Complete Complementary Codes},
  author={Chenggao Han and Naoki Suehiro and Takeshi Hashimoto},
  journal={IEEE Transactions on Information Theory},
  year={2011},
  volume={57},
  pages={6033-6042}
}
The complete complementary code (CCC) that was proposed by Suehiro and Hatori is a sequence family, that is a set of sequence sets, with ideal correlation sums. Numerous studies in the literature show its applications to direct-spread code-division multiple access (DS-CDMA) systems for interchannel 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… 
View on IEEE
arxiv.org
58 Citations
Highly Influential Citations
10
Background Citations
30
Methods Citations
17
Results Citations
1

Figures from this paper

58 Citations

Citation Type

Citation Type

A novel multiplier-free generator for complete complementary codes
TLDR
This paper proposes a simple construction of CCCs of length Nn (n e N) based on paraunitary matrices of size N × N and introduces an easy implementation of the proposed algorithm by multiplexers and read-only memories (ROMs), i.e., a multiplier-free implementation.
A New Construction Framework for Polyphase Complete Complementary Codes With Various Lengths
TLDR
This paper proposes a new construction of polyphase CCC with various lengths by using unimodular paraunitary (PU) matrices, and decomposes a large square PU matrix into direct sum of matrices with smaller sizes in order to construct CCCWith various lengths.
Constructions of Asymptotically Optimal Aperiodic Quasi-Complementary Sequence Sets
TLDR
Aperiodic quasi-complementary sequences are the main interest and constructions of aperiodic LC-CSSs and a periodic LCZ- CSSs over the complex roots of unity are proposed, and with these constructions, asymptotically optimal a Periodic QCSSs can be obtained.
Z-Complementary Code Sets With Flexible Lengths From Generalized Boolean Functions
TLDR
The proposed constructions extend the applications of ZCCSs in practical communication systems by offering flexible sequence lengths, various set sizes, and bounded peak-to-average-power ratio (PAPR) when a sequence in the set is used in OFDM.
Multiple Complete Complementary Codes With Inter-Set Zero Cross-Correlation Zone
TLDR
This paper focuses on constructing multiple CCCs with inter-set zero cross-correlation zone (ZCCZ) property based on generalized Boolean functions (GBFs) and can provide advantages in applications to MC-CDMA systems with multiple cells.
Spread spectrum communication system performance analysis based on the complete complementary sequence
TLDR
Using CC-S as spread spectrum code can suppress noise interference more effectively and greatly reduce the interference among different users in comparison to those conventional pseudo-random sequence within lots of simulation.
New Complete Complementary Codes for Peak-to-Mean Power Control in Multi-Carrier CDMA
TLDR
A new class of CCC using generalized Boolean functions and with a column sequence PMEPR of at most 2 is proposed in this paper, which aims to solve the problem of peak-to-mean envelope power ratio of the CCC-MC-CDMA communications.
I/Q Column-Wise Complementary Codes for Interference-Resistant CDMA Communication Systems
TLDR
The analytical results show that out-of-phase autocorrelation and cross-correlation functions are zero for any relative time shifts, and a CDMA system implemented by the IQCC codes has an inherent capability to mitigate multiple access interference and multipath interference.
New Optimal Z-Complementary Code Sets from Matrices of Polynomials
TLDR
It is shown that there exists an equivalence between a ZPU matrix and a $Z-complementary code set when the latter is expressed as a matrix with polynomial entries, and a unifying construction framework for optimal ZPU matrices is proposed which includes existing PU matrices as a special case.
Cross-correlation index and multiple-access performance of Gold codes in a spread-spectrum system
  • O. Wojuola
  • Computer Science
    2018 20th International Conference on Advanced Communication Technology (ICACT)
  • 2018
TLDR
This work involves the proposal of a mathematical model for the cross-correlation index, and the use of the same for the prediction of the loading capacity and system bit-error-rate performance, and results for a set of 255-chip Gold codes are presented here.
...
...

References

SHOWING 1-10 OF 91 REFERENCES
Z-connectable complete complementary codes and its application in CDMA systems
TLDR
A new type of CCC is proposed called the Z-connectable CCC (Z-CCC), which gives a sequence set with zero correlation zone (ZCZ) by connecting codes in its complementary codes and two Z-CCCs which consist of rows of the discrete Fourier transform (DFT) and Hadamard matrices.
New Complete Complementary Codes and Their Analysis
TLDR
A comparison between these new construction methods and Schweitzer's one is made, it shows that the order of complete complementary code set is not restricted to 2m and each sequence length can also be arbitrary.
A New Construction Method of Zero-Correlation Zone Sequences Based on Complete Complementary Codes
TLDR
A new construction method of ZCZ sequences based on complete complementary codes is proposed and, by proposed method, non zero elements ZC Z sequences whose merit figure is greater than 1/2 are constructable.
A novel construction method of zero-correlation zone sequences based on complete complementary codes
TLDR
A new construction method of ZCZ sequences with greater than 1/2 merit figure are constructable and based on complete complementary codes is proposed.
Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
TLDR
A previously unrecognized connection between Golay complementary sequences and second-order Reed-Muller codes over alphabets Z/sub 2/h is found to give an efficient decoding algorithm involving multiple fast Hadamard transforms.
A generation method for constructing (N,N,MN/P) complete complementary sequences
  • Chenggao Han, N. Suchiro
  • Computer Science
    SympoTIC '04. Joint 1st Workshop on Mobile Future & Symposium on Trends In Communications (IEEE Cat. No.04EX877)
  • 2004
TLDR
This paper proposes a new method to generate a set of complete complementary sequence of length MN/P which compose complete complementary sequences.
Complete Complementary Sequences of Different Length
TLDR
The proposed class of complete complementary sequences, constituted by sequence sets of different lengths, does not increase the data rates when short-length sequences are employed.
Preamble Design Based on Complete Complementary Sets for Random Access in MIMO-OFDM Systems
TLDR
The numerical results show that the application of preamble sequences with complete complementary code sets can obtain high detection probability and the generation method and the bound of extension code number are addressed to satisfy the requirement of practical system.
Performance of a Complete Complementary Code-Based Spread-Time CDMA System in a Fading Channel
TLDR
The results show that the proposed CC- ST-CDMA system has a comparable BER performance with complete complementary code-based multicarrier direct-sequence code-division multiple access (CC-MC-DSCDMA) for a flat-fading channel, however, for a frequency-selective fading channel, the CC-ST- CDMA is found to be more resistant, resulting in about 2-3 dB better performance than the CC -MC- DSCDMA.
Modular Architecture for Efficient Generation and Correlation of Complementary Set of Sequences
TLDR
This work presents a generalization of Recursive algorithms with the purpose of obtaining complementary sets of M sequences with length L, the number of sequences M being a power of two (M=2m), and the length L aPower of M with m,Nisin N-{0}.
...
...