论文信息 - Even- and odd-correlation functions of chaotic Chebyshev bit sequences for CDMA

Even- and odd-correlation functions of chaotic Chebyshev bit sequences for CDMA

Chaotic binary sequences generated by Chebyshev maps are discussed. Their even- and odd-correlation functions are explicitly evaluated by means of the ensemble-average technique. Such sequences are shown to be good candidates of spreading codes (pseudonoise sequences) for CDMA.<<ETX>>

Tohru Kohda | Akio Tsuneda

[1] Ryuji Kohno. Pseudo-Noise Sequences and Interference Cancellation Techniques for Spread Spectrum Systems--Spread Spectrum Theory and Techniques in Japan-- , 1991 .

[2] Tohru Kohda,et al. Approach to Time Series Analysis for One-Dimensional Chaos Based on Frobenius-Perron Operator , 1990 .

[3] T. J. Rivlin,et al. Ergodic and mixing properties of Chebyshev polynomials , 1964 .

[4] James A. Yorke,et al. Ergodic transformations from an interval into itself , 1978 .

[5] I. Sasase,et al. A Secret Key Cryptosystem Using a Chaotic Map , 1990 .

[6] Shin'ichi Oishi,et al. PSEUDO-RANDOM NUMBER GENERATORS AND CHAOS. , 1982 .

[7] S. Grossmann,et al. Invariant Distributions and Stationary Correlation Functions of One-Dimensional Discrete Processes , 1977 .

[8] S. M. Ulam,et al. On Combination of Stochastic and Deterministic Processes , 1947 .

[9] Tohru Kohda,et al. Pseudonoise Sequences by Chaotic Nonlinear Maps and Their Correlation Properties , 1993 .

[10] M.B. Pursley,et al. Crosscorrelation properties of pseudorandom and related sequences , 1980, Proceedings of the IEEE.