On Globally Optimal Encoding, Decoding, and Memory Update for Noisy Real-Time Communication Systems

The design of optimal joint source-channel communication strategies for a real-time com- munication system, i.e., a sequential communication system in which information must be transmitted and decoded withing axed-�nite delay, is considered. First, a system which runs for anite horizon and consists of arst-order Markov source, a real-time encoder, a memoryless noisy channel, a real-time decoder withnite memory, and distortion met- ric that accepts zero delay, is considered. The design of optimal real-time communication strategies is formulated as a decentralized stochastic optimization problem. There is no ex- isting solution methodology to solve general decentralized stochastic optimization problems overnite and innite horizon. This paper develops a systematic methodology, based on the notions of information structure and information state, to sequentially obtain globally optimal real-time encoding, decoding, and memory update strategies. Such a sequential decomposition results in a set of nested optimality equations whose solution determines an optimal communication strategy. This methodology is extended to two classes of innite- horizon systems, where optimal communication strategies are determined by the solution of an appropriate functional equation. The methodology is also extended to systems where distortion metric accepts axed-�nite delay, to systems with higher-order Markov sources, and to systems with channels with memory. Thus, this paper develops a comprehensive method to study dierent variations of real-time communication.

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

[2]  Linn I. Sennott,et al.  The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains , 1997, Advances in Applied Probability.

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

[4]  H. Witsenhausen A Counterexample in Stochastic Optimum Control , 1968 .

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

[6]  H. Witsenhausen ON SEQUENCES OF PAIRS OF DEPENDENT RANDOM VARIABLES , 1975 .

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

[8]  Adrian Segall,et al.  Stochastic processes in estimation theory , 1976, IEEE Trans. Inf. Theory.

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

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

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

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

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

[14]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

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

[16]  Pravin Varaiya,et al.  Simulation-based Uniform Value Function Estimates of Markov Decision Processes , 2006, SIAM J. Control. Optim..

[17]  Ram Zamir,et al.  Causal source coding of stationary sources with high resolution , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

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

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

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

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

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

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

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

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

[27]  L. Sennott Stochastic Dynamic Programming and the Control of Queueing Systems , 1998 .

[28]  Nils R. Sandell,et al.  Control of Finite-State, Finite Memory Stochastic Systems , 1974 .

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

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

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

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

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

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

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

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

[37]  D. Teneketzis,et al.  Asymptotic Agreement among Communicating Decisionmakers , 1983, 1983 American Control Conference.

[38]  Michael L. Littman,et al.  Algorithms for Sequential Decision Making , 1996 .

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

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

[41]  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.

[42]  A. Nerode,et al.  Linear automaton transformations , 1958 .

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

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

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

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

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

[48]  D. Teneketzis,et al.  On time diagnosis of discrete event systems , 2008, 2008 9th International Workshop on Discrete Event Systems.

[49]  Linn I. Sennott,et al.  On computing average cost optimal policies with application to routing to parallel queues , 1997, Math. Methods Oper. Res..

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

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

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

[53]  William S. Lovejoy,et al.  Computationally Feasible Bounds for Partially Observed Markov Decision Processes , 1991, Oper. Res..