Chaotic spreading sequences with multiple access performance better than random sequences
暂无分享,去创建一个
[1] D. Ruelle,et al. Ergodic theory of chaos and strange attractors , 1985 .
[2] T. Kohda,et al. Statistics of chaotic binary sequences , 1997, IEEE Trans. Inf. Theory.
[3] J. Cernák. Digital generators of chaos , 1996 .
[4] M. Pursley,et al. Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication - Part I: System Analysis , 1977, IEEE Transactions on Communications.
[5] M. Pursley,et al. Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication - Part II: Code Sequence Analysis , 1977, IEEE Transactions on Communications.
[6] Clare D. McGillem,et al. A chaotic direct-sequence spread-spectrum communication system , 1994, IEEE Trans. Commun..
[7] Tohru Kohda,et al. Explicit evaluations of correlation functions of Chebyshev binary and bit sequences based on Perron-Frobenius operator , 1994 .
[8] Tohru Kohda,et al. Pseudonoise Sequences by Chaotic Nonlinear Maps and Their Correlation Properties , 1993 .
[9] R. Rovatti,et al. Chaotic complex spreading sequences for asynchronous DS-CDMA. Part II. Some theoretical performance bounds , 1998 .
[10] Cong Ling,et al. Chaotic frequency hopping sequences , 1998, IEEE Trans. Commun..
[11] Riccardo Rovatti,et al. Chaotic complex spreading sequences for asynchronous DS-CDMA. I. System modeling and results , 1997 .