Information sources using chaotic dynamics

Proceedings of the IEEE

Volumn 90, Issue 5, 2002, Pages 641-661

  Kohda, Tohru ^a,b,c,d,e,f  

^a IEEE   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c Kyushu University ^*  (Japan)

^d Institute of Electrical   (Japan)

^e IPSJ   (Japan)

^f Inst Electronics Info Commun E   (Japan)

Author keywords

Asynchronous DS CDMA system; Bernoulli shift; Central limit theorem; Chaotic dynamics; Digital watermarking; I.i.d. Sequence; Image transmission; Independence; Markov chain; Multiple access interference; SS codes; Stream cipher system

Indexed keywords

CODE DIVISION MULTIPLE ACCESS; COLOR IMAGE PROCESSING; DIGITAL COMMUNICATION SYSTEMS; DIGITAL WATERMARKING; IMAGE COMMUNICATION SYSTEMS; MARKOV PROCESSES; SHIFT REGISTERS; SPECTRUM ANALYSIS;

ASYNCHRONOUS DS/CDMA SYSTEM; BERNOULLI SHIFT; CENTRAL LIMIT THEOREM; CHAOTIC DYNAMICS; INDEPENDENCE; INDEPENDENT IDENTICALLY DISTRIBUTED (I.I.D.) SEQUENCE; SS CODES; STREAM CIPHER SYSTEM;

CHAOS THEORY;

EID: 0038194092     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2002.1015000     Document Type: Article

References (99)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 623-656, 1948.
2. F. M. Reza, An Introduction to Information Theory. New York: McGraw-Hill. 1961.
3. R. B. Ash, Information Theory. New York: Dover, 1965.
4. C. M. Goldie and R, G. E. Pinch, Communication Theory. Cambridge, U.K.: Cambridge Univ. Press, 1991.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
6. T. S. Han and K. Kobayashi, "Mathematics of Information and Coding," in Translations of Mathematical Monograph. Providence, RI: American Mathematical Soc., 2002, vol. 203.
7. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. Tokyo, Japan: McGraw-Hill, 1979.
8. R. E. Blahut, Digital Transmission of Information. Reading, MA: Addison-Wesley, 1990.
9. M. Kac, Statistical Independence in Probability Analysis and Number Theory. Washington, DC: Math. Assoc. Amer., 1959.
10. M. Loève, "Probability theory I," in Graduate Texts in Mathematics 45: Springer-Verlag, 1977.
11. P. Billingsley, Probability and Measure. New York: Wiley, 1995.
12. P. R. Halmos, Lectures on Ergodic Theory. Tokyo, Japan: Math. Soc. Jpn., 1956.
13. P. C. Shields, "The interaction between ergodic theory and information theory," IEEE Trans. Inform. Theory, vol. 44, pp. 2079-2093, Sept. 1998.
14. M. B. Pursley, "Performance evaluation for phase-coded spread-spectrum multiple-access communication. I. System analysis," IEEE Trans. Commun., vol. COM-25, pp. 795-799, Aug. 1977.
15. M. B. Pursley and D. V. Sarwate, "Performance evaluation for phase-coded spread-spectrum multiple-access communication. II. Code sequence analysis," IEEE Trans. Commun., vol. COM-25, pp. 800-803, Aug. 1977.
16. K. Yao, "Error probability of asynchronous spread spectrum multiple access communication systems," IEEE Trans. Commun., vol. COM-25, pp. 803-809, Aug. 1977.
17. M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications Handbook. New York: McGraw-Hill, 1994.
18. J. L. Massey, "An introduction to contemporary cryptology," Proc. IEEE, vol. 76, pp. 533-549, May 1988.
19. J. von Neumann and Summary written by G. E. Forsythe, "Various techniques used in connection with random digit," Natl. Bur. Stand., ser. Applied Math., vol. 12, pp. 36-38, 1951.
20. D. Knuth, The Art of Computer Programming 2, Seminumerical Algorithms, 2nd ed. Reading, MA: Addison-Wesley, 1981.
21. D. V. Sarwate and M. B. Pursley, "Crosscorrelation properties of pseudorandom and related sequences," Proc. IEEE, vol. 68, pp. 593-619, Mar. 1980.
22. S. M. Ulam and J. von Neumann, "On combination of stochastic and deterministic processes," Bull. Math. Soc., vol. 53, p. 1120, 1947.
23. R. E. Kalman, "Nonlinear aspects of sampled-data control systems," in Proc. Symp. Nonlinear Circuit Analysis VI, 1956, pp. 273-313.
24. L. M. Pecora and T. L. Carroll, "Synchronization in chaotic systems," Phys. Rev. Lett., vol. 64, pp. 821-824, Feb. 1990.
25. G. Heidari-Bateni, C. D. McGillem, and M. F. Tenorio, "A novel multiple-address digital communication system using chaotic signals," in Proc. 1992 IEEE Int. Conf. Communications (ICC '92), 1992, p. 1232.
26. G. Heidari-Bateni and C. D. McGillem, "A chaotic direct-sequence spread-spectrum communication system," IEEE Trans. Commun., vol. 42, pp. 1524-1527, Feb./Mar./Apr. 1994.
27. U. Parlitz and S. Ergezinger, "Robust communication based on chaotic spreading sequences," Phys. Lett. A, vol. 188, pp. 146-150, 1994.
28. T. Kohda, A. Tsuneda, and T. Sakae, "Chaotic binary sequences by Chebychev maps and their correlation properties," in Proc. IEEE 2nd Int. Symp. Spread Spectrum Techniques and Applications, 1992, pp. 63-66.
29. T. Kohda and A. Tsuneda, "Pseudonoise sequences by chaotic nonlinear maps and their correlation properties," IEICE Trans. Commun., vol. E76-B, pp. 855-862, Aug. 1993.
30. _, "Explicit evaluations of correlation functions of Chebyshev binary and bit sequences based on Perron-Frobenius operator," IEICE Trans. Fundam., vol. E77-A, pp. 1794-1800, Nov. 1994.
31. D. S. Broomhead, J. P. Huke, and M. R. Muldoon, "Codes for spread spectrum applications generated using chaotic dynamical systems," Dyn. Stabil. Syst., vol. 14, pp. 95-105, 1999.
32. T. Kohda and A. Tsuneda, "Statistics of chaotic binary sequences," IEEE Trans. Inform. Theory, vol. 43, pp. 104-112, Jan. 1997.
33. T. Kohda, "Sequences of i.i.d. binary random variables using chaotic dynamics," in Sequences and Their Applications, C. Ding, T. Helleseth, and H. Niederreiter, Eds. New York: Springer-Verlag, 1999, pp. 297-307.
34. T. Kohda and A. Tsuneda, "Stream cipher systems based on chaotic binary sequences," in Proc. 1996 Symp. Cryptography and Information Security, 1996, Paper SCIS96-11B, pp. 1-8.
35. T. Kohda, K. Ishii, and A. Tsuneda, "Image transmission systems through CDMA channels using spreading sequences of variable-period," in Proc. IEEE 4th Int. Symp. Spread Spectrum Techniques and Applications, 1996, pp. 781-784.
36. T. Kohda, Y. Ookubo, and K. Ishii, "A color image communication using YIQ signals by spreading spectrum techniques," in Proc. IEEE 5th Int. Symp. Spread Spectrum Techniques and Applications, 1998, pp. 743-747.
37. T. Kohda, Y. Ookubo, and K. Shinokura, "Digital watermarking through CDMA channels using spread spectrum techniques," in Proc. IEEE 6th Int. Symp. Spread Spectrum Techniques and Applications, 2000, pp. 671-674.
38. R. A. Matthews, "On the derivation of a chaotic encryption algorithm," Cryptologia, vol. 13, pp. 29-42, 1989.
39. D. D. Wheeler and R. A. Matthews, "Supercomputer investigations of a chaotic encryption algorithm," Cryptologia, vol. 15, pp. 140-152, Apr. 1991.
40. T. Habutsu, Y. Nishio, I. Sasase, and S. Mori, "A secret key cryptosystem by iterating a chaotic map," in Proceedings of Advances in Cryptology - EUROCRYPT'91. Berlin, Germany: Springer-Verlag, 1991, pp. 127-140.
41. M. Götz, K. Kelber, and W. Schwarz, "Discrete-time chaotic encryption systems. I. Statistical design approach," IEEE Trans. Circuits Syst. I, vol. 44, pp. 963-970, Oct. 1997.
42. F. Dachselt, K. Kelber, and W. Schwarz, "Discrete-time chaotic encryption systems. III. Cryptographical analysis," IEEE Trans. Circuit Syst., vol. 45, no. 9, pp. 983-988, 1998.
43. M. S. Bapista, "Cryptography with chaos," Phys. Lett. A, vol. 240, no. 1/2, pp. 50-54, 1998.
44. G. Jakimoski and L. Kocarev, "Chaos and cryptography: Block encryption ciphers based on chaotic maps," IEEE Trans. Circuits Syst. I, vol. 48, pp. 163-169, Feb. 2001.
45. G. Mazzini, G. Setti, and R. Rovatti, "Chaotic complex spreading sequences for asynchronous DS-CDMA. I. System modeling and results," IEEE Trans. Circuit Syst. I, vol. 44, pp. 937-947, Oct. 1997.
46. R. Rovatti and G. Mazzini, "Interference in DS-CDMA systems with exponentially vanishing autocorrelations: Chaos-based spreading is optimal," Electron. Lett., vol. 34, pp. 1911-1913, Oct. 1998.
47. G. Mazzini, R. Rovatti, and G. Setti, "Interference minimisation by autocorrelation shaping in asynchronous DS-CDMA systems: Chaos-based spreading is nearly optimal," Electron. Lett., vol. 35, pp. 1054-1055, June 1999.
48. G. Setti, R. Rovatti, and G. Mazzini, "Synchronization mechanism and optimization of spreading sequences in chaos-based DS-CDMA systems," IEICE Trans. Fundam.,vol. E82-A, pp. 1737-1746, 1999.
49. R. Rovatti, G. Mazzini, and G. Setti, "A tensor approach to higher order expectations of quantized chaotic trajectories. I. General theory and specialization to piecewise affine Markov systems," IEEE Trans. Circuits Syst. I, vol. 47, pp. 1571-1583, Nov. 2000.
50. G. Mazzini, R. Rovatti, and G. Setti, "A tensor approach to higher order expectations of quantized chaotic trajectories. II. Applications to chaos-based DS-CDMA in multipath environments," IEEE Trans. Circuits Syst. I, vol. 47, pp. 1584-1596, Nov. 2000.
51. M. F. Barnsley, Fractal Image Compression. Natick, MA: AK Peters, 1993.
52. F. Kanaya, "A chaos model of finite-order Markov sources and arithmetic coding," in Proc. 1997 IEEE Int. Symp. Information Theory, 1997, p. 247.
53. T. S. Han and M. Hoshi, "Interval algorithm for random number generation," IEEE Trans. Inform. Theory, vol. 43, pp. 599-611, Mar. 1997.
54. K. Visweswariah, S. R. Kulkami, and S. Verdú, "Source codes as random number generators," IEEE Trans. Inform. Theory, vol. 44, pp. 462-471, Mar. 1997.
55. A. Juels, M. Jacobsson, E. Schreiver, and B. K. Hillyer, "How to turn loaded dice into fair coins," IEEE Trans. Inform. Theory, vol. 46, pp. 911-921, May 2000.
56. M. Naslünd and A. Russell, "Extraction of optimally unbiased bits from a biased source," IEEE Trans. Inform. Theory, vol. 46, pp. 1093-1103, May 2000.
57. T. Kohda and H. Fujisaki, "Kalman's recognition of chaotic dynamics in designing Markov information sources," IEICE Trans. Fundam., vol. E82-A, pp. 1747-1753, Aug. 1999.
58. T. Kohda and A. Tsuneda, "Design of sequences of p-ary random variables," in Proc. 1997 IEEE Int. Symp. Information Theory, 1997, p. 76.
59. T. Kohda, A. Tsuneda, and A. J. Lawrence, "Correlational properties of Chebyshev chaotic sequences," J. Time Ser. Anal., vol. 21, pp. 181-191, 2000.
60. T. Kohda and H. Fujisaki, "Jacobian elliptic Chebyshev rational maps," Physica D, vol. 148, pp. 242-254, 2001.
61. T. Kohda and A. Tsuneda, "Information sources using chaotic dynamics," in Chaotic Electronics in Telecommunications, M. P. Kennedy, R. Rovatti, and G. Setti, Eds. Boca Raton, FL: CRC, 2000, pp. 81-127.
62. T. Kohda and H. Fujisaki, "Variances of multiple access interference: Code average against data average," Electron. Lett., vol. 36, pp. 1717-1719, Sept. 2000.
63. Y. Jitsumatu and T. Kohda, "On a synchronization problem in an asynchronous DS/CDMA sytem," in Proc. 5th Workshop on Stochastic Numerics, RIMS Kokyuroku, vol. 1240, 2001, pp. 88-12.
64. _, "Bit error rate of incompletely synchronized correlator in an asynchronous DS/CDMA system using SS Markovian codes," Elctron. Lett., vol. 38, no. 9, pp. 415-416, 2002.
65. T. Kohda, K. Matsumura, and Y. Jitsumatu, "Bit error rate in an asynchronous DS/CDMA system Markovian SS codes," in Proc. IEEE 7th Int. Symp. Spread Spectrum Techniques and Its Applications, Sept. 2002.
66. E. N. Lorenz, "Deterministic nonperiodic flow," J. Atoms. Sci., vol. 20, pp. 448-464, 1963.
67. R. M. May, "Simple mathematical models with very complicated dynamics," Nature, vol. 261, pp. 459-467, 1976.
68. E. A. Jackson, Perspective Nonlinear Dynamics. Cambridge, U.K.: Cambridge Univ. Press, 1989, vol. 1/2.
69. R. E. Kalman, "Randomness and probability," Math. Japonica, vol. 41, no. 1, pp. 41-58, 1995.
70. _, "Looking back 45 years - Conversation with von Neumann and Ulam - And also looking forward to 21st century," IEICE Trans. Fundam., vol. E82-A, pp. 1686-1691, Sept. 1999.
71. S. M. Ulam, A Collection of Mathematical Problems, New York: Interscience, 1960.
72. O. W. Rechard, "Invariant measures for many-one transformation, " Duke Math. J., vol. 23. pp. 477-488, 1956.
73. A. Lasota and M. C. Mackey, Chaos, Fractals, and Noise. New York: Springer-Verlag, 1994.
74. A. Lasota and J. A. Yorke, "On the existence of invariant measures for piecewise monotonic transformations," Trans. Amer. Math. Soc., vol. 186, pp. 481-488, 1973.
75. A. Boyarsky and M. Scarowsky, "On a class of transformations which have unique absolutely continuous invariant measures," Trans. Amer. Math. Soc., vol. 255, pp. 243-262, 1979.
76. R. L. Adler and T. J. Rivlin, "Ergodic and mixing properties of Chebyshev polynomials," in Proc. Amer. Math. Soc., vol. 15, 1964, p. 794.
77. T. J. Rivlin, Chebyshev Polynomials. New York: Wiley, 1990.
78. S. Grossmann and S. Thomae, "Invariant distributions and stationary correlation functions of one-dimensional discrete processes," Z. Naturforsch., vol. 32a, pp. 1353-1363, 1977.
79. B. O. Koopman, "Hamiltonian systems and transformations in Hilbert space," Proc. Nat'l. Acad. Sci., vol. 17, pp. 315-318, 1931.
80. G. D. Birchoff and B. O. Koopman, "Recent contributions to the ergodic theory," Proc. Nat'l. Acad. Sci., vol. 18, pp. 279-282, 1932.
81. T. Sang, R. Wang, and Y. Yan, "Constructing discrete sequences for digital communications based on correlational analysis," IEEE Trans. Signal Processing, vol. 48, pp. 2557-2565, Sept. 2000.
82. E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, 4th ed. London, U.K.: Cambridge Univ. Press, 1935.
83. T. Geisel and V. Fairen, "Statistical properties of chaos in Chebyshev maps," Phys. Lett., vol. 105A, pp. 263-266, 1984.
84. S. Katsura and W. Fukuda, "Exactly solvable models showing chaotic behavior," Physica A, vol. 130, pp. 597-605, 1985.
85. K. Umeno, "Method of constructing exactly solvable chaos," Phys. Rev. E, vol. 55, pp. 5280-5284, May 1997.
86. W. F. Schreiber, "Spread-spectrum television broadcasting," SMPTE J., pp. 538-549, Aug. 1992.
87. J. M. Holtzman, "A simple, accurate method to calculate spread-spectrum multiple-access error probabilities," IEEE Trans. Commun., vol. 40, pp. 461-464, Mar. 1992.
88. K. B. Letaief, "Efficient evaluation of the error probabilities of spread-spectrum multiple-access communications," IEEE Trans. Commun., vol. 45, pp. 239-, Feb. 1997.
89. K. H. Käikkäinen, "Mean-square cross-correlation as a performance measure for spreading code families," in Proc. IEEE 2nd Int. Symp. Spread Spectrum Techniques and Applications, 1992, pp. 147-150.
90. D. V. Sarwate, "Meeting the Welch bound with equality," in Sequences and Their Applications, C. Ding, T. Helleseth, and H. Niederreiter, Eds. New York: Springer-Verlag, 1999, pp. 79-102.
91. L. Cong and L. Shaoqian, "Chaotic spreading sequences with multiple access performance better than random sequences," IEEE Trans. Circuits Syst. I, vol. 47, pp. 394-397, Mar. 2000.
92. C. C. Chen, E. Biglieri, and K. Yao, "Design of spread spectrum sequences using ergodic theory," in 2000 IEEE Int. Symp. Information Theory, Sorrento, Italy, June 25-30, 2000, p. 379.
93. W. E. Stark and D. V. Sarwate, "Kronecker sequences for spread-spectrum communication," Proc Inst. Elec. Eng. F, vol. 128, no. 2, pp. 104-109, 1981.
94. L. R. Welch, "Lower bounds on the maximum cross correlation of signals," IEEE Trans. Inform. Theory, vol. IT-20, pp. 397-399, 1974.
95. R. Fortet, "Sur une suite egalement répartie," Studio Math., vol. 9, pp. 54-69, 1940.
96. kt)," Ann. Math., vol. 47, pp. 33-19, 1946.
97. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. 15, pp. 122-127, 1969.
98. R. A. Rueppel, Analysis and design of stream ciphers. New York: Springer-Verlag, 1986.
99. R. J. Anderson, I. J. Cox, S. H. Low, and N. F. Maxemchuk, "Copyright and privacy protection," IEEE J. Select. Areas Commun., vol. 16, pp. 449-993, May 1998.