Complete Complementary Sequences of Different Length

R.S. Raja DURAI  Naoki SUEHIRO  Chenggao HAN  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A   No.7   pp.1428-1431
Publication Date: 2007/07/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.7.1428
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Coding Theory
Keyword: 
auto-correlation,  cross-correlation,  complete complementary sequences,  row-orthogonal matrix,  column-orthogonal matrix,  

Full Text: PDF>>
Buy this Article




Summary: 
The class of complete complementary sequences (of fixed length) have the ideal correlation properties and are good at increasing the channel usage efficiency but lacks in desirable sequence lengths. In spread spectrum communication systems, sequences having nice correlation properties are important in many ways such as in suppressing multi-user interference, for reliable initial synchronization and in separation of the multipath components. It would be even good if the sequences are easy to construct and have desirable lengths for the system under consideration. In this paper, M sets of sequences that constitute a complete complementary sequences with ith set containing N sequences of length Li each, i = 0, 1, ..., M - 1, is defined and a general method that constructs such a class of complete complementary sequences (of different lengths) is given. 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.