Three-layer scheme dominates previous double-layer schemes Distortion-diversity tradeoff provides useful comparison in different operating regions Layered.

Slides:



Advertisements
Similar presentations
Derives the optimal achievable rate for MISO secondary users under coexistence constraints Proposes practical strategy for cognition and cooperation in.
Advertisements

Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Team Update: Andrea Goldsmith ITMANET PI Meeting Jan 27, 2011.
EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements March 5 lecture moved to March 7, 12-1:15pm, Packard 364 Poster session scheduling.
EE359 – Lecture 16 Outline MIMO Beamforming MIMO Diversity/Multiplexing Tradeoffs MIMO Receiver Design Maximum-Likelihood, Decision Feedback, Sphere Decoder.
1 Wireless Communication Low Complexity Multiuser Detection Rami Abdallah University of Illinois at Urbana Champaign 12/06/2007.
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.
Introduction to Data-driven Animation Jinxiang Chai Computer Science and Engineering Texas A&M University.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Multiple Description Coding and Distributed Source Coding: Unexplored Connections in Information Theory and Coding Theory S. Sandeep Pradhan Department.
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
APPLICATION OF SPACE-TIME CODING TECHNIQUES IN THIRD GENERATION SYSTEMS - A. G. BURR ADAPTIVE SPACE-TIME SIGNAL PROCESSING AND CODING – A. G. BURR.
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.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
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.
Gaussian Interference Channel Capacity to Within One Bit David Tse Wireless Foundations U.C. Berkeley MIT LIDS May 4, 2007 Joint work with Raul Etkin (HP)
EE359 – Lecture 15 Outline Announcements: HW due Friday MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing Tradeoffs.
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
Wireless Communication Elec 534 Set IV October 23, 2007
The Complex Braid of Communication and Control Massimo Franceschetti.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Multiple-access Communication in Networks A Geometric View W. Chen & S. Meyn Dept ECE & CSL University of Illinois.
Super-Orthogonal Space- Time BPSK Trellis Code Design for 4 Transmit Antennas in Fast Fading Channels Asli Birol Yildiz Technical University,Istanbul,Turkey.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
Zukang Shen, Jeffrey Andrews, and Brian Evans
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
May 7, 2014, Florence, Italy Retrospective Interference Alignment for the 3-user MIMO Interference Channel with.
Multiuser Detection (MUD) Combined with array signal processing in current wireless communication environments Wed. 박사 3학기 구 정 회.
MD-based scheme could outperform MR-based scheme while preserving the source- channel interface Rate is not sufficient as source- channel interface, ordering.
Low Complexity User Selection Algorithms for Multiuser MIMO Systems with Block Diagonalization Zukang Shen, Runhua Chen, Jeff Andrews, Robert Heath, and.
Computer Networks Group Universität Paderborn TANDEM project meeting Protocols, oversimplification, and cooperation or: Putting wireless back into WSNs.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.
Outage-Optimal Relaying In the Low SNR Regime Salman Avestimehr and David Tse University of California, Berkeley.
Novel network coding strategy for TDD Use of feedback (ACK) improves delay/energy/ throughput performance, especially for high latency- high errors scenarios.
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.
Wireless Multiple Access Schemes in a Class of Frequency Selective Channels with Uncertain Channel State Information Christopher Steger February 2, 2004.
Interference in MANETs: Friend or Foe? Andrea Goldsmith
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Cross-Layer Approach to Wireless Collisions Dina Katabi.
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.
5: Capacity of Wireless Channels Fundamentals of Wireless Communication, Tse&Viswanath 1 5. Capacity of Wireless Channels.
On the SNR Exponent of Hybrid Digital Analog Space Time Coding Krishna R. Narayanan Texas A&M University Joint work with Prof.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Cooperative Diversity Using Distributed Turbo Codes Bin Zhao and Matthew C. Valenti Lane Dept. of Comp. Sci. & Elect. Eng. West Virginia.
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.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
EE360: Lecture 13 Outline Capacity of Cognitive Radios Announcements Progress reports due Feb. 29 at midnight Overview Achievable rates in Cognitive Radios.
Multiple Antennas.
9: Diversity-Multiplexing Tradeoff Fundamentals of Wireless Communication, Tse&Viswanath MIMO III: Diversity-Multiplexing Tradeoff.
EE359 – Lecture 16 Outline ISI Countermeasures Multicarrier Modulation
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Joint Source, Channel, and Network Coding in MANETs
Layerless Dynamic Networks
Tilted Matching for Feedback Channels
Ivana Marić, Ron Dabora and Andrea Goldsmith
Resource Allocation in Non-fading and Fading Multiple Access Channel
Master Thesis Presentation
Jinhua Jiang, Ivana Marić, Andrea Goldsmith, and Shuguang Cui Summary
Unequal Error Protection: Application and Performance Limits
Compute-and-Forward Can Buy Secrecy Cheap
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
ACHIEVEMENT DESCRIPTION
ACHIEVEMENT DESCRIPTION
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

Three-layer scheme dominates previous double-layer schemes Distortion-diversity tradeoff provides useful comparison in different operating regions Layered Source-Channel Schemes: A Distortion-Diversity Perspective: S. Jing, L. Zheng and M. Medard Diversity can be achieved through source coding techniques, like multiple description codes We characterize source-channel schemes with distortion-diversity tradeoff Distortion-diversity tradeoff better characterizes layered source-channel schemes MAIN ACHIEVEMENT: A three-layer source-channel scheme, which includes previous multi-resolution-based and multi-description-based schemes as special cases HOW IT WORKS: Multi-description source code with a common refinement component Superposition coding with successive interference cancellation Joint source-channel decoding exploits source code correlation ASSUMPTIONS AND LIMITATIONS: Quasi-static block-fading channel Receivers have perfect channel state information, but the transmitter only has statistical knowledge of the channel Conventional source-channel scheme achieves a single level of reconstruction Diversity is usually achieved in the channel coding component Extend multi-description-based source-channel scheme while preserving the interface between source and channel coding More general channel model IMPACT NEXT-PHASE GOALS ACHIEVEMENT DESCRIPTION STATUS QUO NEW INSIGHTS

Sheng Jing, Lizhong Zheng, Muriel Médard ITMANET Mar 2009

Motivation Multiple user groups (eg. PDAs vs. Laptops) Accuracy: image resolution Reliability: successful image loading probability Different preferences of accuracy vs. reliability How well can we serve multiple user groups simultaneously?

Background [Diggavi et al ’03] Layered channel codes (“diversity-embedded codes”) [Diggavi et al ’05] Tradeoff between diversity orders of 2-layer channel code [Effros et al ’04] [Laneman et al’05] Source coding techniques can also improve diversity for certain reconstructions We previously looked at the tradeoff between distortion and diversity for SR and MD schemes [Jing et al ’08] In this talk, we present a unifying scheme that matches the distortion and diversity (D-D) tradeoff of SR and MD schemes

Outline Problem formulation Review of two schemes –SR with superposition coding –MD with joint decoding Unifying scheme: MD with common refinement Performance comparison Concluding remarks

Problem Formulation Source: i.i.d. unit-variance complex Gaussian Quadratic distortion measure Quasi-static parallel fading channel where and Power constraint: SNR per subchannel No channel state information at transmitter Perfect channel state information at receiver

Problem Formulation (cont.) At high SNR, for each source reconstruction –Distortion exponent: –Diversity order:

Problem Formulation (cont.) Distortion-Diversity (D-D) tradeoff: achievable distortion exponent & diversity order tuples –Example: three reconstructions (partial, full, and refine), D-D tradeoff includes all achievable –Alternative performance metric: average distortion

Two schemes SR with superposition coding : two-layer successive refinement source code matched to the distortion levels : superposition channel code, with power and : successive interference cancelation channel decoder

Two schemes (cont.) MD with joint decoding [Laneman et al ’05] : symmetric El-Gamal-Cover (EGC) code [El Gamal et al ’82] matched to distortions : joint source-channel decoder –Use correlation between source codewords to identify unlikely pairs of channel codewords

Performance Comparison SR scheme: D-D tradeoff along the direction of MD scheme: D-D tradeoff along the direction of

Performance Comparison (cont.) Compare the D-D regions at

Common Refinement Scheme : symmetric EGC code with common refinement matched to

Common Refinement Scheme (cont.) Treating refinement layer as noise, form candidate lists of, resp. Search for a jointly typical candidate pair –If find only one pair, subtract the corresponding channel codewords and decode for –Otherwise, search each candidate list for

Connection with SR and MD Common refinement scheme includes the MD scheme as a special case (set ) Common refinement also includes SR scheme? –Simple approach requires huge codebook –We show, makes the common refinement scheme as good as SR in D-D tradeoff, and avoids exploding

Performance Comparison D-D tradeoff:, Extreme case 1:

Performance Comparison (cont.) D-D tradeoff:, Extreme case 2:

Concluding Remarks 3-level unifying scheme –Dominates both SR and MD schemes –Smooth transition between SR and MD schemes –No strictly superior performance On-going work –Parallel channel MIMO channel –Unifying source-channel scheme that also preserves the digital source-channel interface