CDC 2006, San Diego 1 Control of Discrete-Time Partially- Observed Jump Linear Systems Over Causal Communication Systems C. D. Charalambous Depart. of.

Slides:



Advertisements
Similar presentations
Random Processes Introduction (2)
Advertisements

A journey through data rate theorems for communication and control Massimo Franceschetti.
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers Kiran Kedlaya Sergey Yekhanin MIT Microsoft Research.
Sampling and Pulse Code Modulation
Network Utility Maximization over Partially Observable Markov Channels 1 1 Channel State 1 = ? Channel State 2 = ? Channel State 3 = ? Restless.
Information Theory EE322 Al-Sanie.
OFDM Modulated Cooperative Multiple-Access Channel With Network-Channel Coding.
Information Theoretical Security and Secure Network Coding NCIS11 Ning Cai May 14, 2011 Xidian University.
Chain Rules for Entropy
CWIT Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems Charalambos D. Charalambous Dept. of Electrical.
Chapter 6 Information Theory
Distributed Consensus with Limited Communication Data Rate Tao Li Key Laboratory of Systems & Control, AMSS, CAS, China ANU RSISE System and Control Group.
1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.
Fundamental limits in Information Theory Chapter 10 :
TCOM 501: Networking Theory & Fundamentals
Location Estimation in Sensor Networks Moshe Mishali.
1 Network Source Coding Lee Center Workshop 2006 Wei-Hsin Gu (EE, with Prof. Effros)
Convergence Speed of Binary Interval Consensus Moez Draief Imperial College London Milan Vojnović Microsoft Research IEEE Infocom 2010, San Diego, CA,
3/23/04 1 Information Rates for Two-Dimensional ISI Channels Jiangxin Chen and Paul H. Siegel Center for Magnetic Recording Research University of California,
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
USAFrance OCEAN. Control and Communication: an overview Jean-Charles Delvenne CMI, Caltech May 5, 2006.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland Joint work with Randy Cogill, University of Virginia.
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
STABILIZING a NONLINEAR SYSTEM with LIMITED INFORMATION FEEDBACK Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng.,
Information Theory & Coding…
INFORMATION THEORY BYK.SWARAJA ASSOCIATE PROFESSOR MREC.
The Complex Braid of Communication and Control Massimo Franceschetti.
Analyzing the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 22,
Computing and Communicating Functions over Sensor Networks A.Giridhar and P. R. Kumar Presented by Srikanth Hariharan.
Compressive Data Gathering for Large-Scale Wireless Sensor Networks Chong Luo Feng Wu Jun Sun Chang Wen Chen.
Mathematical Preliminaries. 37 Matrix Theory Vectors nth element of vector u : u(n) Matrix mth row and nth column of A : a(m,n) column vector.
Shifted Codes Sachin Agarwal Deutsch Telekom A.G., Laboratories Ernst-Reuter-Platz Berlin Germany Joint work with Andrew Hagedorn and Ari Trachtenberg.
Basic Concepts of Encoding Codes, their efficiency and redundancy 1.
Channel Capacity.
Extremal Problems of Information Combining Alexei Ashikhmin  Information Combining: formulation of the problem  Mutual Information Function for the Single.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Compressive Sensing for Multimedia Communications in Wireless Sensor Networks By: Wael BarakatRabih Saliba EE381K-14 MDDSP Literary Survey Presentation.
Toward a Secure Data-Rate Theorem Paul Cuff. Control Setting Controller Encoder System (Plant) Sensors Rate R UiUi XiXi YiYi.
COMMUNICATION NETWORK. NOISE CHARACTERISTICS OF A CHANNEL 1.
Communication Under Normed Uncertainties S. Z. Denic School of Information Technology and Engineering University of Ottawa, Ottawa, Canada C. D. Charalambous.
Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding Yuchong Hu, Yinlong Xu, Xiaozhao Wang, Cheng Zhan and Pei.
Erasure Coding for Real-Time Streaming Derek Leong and Tracey Ho California Institute of Technology Pasadena, California, USA ISIT
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
Coding Theory Efficient and Reliable Transfer of Information
CHAPTER 5 SIGNAL SPACE ANALYSIS
Transmission over composite channels with combined source-channel outage: Reza Mirghaderi and Andrea Goldsmith Work Summary STATUS QUO A subset Vo (with.
ON THE INTERMEDIATE SYMBOL RECOVERY RATE OF RATELESS CODES Ali Talari, and Nazanin Rahnavard IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 60, NO. 5, MAY 2012.
On Coding for Real-Time Streaming under Packet Erasures Derek Leong *#, Asma Qureshi *, and Tracey Ho * * California Institute of Technology, Pasadena,
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
Nour KADI, Khaldoun Al AGHA 21 st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications 1.
1 EE571 PART 3 Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic Engineering Eastern.
Jayanth Nayak, Ertem Tuncel, Member, IEEE, and Deniz Gündüz, Member, IEEE.
Jayanth Nayak, Ertem Tuncel, Member, IEEE, and Deniz Gündüz, Member, IEEE.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
The Finite-state channel was introduced as early as 1953 [McMillan'53]. Memory captured by channel state at end of previous symbol's transmission: - S.
Fidelity of a Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Quantum Automatic Repeat Request (ARQ)
Source Encoder Channel Encoder Noisy channel Source Decoder Channel Decoder Figure 1.1. A communication system: source and channel coding.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Channel Coding Theorem (The most famous in IT) Channel Capacity; Problem: finding the maximum number of distinguishable signals for n uses of a communication.
Mutual Information, Joint Entropy & Conditional Entropy
CDC Relative Entropy Applied to Optimal Control of Stochastic Uncertain Systems on Hilbert Space Nasir U. Ahmed School of Information Technology.
CDC Control over Wireless Communication Channel for Continuous-Time Systems C. D. Charalambous ECE Department University of Cyprus, Nicosia, Cyprus.
Network Topology Single-level Diversity Coding System (DCS) An information source is encoded by a number of encoders. There are a number of decoders, each.
Chapter 4: Information Theory. Learning Objectives LO 4.1 – Understand discrete and continuous messages, message sources, amount of information and its.
Computing and Compressive Sensing in Wireless Sensor Networks
Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Unequal Error Protection for Video Transmission over Wireless Channels
Guosong Yang1, A. James Schmidt2, and Daniel Liberzon2
Presentation transcript:

CDC 2006, San Diego 1 Control of Discrete-Time Partially- Observed Jump Linear Systems Over Causal Communication Systems C. D. Charalambous Depart. of ECE University of Cyprus Nicosia, Cyprus S. Z. Denic Depart. of ECE University of Arizona Tucson

2 CDC 2006, San Diego Control Over Communication Channel Block diagram of a control-communication problem The source is partially observed jump system and communication channel is causal Sensor Communication Channel Decoder Capacity Limited Link Collection and Transmission of Information (Node 1) Reconstruction with Distortion Error (Node 2) Dynamical System Encoder Sink

3 CDC 2006, San Diego Critical Features Critical features from the communication and control point of view  Amount of data produced by a particular source (sensor) – source entropy  Capacity of the communication channel  Controllability and observability of the controlled system

4 CDC 2006, San Diego Nair, Dey, and Evans,“Communication limited stabilisability of jump Markov linear systems,” In Proc. 15th Ini. Symp.Math. The. New. Sys., U. Notre Dame, USA, Aug Nair, Dey, and Evans, “Infimum data rates for stabilising Markov jump linear systems,” in Proc. 42th IEEE Conf Dec. Contr., pp , C. D. Charalambous, “Information theory for control systems: causality and feedback,” in Workshop on Communication Networks and Complexity, Athens, Greece, August 30-September 1, References [Plenty More]

5 CDC 2006, San Diego Overview Problem formulation Causal communication channels and systems  Mutual information for causal channels  Data processing inequalities for causal communication channels  Capacity for causal communication channels  Rate distortion for causal communication channels  Information transmission theorem Necessary conditions for observability and stabilizability over causal communication channels Conclusions

CDC 2006, San Diego 6 Problem Formulation Problem formulation Causal communication channels and systems Necessary conditions for observability and stabilizability over causal communication channels Conclusions

7 CDC 2006, San Diego Problem Formulation Block diagram of control/communication system independent

8 CDC 2006, San Diego Problem Formulation Encoder, Decoder, Controller are causal Communication channel causality with feedback

9 CDC 2006, San Diego Problem Formulation System performance measures Definition 2.1: (Observabilit in Probability). The system is observable in probability if for any D, δ ≥ 0 there exist an encoder and decoder such that Definition 2.2: (Observability in r-th mean). The system is observable in r-th mean if there exist an encoder and decoder such that where D ≥ 0 is finite.

10 CDC 2006, San Diego Problem Formulation System performance measures Definition 2.3: (Stabilizability in probability). The system is stabilizable in probability if for any D, δ ≥ 0 there exist a controller, encoder and decoder such that Definition 2.4: (Stabilizability in r-th mean). The system is asymptotically stabilizable in r-th mean if there exist a controller, encoder and decoder such that where D ≥ 0 is finite.

CDC 2006, San Diego 11 Causal Communication Channels and Systems Problem formulation Causal communication channels and systems  Mutual information for causal channels  Data processing inequalities for causal communication channels  Capacity for causal communication channels  Rate distortion for causal communication channels  Information transmission theorem Necessary conditions for observability and stabilizability over causal communication channels Conclusions

12 CDC 2006, San Diego Causal Communication Channels and Systems Lemma 3.2: Let denote the self-mutual information when the RND is restricted to a non-anticipative or causal feedback channel with memory. Then, the restricted mutual information is given by Directed Information

13 CDC 2006, San Diego Causal Communication Channels and Systems Remark: In general, causal mutual information is not symmetric Data processing inequality for causal channels

14 CDC 2006, San Diego Causal Communication Channels and Systems Channel capacity based on the causal mutual information Rate distortion based on the causal mutual information

15 CDC 2006, San Diego Causal Communication Channels and Systems Theorem 4.1: (Information Transmission Theorem) Suppose the different communication blocks in Fig. 1 form a Markov chain. Consider a control-communication system where the communication channel is restricted to being causal. A necessary condition for reconstructing a source signal up to a distortion level D from is given by

CDC 2006, San Diego 16 Necessary conditions for observability and stabilizability over causal communication channels Problem formulation Causal communication channels and systems  Mutual information for causal channels  Data processing inequalities for causal communication channels  Capacity for causal communication channels  Rate distortion for causal communication channels  Information transmission theorem Necessary conditions for observability and stabilizability over causal communication channels Conclusions

17 CDC 2006, San Diego Necessary conditions for observability and stabilizability over causal communication channels Lemma 4.2. Consider the following single letter distortion measure, where Then, a lower bound for is given by where It follows and under some conditions, this lower bound is exact for

18 CDC 2006, San Diego Necessary conditions for observability and stabilizability over causal communication channels Theorem 4.3. Consider a jump control-communication system where is the observed process at time t. Let be a steady state distribution of the underlying Markov chain. Introduce the following notation A necessary condition for asymptotic observability and stabilizability in probability is given by

19 CDC 2006, San Diego Necessary conditions for observability and stabilizability over causal communication channels is the covariance matrix of the Gaussian distribution which satisfies A necessary condition for asymptotic observability and stabilizability in r-th mean is given by

20 CDC 2006, San Diego Conclusion General necessary conditions for observability and stabilizability for jump linear systems controlled over a causal communication channel are derived. Causal Information Theory is Essential for Channels with Feedback and Memory Different criteria for observability and stabilizability corresponds to different necessary condition. Future work  Sufficient conditions (design encoders and decoders)  Channel-source matching