Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Search Algorithm of Maximal-Period Sequences Based on One-Dimensional Maps with Finite Bits and Its Application to DS-CDMA Systems

  • Yoshioka, Daisaburou (Department of Electrical and Computer Engineering, Kumamoto University) ;
  • Tsuneda, Akio (Department of Electrical and Computer Engineering, Kumamoto University) ;
  • Inoue, Takahiro (Department of Electrical and Computer Engineering, Kumamoto University)
  • Published : 2002.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords