Universal Delay-Limited Simulation

Universal, delay-limited simulation of an unknown information source of a certain parametric family (e.g., the family of memoryless sources or Markov sources of a given order), given a training sequence from that source and a stream of independent and uniformly distributed bits, is considered. The goal of universal simulation is that the probability law of the generated sequence be identical to that of the training sequence, with minimum mutual information between the random processes generating both sequences. In the delay-limited setting, the simulation algorithm generates a random sequence sequentially, by delivering one symbol for each training symbol that is made available after a given initial delay, whereas the random bits are assumed to be available on demand. In this paper, the optimal universal delay-limited simulation scheme is characterized for broad parametric families, and the mutual information achieved by the proposed scheme is analyzed. The results are extended to a setting of variable delay.

[1]  Andrew R. Barron,et al.  Information-theoretic asymptotics of Bayes methods , 1990, IEEE Trans. Inf. Theory.

[2]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

[3]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[4]  Gadiel Seroussi,et al.  On universal types , 2004, IEEE Transactions on Information Theory.

[5]  Kevin Atteson,et al.  The asymptotic redundancy of Bayes rules for Markov chains , 1999, IEEE Trans. Inf. Theory.

[6]  N. Merhav,et al.  Addendum to "On Universal Simulation of Information Sources Using Training Data , 2005, IEEE Trans. Inf. Theory.

[7]  de Ng Dick Bruijn A combinatorial problem , 1946 .

[8]  J. L. Denny,et al.  On tests for Markov dependence , 1978 .

[9]  Sanjeev R. Kulkarni,et al.  Separation of random number generation and resolvability , 2000, IEEE Trans. Inf. Theory.

[10]  Sergio Verdú,et al.  Channel simulation and coding with side information , 1994, IEEE Trans. Inf. Theory.

[11]  Neri Merhav,et al.  On universal simulation of information sources using training data , 2004, IEEE Transactions on Information Theory.

[12]  Neri Merhav,et al.  Optimal sequential probability assignment for individual sequences , 1994, IEEE Trans. Inf. Theory.

[13]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

[14]  Mamoru Hoshi,et al.  Interval algorithm for random number generation , 1997, IEEE Trans. Inf. Theory.

[15]  Fumio Kanaya,et al.  Channel simulation by interval algorithm: A performance analysis of interval algorithm , 1999, IEEE Trans. Inf. Theory.

[16]  Robert M. Gray,et al.  Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion , 1977, IEEE Trans. Inf. Theory.

[17]  Sergio Verdú,et al.  Simulation of random processes and rate-distortion theory , 1996, IEEE Trans. Inf. Theory.

[18]  A. Palma On Completeness of Random Transition Count for Markov Chains , 2006 .

[19]  Neri Merhav Achievable key rates for universal simulation of random data with respect to a set of statistical tests , 2004, IEEE Transactions on Information Theory.

[20]  Stephen E. Fienberg,et al.  Testing Statistical Hypotheses , 2005 .

[21]  P. Whittle,et al.  Some Distribution and Moment Formulae for the Markov Chain , 1955 .

[22]  O. F. Cook The Method of Types , 1898 .

[23]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.