1 Shannon-Kotel’nikov Mappings for Joint Source- Channel Coding Thesis Defence Lecture Fredrik Hekland 1. June 2007.

Slides:



Advertisements
Similar presentations
Bandwidth-Efficient, Energy-Constrained Short Range Wireless Communications.
Advertisements

9.1 Chapter 9 Using Telephone and Cable Networks for Data Transmission Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
1 A Brief Review of Joint Source-Channel Coding CUBAN/BEATS Meeting 29th April, 2004 Fredrik Hekland Department of Electronics and Telecommunication NTNU.
Hybrid Codes and the Point-to-Point Channel Paul Cuff Curt Schieler.
Capacity of Wireless Channels
Communications Systems ASU Course EEE455/591 Instructor: Joseph Hui Monarch Institute of Engineering.
1 Distributed Source Coding Trial Lecture Fredrik Hekland 1. June 2007.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Chapter 6 Information Theory
June 4, 2015 On the Capacity of a Class of Cognitive Radios Sriram Sridharan in collaboration with Dr. Sriram Vishwanath Wireless Networking and Communications.
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Digital Data Transmission ECE 457 Spring Information Representation Communication systems convert information into a form suitable for transmission.
Sep 06, 2005CS477: Analog and Digital Communications1 Introduction Analog and Digital Communications Autumn
Chapter 10: Transmission Efficiency Business Data Communications, 4e.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
1 Today, we are going to talk about: Shannon limit Comparison of different modulation schemes Trade-off between modulation and coding.
4/24/2002SCL UCSB1 Optimal End-to-end Distortion Estimation for Drift Management in Scalable Video Coding H. Yang, R. Zhang and K. Rose Signal Compression.
Sep 08, 2005CS477: Analog and Digital Communications1 Example Systems, Signals Analog and Digital Communications Autumn
Distributed Video Coding Bernd Girod, Anne Margot Aaron, Shantanu Rane, and David Rebollo-Monedero IEEE Proceedings 2005.
09/24/02ICIP20021 Drift Management and Adaptive Bit Rate Allocation in Scalable Video Coding H. Yang, R. Zhang and K. Rose Signal Compression Lab ECE Department.
Design of Expanded Constellations for PAPR Reduction in OFDM Systems Speaker: Dr. Ali Al-Shaikhi Assistant Professor, EE department.
Noise, Information Theory, and Entropy
Spatial Diversity and Multiuser Diversity in Wireless Communications Bengt Holter Dept. of Electronics and Telecommunications NTNU IKT-2010 seminar, Lillestrøm,
Lecture 3 Outline Announcements: No class Wednesday Friday lecture (1/17) start at 12:50pm Review of Last Lecture Communication System Block Diagram Performance.
Noise, Information Theory, and Entropy
Fundamentals of Digital Communication
1 Topic 4: Physical Layer - Chapter 10: Transmission Efficiency Business Data Communications, 4e.
Communication Theory as Applied to Wireless Sensor Networks muse.
Lecture 3-1: Coding and Error Control
1 Communication System 1 September 2007 Prepared and Lectured by Assoc Prof. Thuong Le-Tien Slides with references from HUT Finland, La Hore uni., Mc.
Optimization of adaptive coded modulation schemes for maximum average spectral efficiency H. Holm, G. E. Øien, M.-S. Alouini, D. Gesbert, and K. J. Hole.
Chapter 10: Transmission Efficiency Business Data Communications, 4e.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
Channel Capacity
17.0 Distributed Speech Recognition and Wireless Environment References: 1. “Quantization of Cepstral Parameters for Speech Recognition over the World.
1 Security and Robustness Enhancement for Image Data Hiding Authors: Ning Liu, Palak Amin, and K. P. Subbalakshmi, Senior Member, IEEE IEEE TRANSACTIONS.
Huirong Fu and Edward W. Knightly Rice Networks Group Aggregation and Scalable QoS: A Performance Study.
8. 1 MPEG MPEG is Moving Picture Experts Group On 1992 MPEG-1 was the standard, but was replaced only a year after by MPEG-2. Nowadays, MPEG-2 is gradually.
EE359 – Lecture 15 Outline Introduction to MIMO Communications MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Outline Kinds of Coding Need for Compression Basic Types Taxonomy Performance Metrics.
Multicast and Unicast Real-Time Video Streaming Over Wireless LANS April. 27 th, 2005 Presented by, Kang Eui Lee.
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Lecture 2 Outline Announcements: No class next Wednesday MF lectures (1/13,1/17) start at 12:50pm Review of Last Lecture Analog and Digital Signals Information.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Overview: Layerless Dynamic Networks Lizhong Zheng.
TI Cellular Mobile Communication Systems Lecture 4 Engr. Shahryar Saleem Assistant Professor Department of Telecom Engineering University of Engineering.
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.
Scalable Video Coding and Transport Over Broad-band wireless networks Authors: D. Wu, Y. Hou, and Y.-Q. Zhang Source: Proceedings of the IEEE, Volume:
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
Overview of Digital Video Compression Multimedia Systems and Standards S2 IF Telkom University.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
CS294-9 :: Fall 2003 Joint Source/Channel Coding Ketan Mayer-Patel.
A Low-Complexity Universal Architecture for Distributed Rate-Constrained Nonparametric Statistical Learning in Sensor Networks Avon Loy Fernandes, Maxim.
1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other...
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
UNIT I. Entropy and Uncertainty Entropy is the irreducible complexity below which a signal cannot be compressed. Entropy is the irreducible complexity.
1 CSCD 433 Network Programming Fall 2016 Lecture 4 Digital Line Coding and other...
The Johns Hopkins University
Joint Source, Channel, and Network Coding in MANETs
Digital Communications
2018/9/16 Distributed Source Coding Using Syndromes (DISCUS): Design and Construction S.Sandeep Pradhan, Kannan Ramchandran IEEE Transactions on Information.
Scalar Quantization – Mathematical Model
COT 5611 Operating Systems Design Principles Spring 2014
Digital Communication Chapter 1: Introduction
Information Theoretical Analysis of Digital Watermarking
INTRODUCTION TO DIGITAL COMMUNICATION
Communication Theory as Applied to Wireless Sensor Networks
Presentation transcript:

1 Shannon-Kotel’nikov Mappings for Joint Source- Channel Coding Thesis Defence Lecture Fredrik Hekland 1. June 2007

2 Outline ●Some fundamentals on communications ●Shannon-Kotel’nikov mappings ●Key results

3 Source Coding ●Analog sources  Infinite information ●To meet a rate constraint SC can  Remove redundancy  Remove irrelevancy  Reduce perceptual quality 64kbit/s RAW: 8MB JPEG: 1MB 87 photos 700 photos OBJECTIVES Minimize rate given a distortion constraint Minimize distortion given a rate constraint OBJECTIVES Minimize rate given a distortion constraint Minimize distortion given a rate constraint 13kbit/s Processing power

4 Channel Coding Information Channel Minimize impact of channel noise, while still trying to maximize channel utilization Minimize impact of channel noise, while still trying to maximize channel utilization No channel coding/ error protection: Channel space Code word Noise

5 Joint or Separate Coding JOINT SOURCE-CHANNEL CODING - Same performance as separated system, while requiring lower delay/complexity. - Good performance for a larger range of source- channel pairs. JOINT SOURCE-CHANNEL CODING - Same performance as separated system, while requiring lower delay/complexity. - Good performance for a larger range of source- channel pairs.

6 Heterogeneous Networks ●Incompatible communication systems demand transcoding where they interface Mobile phone Base station ADSL & WLAN Telephone central Old school telephone PDA with Skype

7 Shannon-Kotel’nikov Mappings ●Non-linear mappings  Discrete time, continuous amplitude  Robust  Low delay ●Bandwidth expansion  Noise reduction ●Bandwidth reduction  Compression S1S1 S2S2   ● Uncertainty due to noise Y1Y1 Y2Y2

8 The Guys Claude E. ShannonVladimir A. Kotel'nikov

9 Research Objectives ●Bandwidth-efficient and robust (lossy) source-channel coding systems ●Transcoding schemes for Shannon-Kotel’nikov mappings  How to interface with digital transport networks  Determine whether or not joint optimization of transcoding/mapping is necessary  Propose simple and effective schemes

10 Assumptions ●Point-to-point channels ●Source, S, is independent and identically distributed ●Channel noise, Z, is Additive White Gaussian Noise (AWGN)

11 Key Results ●Description of performance losses in source- channel coding ●Bandwidth reducing mappings ●Transcoding of mappings for heterogeneous networks ●Mappings in multi-hop scenarios

12 Quantifying Performance Losses in Source-Channel Coding ●Mismatched channel symbol distribution ●Mismatched error-sequence distribution ●Incorrect assumption of source distributions ●Rate lower than channel capacity ●Correlation ●Receiver structures ●Decoding errors

13 Bandwidth-Reducing Mappings ●2:1 - Gaussian source and AWGN channel ●2:1 - Laplacian source and AWGN channel  Warping L  G is a viable alternative. ●4:1 through cascading two 2:1 mappings.

14 Bandwidth-Reducing Mappings

15 Transcoding for Heterogeneous Networks ●Simple scalar quantizer performs well ●Joint optimization of mapping and quantizer ●Quantize either at transmitter or receiver side

16 Transcoding for Heterogeneous Networks

17 Multi-hop Communication ●Pre-quantized mapping necessary ●Worst link determines performance

18 Errata ●P.112, last bullet belongs to Section 5.2.

19 Now, unleash the opponents...

20 Publication List [1] – Hekland, Øien, Ramstad. ”Using 2:1 Shannon mapping for joint source-channel coding”, DCC’05, Utah, USA. [2] – Hekland, Ramstad. ”Digitising Shannon mappings for heterogeneous networks and storage”, NORSIG’05, Stavanger, Norway. [3] – Hekland, Ramstad. ”Digitising Shannon mappings for heterogeneous networks”, DCC’06, Utah, USA. [4] – Hekland, Ramstad. ”Optimal rate-constrained transcoding for a 2:1 bandwidth reducing Shannon Mapping”, SPAWC’06, Cannes, France. [5] – Hekland, Øien, Ramstad. ”Quantifying performance losses in source-channel coding”, EW’07, Paris, France. [6] – Hekland, Floor, Ramstad. ”Shannon-Kotel’nikov mappings in joint source-channel coding”, accepted for publication in IEEE Trans. Commun.