Search algorithm of maximal-period sequences based on one-dimensional map with finite bits and its application to spread spectrum sequences

摘要

We realize one-dimensional chaotic maps with finite bits. Such chaotic maps can generate chaotic binary sequences with negative auto-correlation properties which are suitable for asynchronous DS/CDMA systems. Firstly, we propose an efficient search algorithm of maximal-period sequences based on one-dimensional maps. Next, we investigate auto-/cross-correlation properties of such maximal-period sequences. Furthermore, by computer simulation, we evaluate their performance as spreading codes in asynchronous DS/CDMA systems.