Maximal-Period Sequences with Negative Auto-Correlations and Their Application to Asynchronous DS-CDMA Systems

Daisaburo YOSHIOKA  Akio TSUNEDA  Takahiro INOUE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E86-A   No.6   pp.1405-1413
Publication Date: 2003/06/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Papers Selected from 2002 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2002))
spreading code,  maximal-period sequence,  negative auto-correlation,  chaotic map,  asynchronous DS-CDMA,  

Full Text: PDF>>
Buy this Article

This paper presents design of spreading codes for asynchronous DS-CDMA systems. We generate maximal-period sequences with negative auto-correlations based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm to find such maximal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for practical CDMA applications. We also report that maximal-period sequences can outperform conventional Gold sequences in terms of bit error rate (BER) in asynchronous DS-CDMA systems.