The Complex Braid of Communication and Control Massimo Franceschetti.

Slides:



Advertisements
Similar presentations
1+eps-Approximate Sparse Recovery Eric Price MIT David Woodruff IBM Almaden.
Advertisements

A journey through data rate theorems for communication and control Massimo Franceschetti.
Information Theory EE322 Al-Sanie.
Capacity of Wireless Channels
Enhancing Secrecy With Channel Knowledge
How to do control theory and discrete maths at the same time?
Chain Rules for Entropy
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Intelligent Packet Dropping for Optimal Energy-Delay Tradeoffs for Wireless Michael J. Neely University of Southern California
CWIT Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems Charalambos D. Charalambous Dept. of Electrical.
Chapter 6 Information Theory
Achilleas Anastasopoulos (joint work with Lihua Weng and Sandeep Pradhan) April A Framework for Heterogeneous Quality-of-Service Guarantees in.
June 4, 2015 On the Capacity of a Class of Cognitive Radios Sriram Sridharan in collaboration with Dr. Sriram Vishwanath Wireless Networking and Communications.
Distributed Consensus with Limited Communication Data Rate Tao Li Key Laboratory of Systems & Control, AMSS, CAS, China ANU RSISE System and Control Group.
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
The 1’st annual (?) workshop. 2 Communication under Channel Uncertainty: Oblivious channels Michael Langberg California Institute of Technology.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.
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.
Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland Joint work with Randy Cogill, University of Virginia.
Review of Probability and Random Processes
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
Noise, Information Theory, and Entropy
The Scaling Law of SNR-Monitoring in Dynamic Wireless Networks Soung Chang Liew Hongyi YaoXiaohang Li.
Noise, Information Theory, and Entropy
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Distributed resource allocation in wireless data networks: Performance and design Alexandre Proutière Orange-FT / ENS Paris.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
By Avinash Sridrahan, Scott Moeller and Bhaskar Krishnamachari.
Delay-Throughput Tradeoff with Correlated Mobility in Ad-Hoc Networks Shuochao Yao*, Xinbing Wang*, Xiaohua Tian* ‡, Qian Zhang † *Department of Electronic.
Channel Capacity.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Toward a Secure Data-Rate Theorem Paul Cuff. Control Setting Controller Encoder System (Plant) Sensors Rate R UiUi XiXi YiYi.
1 A Randomized Space-Time Transmission Scheme for Secret-Key Agreement Xiaohua (Edward) Li 1, Mo Chen 1 and E. Paul Ratazzi 2 1 Department of Electrical.
COMMUNICATION NETWORK. NOISE CHARACTERISTICS OF A CHANNEL 1.
Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.
Wireless Communication Elec 534 Set I September 9, 2007 Behnaam Aazhang.
Erasure Coding for Real-Time Streaming Derek Leong and Tracey Ho California Institute of Technology Pasadena, California, USA ISIT
DIGITAL COMMUNICATIONS Linear Block Codes
CHAPTER 5 SIGNAL SPACE ANALYSIS
CS Statistical Machine learning Lecture 24
The Scaling Law of SNR-Monitoring in Dynamic Wireless Networks Soung Chang Liew Hongyi YaoXiaohang Li.
On Coding for Real-Time Streaming under Packet Erasures Derek Leong *#, Asma Qureshi *, and Tracey Ho * * California Institute of Technology, Pasadena,
Throughput-Smoothness Trade-offs in Streaming Communication Gauri Joshi (MIT) Yuval Kochman (HUJI) Gregory Wornell (MIT) 1 13 th Oct 2015 Banff Workshop.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
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.
A Low-Complexity Universal Architecture for Distributed Rate-Constrained Nonparametric Statistical Learning in Sensor Networks Avon Loy Fernandes, Maxim.
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.
Information without rolling dice Taehyung J. Lim Massimo Franceschetti Simons Conference, Austin, Texas, May 21, 2015.
Source Encoder Channel Encoder Noisy channel Source Decoder Channel Decoder Figure 1.1. A communication system: source and channel coding.
CDC 2006, San Diego 1 Control of Discrete-Time Partially- Observed Jump Linear Systems Over Causal Communication Systems C. D. Charalambous Depart. of.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Channel Coding Theorem (The most famous in IT) Channel Capacity; Problem: finding the maximum number of distinguishable signals for n uses of a communication.
ON AVCS WITH QUADRATIC CONSTRAINTS Farzin Haddadpour Joint work with Madhi Jafari Siavoshani, Mayank Bakshi and Sidharth Jaggi Sharif University of Technology,
1 Review of Probability and Random Processes. 2 Importance of Random Processes Random variables and processes talk about quantities and signals which.
CDC Control over Wireless Communication Channel for Continuous-Time Systems C. D. Charalambous ECE Department University of Cyprus, Nicosia, Cyprus.
Channel Capacity.
Speaker: Yu-Jen Lai Cheng-Chih Chao Advisor: Hung-Yu Wei 2009/06/08 1 Dong Nguyen, Tuan Tran, Thinh Nguyen, and Bella Bose, Fellow, IEEE IEEE TRANSACTIONS.
§7-4 Lyapunov Direct Method
Context-based Data Compression
Tim Holliday Peter Glynn Andrea Goldsmith Stanford University
Stability Analysis of Linear Systems
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

The Complex Braid of Communication and Control Massimo Franceschetti

Motivation January 2012 January 2007

Motivation

Abstraction Channel quality Time

Problem formulation Linear dynamical system A composed of unstable modes Slotted time-varying channel evolving at the same time scale of the system Time-varying channel

Problem formulation Objective: identify the trade-off between system’s unstable modes and channel’s rate to guarantee stability:

Information-theoretic approach A rate-based approach, transmit Derive data-rate theorems quantifying how much rate is needed to construct a stabilizing quantizer/controller pair Rate Time

Network-theoretic approach A packet-based approach (a packet models a real number) Determine the critical packet loss probability above which the system cannot be stabilized by any control scheme Time Rate

Tatikonda-Mitter (IEEE-TAC 2002) Information-theoretic approach Time Rate Rate process: known at the transmitter Disturbances and initial state support: bounded Data rate theorem: a.s. stability Generalizes to vector case as:

Nair-Evans (SIAM-JCO 2004) Information-theoretic approach Rate process: known at the transmitter Disturbances and initial state support: unbounded Bounded higher moment (e.g. Gaussian distribution) Data rate theorem: Second moment stability Time Rate Generalizes to vector case as:

Intuition Want to compensate for the expansion of the state during the communication process State variance instability R-bit message At each time step, the uncertainty volume of the state Keep the product less than one for second moment stability

Martins-Dahleh-Elia (IEEE-TAC 2006) Information-theoretic approach Scalar case only Rate Time Rate process: i.i.d process distributed as R Disturbances and initial state support: bounded Causal knowledge channel: coder and decoder have knowledge of Data rate theorem: Second moment stability

Intuition Rate R 1 State variance Rate R 2 Keep the average of the product less than one for second moment stability At each time step, the uncertainty volume of the state

Minero-F-Dey-Nair (IEEE-TAC 2009) Information-theoretic approach Vector case, necessary and sufficient conditions almost tight Rate Time Rate process: i.i.d process distributed as R Disturbances and initial state support: unbounded Bounded higher moment (e.g. Gaussian distribution) Causal knowledge channel: coder and decoder have knowledge of Data rate theorem: Second moment stability

Proofs Necessity : Based on entropy power inequality and maximum entropy theorem Sufficiency: Difficulty is in the unbounded support, uncertainty about the state cannot be confined in any bounded interval, design an adaptive quantizer to avoid saturation, achieve high resolution through successive refinements.

Network-theoretic approach A packet-based approach (a packet models a real number) Time Rate

Critical dropout probability Sinopoli-Schenato-F-Sastry-Poolla-Jordan (IEEE-TAC 2004) Gupta-Murray-Hassibi (System-Control-Letters 2007) Elia (System-Control-Letters 2005) Time Rate Generalizes to vector case as:

Critical dropout probability Can be viewed as a special case of the information-theoretic approach Gaussian disturbance requires unbounded support data rate theorem of Minero, F, Dey, Nair, (2009) to recover the result

Stabilization over channels with memory Gupta-Martins-Baras (IEEE-TAC 2009) Critical “recovery probability” Network theoretic approach Two-state Markov chain

Stabilization over channels with memory You-Xie (IEEE-TAC 2010) For recover the critical probability Data-rate theorem Information-theoretic approach Two-state Markov chain, fixed R or zero rate Disturbances and initial state support: unbounded Let T be the excursion time of state R

Stabilization over channels with memory Minero-Coviello-F (IEEE-TAC to appear) Obtain a general data rate theorem that recovers all previous results using the theory of Jump Linear Systems Information-theoretic approach Disturbances and initial state support: unbounded Time-varying rate Arbitrary positively recurrent time-invariant Markov chain of n states

Markov Jump Linear System Rate r k State variance Define an auxiliary dynamical system (MJLS)

Markov Jump Linear System Let be the spectral radius of H The MJLS is mean square stable iff Relate the stability of MJLS to the stabilizability of our system Let H be the matrix defined by the transition probabilities and the rates

Data rate theorem Stabilization in mean square sense over Markov time-varying channels is possible if and only if the corresponding MJLS is mean square stable, that is:

Previous results as special cases

What next Is this the end of the journey? No! journey is still wide open … introducing noisy channels

Insufficiency of Shannon capacity Example: i.i.d. erasure channel Data rate theorem: Shannon capacity: Sahai-Mitter (IEEE-IT 2006)

Capacity with stronger reliability constraints Shannon capacity soft reliability constraint Zero-error capacity hard reliability constraint Anytime capacity medium reliability constraint

Alternative formulations Undisturbed systems Tatikonda-Mitter (IEEE-AC 2004) Matveev-Savkin (SIAM-JCO 2007) a.s. stability Anytime reliable codes: Shulman (1996), Ostrovsky, Rabani, Schulman (2009), Como, Fagnani, Zampieri (2010), Sukhavasi, Hassibi (2011) a.s. stability Disturbed systems (bounded) Matveev-Savkin (IJC 2007) moment stability Sahai-Mitter (IEEE-IT 2006)

The Bode-Shannon connection Connection with the capacity of channels with feedback Elia (IEEE-TAC 2004) Ardestanizadeh-F (IEEE-TAC 2012) Ardestanizadeh-Minero-F (IEEE-IT 2012)

Control over a Gaussian channel Instability Power constraint Complementary sensitivity function Stationary (colored) Gaussian noise

The largest instability U over all LTI systems that can be stabilized by unit feedback over the stationary Gaussian channel, with power constraint P corresponds to the Shannon capacity C F of the stationary Gaussian channel with feedback [Kim(2010)] with the same power constraint P. Power constraint Feedback capacity Control over a Gaussian channel

Communication using control This duality between control and feedback communication for Gaussian channels can be exploited to design communication schemes using control tools MAC, broadcast channels with feedback Elia (IEEE-TAC 2004) Ardestanizadeh-Minero-F (IEEE-IT 2012)

Conclusion Data-rate theorems for stabilization over time-varying rate channels, after a beautiful journey of about a decade, are by now fairly well understood The journey (quest) for noisy channels is still going on The terrible thing about the quest for truth is that you may find it For papers: