Optimal Design of Sequential Real-Time Communication Systems

Optimal design of sequential real-time communication of a Markov source over a noisy channel is investigated. In such a system, the delay between the source output and its reconstruction at the receiver should equal a fixed prespecified amount. An optimal communication strategy must minimize the total expected symbol-by-symbol distortion between the source output and its reconstruction. Design techniques or performance bounds for such real-time communication systems are unknown. In this paper a systematic methodology, based on the concepts of information structures and information states, to search for an optimal real-time communication strategy is presented. This methodology trades off complexity in communication length (linear in contrast to doubly exponential) with complexity in alphabet sizes (doubly exponential in contrast to exponential). As the communication length is usually order of magnitudes bigger than the alphabet sizes, the proposed methodology simplifies the search for an optimal communication strategy. In spite of this simplification, the resultant optimality equations cannot be solved efficiently using existing algorithmic techniques. The main idea is to formulate a zero-delay communication problem as a dynamic team with nonclassical information structure. Then, an appropriate choice of information states converts the dynamic team problem into a centralized stochastic control problem in function space. Thereafter, Markov decision theory is used to derive nested optimality equations for choosing an optimal design. For infinite horizon problems, these optimality equations give rise to a fixed point functional equation. Communication systems with fixed finite delay constraint, a higher-order Markov source, and channels with memory are treated in the same manner after an appropriate expansion of the state space. Thus, this paper presents a comprehensive methodology to study different variations of real-time communication.

[1]  Y. Ho,et al.  Teams, signaling, and information theory , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.

[2]  Brockway Mcmillan,et al.  Communication systems which minimize coding noise , 1969 .

[3]  Demosthenis Teneketzis,et al.  On the Structure of Optimal Real-Time Encoders and Decoders in Noisy Communication , 2006, IEEE Transactions on Information Theory.

[4]  Sebastian Thrun,et al.  Monte Carlo POMDPs , 1999, NIPS.

[5]  Leslie Pack Kaelbling,et al.  Continuous-State POMDPs with Hybrid Dynamics , 2008, ISAIM.

[6]  Demosthenis Teneketzis Communication in decentralized control , 1980 .

[7]  Peter Whittle,et al.  Optimization Over Time , 1982 .

[8]  George E. Monahan,et al.  A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms , 2007 .

[9]  Ali Esmaili,et al.  Probability and Random Processes , 2005, Technometrics.

[10]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[11]  Roger Colbeck,et al.  Simple channel coding bounds , 2009, 2009 IEEE International Symposium on Information Theory.

[12]  H. Witsenhausen Separation of estimation and control for discrete time systems , 1971 .

[13]  Alexei Makarenko,et al.  Parametric POMDPs for planning in continuous state spaces , 2006, Robotics Auton. Syst..

[14]  Chelsea C. White,et al.  Solution Procedures for Partially Observed Markov Decision Processes , 1989, Oper. Res..

[15]  Neri Merhav,et al.  Source coding exponents for zero-delay coding with finite memory , 2003, IEEE Trans. Inf. Theory.

[16]  N. THOMAS GAARDER,et al.  On optimal finite-state digital transmission systems , 1982, IEEE Trans. Inf. Theory.

[17]  S. Kauffman,et al.  Dealing with the Complexity of Economic Calculations , 1997 .

[18]  O. Hernondex-lerma,et al.  Adaptive Markov Control Processes , 1989 .

[19]  Tamer Basar,et al.  Optimum design of measurement channels and control policies for linear-quadratic stochastic systems , 1994 .

[20]  Terrence L. Fine,et al.  Properties of an optimum digital system and applications , 1964, IEEE Trans. Inf. Theory.

[21]  Hans S. Witsenhausen,et al.  A standard form for sequential stochastic control , 1973, Mathematical systems theory.

[22]  Tamás Linder,et al.  Causal coding of stationary sources and individual sequences with high resolution , 2006, IEEE Transactions on Information Theory.

[23]  M. K. Ghosh,et al.  Discrete-time controlled Markov processes with average cost criterion: a survey , 1993 .

[24]  John Rust,et al.  Dealing with the Complexity of Economic Calculations , 1996 .

[25]  Tsachy Weissman,et al.  Universal Zero-Delay Joint Source–Channel Coding , 2006, IEEE Transactions on Information Theory.

[26]  Polly S Nichols,et al.  Agreeing to disagree. , 2005, General dentistry.

[27]  Philippe Piret Causal sliding block encoders with feedback (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[28]  Alvin W Drake,et al.  Observation of a Markov process through a noisy channel , 1962 .

[29]  John Rust Using Randomization to Break the Curse of Dimensionality , 1997 .

[30]  Tamás Linder,et al.  Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding , 2004, IEEE Transactions on Signal Processing.

[31]  W. Lovejoy A survey of algorithmic methods for partially observed Markov decision processes , 1991 .

[32]  S. P. Lloyd Rate vs fidelity for the binary source , 1977, The Bell System Technical Journal.

[33]  Pravin Varaiya,et al.  Stochastic Systems: Estimation, Identification, and Adaptive Control , 1986 .

[34]  Tamás Linder,et al.  A zero-delay sequential scheme for lossy coding of individual sequences , 2001, IEEE Trans. Inf. Theory.

[35]  Tamer Basar,et al.  Simultaneous design of measurement and control strategies for stochastic systems with feedback , 1989, Autom..

[36]  H. Witsenhausen Some Remarks on the Concept of State , 1976 .

[37]  H. Witsenhausen On the structure of real-time source coders , 1979, The Bell System Technical Journal.

[38]  H. Vincent Poor,et al.  New channel coding achievability bounds , 2008, 2008 IEEE International Symposium on Information Theory.

[39]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[40]  Neil Immerman,et al.  The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.

[41]  J. L. Devore A note on the observation of a Markov source through a noisy channel (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[42]  Saleem A. Kassam,et al.  Finite-state Markov model for Rayleigh fading channels , 1999, IEEE Trans. Commun..

[43]  M. Aschwanden Statistics of Random Processes , 2021, Biomedical Measurement Systems and Data Science.

[44]  Onésimo Hernández-Lerma,et al.  Controlled Markov Processes , 1965 .

[45]  Alʹbert Nikolaevich Shiri︠a︡ev,et al.  Statistics of random processes , 1977 .

[46]  Tsachy Weissman,et al.  On limited-delay lossy coding and filtering of individual sequences , 2002, IEEE Trans. Inf. Theory.

[47]  R. Radner,et al.  Economic theory of teams , 1972 .

[48]  Pascal Poupart,et al.  Point-Based Value Iteration for Continuous POMDPs , 2006, J. Mach. Learn. Res..

[49]  David L. Neuhoff,et al.  Causal source codes , 1982, IEEE Trans. Inf. Theory.

[50]  N. Zhang,et al.  Algorithms for partially observable markov decision processes , 2001 .

[51]  Chelsea C. White,et al.  A survey of solution techniques for the partially observed Markov decision process , 1991, Ann. Oper. Res..

[52]  Sebastian Engell New results on the real-time transmission problem , 1987, IEEE Trans. Inf. Theory.

[53]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[54]  G. Grimmett,et al.  Probability and random processes , 2002 .

[55]  Jean C. Walrand,et al.  Optimal causal coding - decoding problems , 1983, IEEE Trans. Inf. Theory.

[56]  Yu-Chi Ho Team decision theory and information structures , 1980, Proceedings of the IEEE.