- 대한전자공학회 2002년도 ITC-CSCC -3
Search Algorithm of Maximal-Period Sequences Based on One-Dimensional Maps with Finite Bits and Its Application to DS-CDMA Systems
This paper presents design of spreading codes for asynchronous DS-CDMA systems. We have been trying to generate maximal-period sequences based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm finding such mammal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for CDMA applications. We also investigate bit error rate(BER) in asynchronous DS-CDMA systems using the maximal-period binary sequences by computer simulations.