A Continuity Theory of Source Coding over Networks WeiHsin Gu, Michelle Effros, Mayank Bakshi, and Tracey Ho FLoWS PI Meeting, Washington DC, September.

Slides:



Advertisements
Similar presentations
Sequences and Mathematical Induction
Advertisements

Review of Probability.
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
Bounds on Code Length Theorem: Let l ∗ 1, l ∗ 2,..., l ∗ m be optimal codeword lengths for a source distribution p and a D-ary alphabet, and let L ∗ be.
Supremum and Infimum Mika Seppälä.
Solving Equations with the Variable on Both Sides Objectives: to solve equations with the variable on both sides.
Chapter 4: Network Layer
Optimal Partitions of Strings: A new class of Burrows-Wheeler Compression Algorithms Raffaele Giancarlo Marinella Sciortino
Lossy Source Coding under a Maximum Distortion Constraint with Decoder Side- Information Jayanth Nayak 1, Ertem Tuncel 2, and Kenneth Rose 1 1 University.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Network Coding Project presentation Communication Theory 16:332:545 Amith Vikram Atin Kumar Jasvinder Singh Vinoo Ganesan.
1 Network Source Coding Lee Center Workshop 2006 Wei-Hsin Gu (EE, with Prof. Effros)
Visual Recognition Tutorial
Visual Recognition Tutorial
Division of Engineering and Applied Sciences DIMACS-04 Iterative Timing Recovery Aleksandar Kavčić Division of Engineering and Applied Sciences Harvard.
Geometric characterization of nodal domains Y. Elon, C. Joas, S. Gnutzman and U. Smilansky Non-regular surfaces and random wave ensembles General scope.
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
Linear Equations with Different Kinds of Solutions
Random Variables and Probability Distributions
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
Solving Equations with Variables on Both Sides
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
Georg Friedrich Bernhard Riemann
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
1. solve equations with variables on both sides. 2. solve equations containing grouping symbols. 3.5 Objectives The student will be able to:
INTEGRALS Areas and Distances INTEGRALS In this section, we will learn that: We get the same special type of limit in trying to find the area under.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes Kenji Yasunaga * Toru Fujiwara + * Kwansei Gakuin University, Japan +
Integrals  In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.  In much the.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Sample Variability Consider the small population of integers {0, 2, 4, 6, 8} It is clear that the mean, μ = 4. Suppose we did not know the population mean.
Erasure Coding for Real-Time Streaming Derek Leong and Tracey Ho California Institute of Technology Pasadena, California, USA ISIT
Goal: Solve linear equations.. Definitions: Equation: statement in which two expressions are equal. Linear Equation (in one variable): equation that.
Lesson 3-4 Solving Multi-Step Inequalities August 20, 2014.
Optimal Bayes Classification
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Overview: Layerless Dynamic Networks Lizhong Zheng.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Transmission over composite channels with combined source-channel outage: Reza Mirghaderi and Andrea Goldsmith Work Summary STATUS QUO A subset Vo (with.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
1.7 Linear Inequalities.  With an inequality, you are finding all values of x for which the inequality is true.  Such values are solutions and are said.
We aim to exploit cognition to maximize network performance What is the side information at a cognitive node? What is the best encoding scheme given this.
Lesson 1-8 Solving Addition and Subtraction Equations.
Area of a Plane Region We know how to find the area inside many geometric shapes, like rectangles and triangles. We will now consider finding the area.
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Reliable Deniable Communication: Hiding Messages in Noise The Chinese University of Hong Kong The Institute of Network Coding Pak Hou Che Mayank Bakshi.
Inequalities for Stochastic Linear Programming Problems By Albert Madansky Presented by Kevin Byrnes.
Rate Distortion Theory. Introduction The description of an arbitrary real number requires an infinite number of bits, so a finite representation of a.
 A.4f Apply these skills to solve practical problems.  A.4b Justify steps used in solving equations.  Use a graphing calculator to check your solutions.
4.2 Area Definition of Sigma Notation = 14.
Asymptotic Analysis for Large Scale Dynamic Stochastic Games Sachin Adlakha, Ramesh Johari, Gabriel Weintraub and Andrea Goldsmith DARPA ITMANET Meeting.
2.4 Equations with Variables on Both Sides To solve an equation with variables on both sides, you must use the Addition or Subtraction Properties of Equality.
Notes 3.4 – SOLVING MULTI-STEP INEQUALITIES
Solving Equations with Variable on Both Sides Objective: Students will solve equations with variables on both sides. Section 3.4.
Solving equations with variable on both sides Part 1.
Equations with Variables on Both Sides Chapter 3 Section 3.
INTEGRALS 5. INTEGRALS In Chapter 3, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.
Primbs, MS&E345 1 Measure Theory in a Lecture. Primbs, MS&E345 2 Perspective  -Algebras Measurable Functions Measure and Integration Radon-Nikodym Theorem.
The Concavity of the Auxiliary Function for Classical-Quantum Channels Speaker: Hao-Chung Cheng Co-work: Min-Hsiu Hsieh Date: 01/09/
Visual Recognition Tutorial
Random Testing: Theoretical Results and Practical Implications IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2012 Andrea Arcuri, Member, IEEE, Muhammad.
Solving Multistep Equations
Solving Systems Using Substitution
Tilted Matching for Feedback Channels
Solving Equations with variables on each side
Equations with Variables on Both Sides Day 2
Chapter 5. The Duality Theorem
Random Variables and Probability Distributions
2-3 Equations With Variables on Both Sides
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

A Continuity Theory of Source Coding over Networks WeiHsin Gu, Michelle Effros, Mayank Bakshi, and Tracey Ho FLoWS PI Meeting, Washington DC, September 2008

Status Quo Achievable rate regions are hard to characterize. Only solved for some small networks and multicast networks Inner (achievable) and upper (converse) bounds are derived for some example networks Open questions: Are those earlier derived bounds tight? Does single-letter characterization always exist?

New Insights Develop and investigate some abstract properties of the achievable rate regions As functions of probability distribution and distortion vector, are the achievable rate regions continuous? Motivations Understand the existence of 1-letter characterizations Applications: estimation of achievable rate regions Why is it hard? Block length is unbounded in the definition of the achievable rate regions Don’t know much about the achievable rate regions

Formulation and Notation Define a family of network source coding problems which contains the prior example networks as special cases. The family contains four subfamilies –Lossless non-functional –Lossy non-functional –Lossless functional –Lossy functional : Source : Side information : Probability distribution : Distortion vector : Lossy rate region : Lossless rate region

Main Results is concave in – is continuous in when –For any non-functional source coding problem, is continuous in for all For super-source networks, both and are continuous in for all

is continuous in if and only if – is upper semi-continuous in – is lower semi-continuous in We show that the achievable rate regions are inner semi-continuous in for –Lossless non-functional –Lossy non-functional –Lossy functional Continuity w.r.t.

A Possible Solution We conjecture that outer semi-continuity w.r.t. is true when random variables have finite alphabets A possible approach: for any network, consider the super-source network If the above equality is true, then is upper semi- continuous in

Next-Phase Goals Prove or disprove upper semi-continuity w.r.t. for general networks. Characterize a larger family of networks where upper semi-continuity holds Investigate some other useful abstract properties Understand the existence of achievable rate regions