SoftCast+ Scalable Robust Mobile Video

Slides:



Advertisements
Similar presentations
Jung-Hwan Low Redundancy Layered Multiple Description Scalable Coding Using The Subband Extension Of H.264/AVC Department of Electrical.
Advertisements

EE578 Assignment #3 Abdul-Aziz.M Al-Yami October 25 th 2010.
Wireless Networks Should Spread Spectrum On Demand Ramki Gummadi (MIT) Joint work with Hari Balakrishnan.
1 Retransmission Repeat: Simple Retransmission Permutation Can Resolve Overlapping Channel Collisions Li (Erran) Li Bell Labs, Alcatel-Lucent Joint work.
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates Cheng-Hsin Hsu Joint work with Mohamed Hefeeda April 23, 2009 Simon Fraser.
One-Size-Fits-All Wireless Video Szymon Jakubczak with Hariharan Rahul and Dina Katabi.
2005/01/191/14 Overview of Fine Granularity Scalability in MPEG-4 Video Standard Weiping Li Fellow, IEEE IEEE Transactions on Circuits and Systems for.
1 Understanding and Mitigating the Impact of RF Interference on Networks Ramki Gummadi (MIT), David Wetherall (UW) Ben Greenstein (IRS), Srinivasan.
Dirty RF Impact on Interference Alignment
Spread Spectrum Chapter 7. Spread Spectrum Input is fed into a channel encoder Produces analog signal with narrow bandwidth Signal is further modulated.
Symbol Level Network Coding By Sachin Katti, Dina Katabi, Hari Balakrishnan, Muriel Medard Sigcomm 2008.
Analog Network Coding Sachin Katti Shyamnath Gollakota and Dina Katabi.
a By Yasir Ateeq. Table of Contents INTRODUCTION TASKS OF TRANSMITTER PACKET FORMAT PREAMBLE SCRAMBLER CONVOLUTIONAL ENCODER PUNCTURER INTERLEAVER.
Physical Layer Security Made Fast and Channel-Independent Shyamnath Gollakota Dina Katabi.
MIMO As a First-Class Citizen in Kate C.-J. Lin Academia Sinica Shyamnath Gollakota and Dina Katabi MIT.
Strider : Automatic Rate Adaptation & Collision Handling Aditya Gudipati & Sachin Katti Stanford University 1.
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates Cheng-Hsin Hsu Joint work with Dr. Mohamed Hefeeda April 23, 2009 Simon Fraser.
Optimal Scalable Video Multiplexing in Mobile Broadcast Networks
Cellular Communications
Mohamed Hefeeda Multiplexing of Variable Bitrate Scalable Video for Mobile Broadcast Networks Project Presentation Farid Molazem Cmpt 820 Fall 2010 School.
A Layered Hybrid ARQ Scheme for Scalable Video Multicast over Wireless Networks Zhengye Liu, Joint work with Zhenyu Wu.
Spatial and Temporal Data Mining
William Stallings Data and Computer Communications 7th Edition
A Software Defined Radio Implementation for Voice Transmission over Wireless Ad-hoc Networks Jason Tran SURF-IT 2009 Fellow Mentors: Dr. Homayoun Yousefi’zadeh.
1 CMPT 371 Data Communications and Networking Spread Spectrum.
Noise, Information Theory, and Entropy
SourceSync: A Distributed Architecture for Sender Diversity Hariharan Rahul Haitham Hassanieh Dina Katabi.
Combating Cross-Technology Interference Shyamnath Gollakota Fadel Adib Dina Katabi Srinivasan Seshan.
Overcoming the Antennas-Per-AP Throughput Limit in MIMO Shyamnath Gollakota Samuel David Perli and Dina Katabi.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
Audio Compression Usha Sree CMSC 691M 10/12/04. Motivation Efficient Storage Streaming Interactive Multimedia Applications.
CELLULAR COMMUNICATIONS 4. Modulation. Modulation  Radio signals can be used to carry information  Audio, data, video  Information is used to modify.
Wireless Communications
Automatic Rate Adaptation Aditya Gudipati & Sachin Katti Stanford University 1.
Signal Encoding Techniques. Lecture Learning Outcomes Be able to understand, appreciate and differentiate the different signal encoding criteria available.
CIS679: Multimedia Basics r Multimedia data type r Basic compression techniques.
Decoding Collisions Shyamnath Gollakota Dina Katabi.
3-2008UP-Copyrights reserved1 ITGD4103 Data Communications and Networks Lecture-11:Data encoding techniques week 12- q-2/ 2008 Dr. Anwar Mousa University.
Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
IMA Summer Program on Wireless Communications Quick Fundamentals of Wireless Networks Phil Fleming Network Advanced Technology Group Network Business Motorola,
Modulation - QPSK l Quadrature Phase Shift Keying is effectively two independent BPSK systems (I and Q), and therefore exhibits the same performance but.
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:
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
Cross-Layer Approach to Wireless Collisions Dina Katabi.
CS434/534: Mobile Computing and Wireless Networks Y. Richard Yang 08/30/2012.
Why PHY Really Matters Hari Balakrishnan MIT CSAIL August 2007 Joint work with Kyle Jamieson and Ramki Gummadi.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Fundamentals of Multimedia Chapter 17 Wireless Networks 건국대학교 인터넷미디어공학부 임 창 훈.
Stallings, Wireless Communications & Networks, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Spread Spectrum Chapter.
Networks and Mobile Systems Research Group MIT Laboratory for Computer Science nms.lcs.mit.edu RadioActive Networks: Robust Wireless Communications John.
Bringing Life to Dead Spots Grace Woo Pouya Kheradpour, Dawei Shen, and Dina Katabi.
Data and Computer Communications Tenth Edition by William Stallings Data and Computer Communications, Tenth Edition by William Stallings, (c) Pearson Education.
William Stallings Data and Computer Communications 7th Edition
Wireless Communication
WiMAX 1EEE Protocol Stack
Principios de Comunicaciones EL4005
MDC METHOD FOR HDTV TRANSMISSION OVER EXISTING IP NETWORK
Digital Communications
Data Compression.
Orthogonal Frequency Division Multiplexing
Introduction King Saud University
Modulation and OFDM.
Spread Spectrum A signal that occupies a bandwidth of B, is spread out to occupy a bandwidth of Bss All signals are spread to occupy the same bandwidth.
Digital Communication Chapter 1: Introduction
William Stallings Data and Computer Communications 7th Edition
Decoding Collisions Shyamnath Gollakota Dina Katabi.
William Stallings Data and Computer Communications 7th Edition
Introduction 1st semester King Saud University
Presentation transcript:

SoftCast+ Scalable Robust Mobile Video Szymon Jakubczak and Dina Katabi

Demos Compare our SoftCast and MPEG4/H.264 Mobility demo: receiver moves away from source http://people.csail.mit.edu/szym/softcast/single.swf?config=data/football/b130_h.xml Same mobility demo but with 10x more compression http://people.csail.mit.edu/szym/softcast/single.swf?config=data/football/b016_h.xml Packet loss demo http://people.csail.mit.edu/szym/softcast/multi.swf?config=data/msr/er.xml&zoom=1.0

Mobile video is the future … All TV programs to your handheld device Live broadcast of sports and concerts Mobile video calls

Can WiFi, WiMax, or LTE deal with such growth? Cisco Visual Networking Index predicts the incoming 5 years will show 66x increase in mobile traffic mainly mobile video Can WiFi, WiMax, or LTE deal with such growth? Can existing technology support

Today’s Wireless Video Is Unscalable

Today’s Wireless Video Is Unscalable Different receivers have different channel qualities 1 Mb/s 6 Mb/s In current wireless, sender has to pick one bitrate Today, sender transmits one video per receiver  Unscalable Broadcast one stream to all receiver  Reduce all to the performance of worst receiver

Mobility Makes Things Worse Causes fast unpredictable variations in channel quality 200ms Time [ms] Received Signal Level [dBm] Current wireless can’t transmit one video that works at all channel qualities Mobile video experiences glitches and stalls

Problem Today’s WiMax, WiFi, … Cannot transmit one video stream that satisfies all channel qualities

Performance Cliff

Performance Cliff Critical quality Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Performance Cliff Critical quality Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Performance Cliff H.264; BPSK ½ rate Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Performance Cliff H.264; BPSK ¾ rate Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Performance Cliff H.264; QPSK ½ rate Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Performance Cliff H.264; 16QAM ½ rate Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Performance Cliff H.264; 16QAM ¾ rate Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Performance Cliff H.264; 16QAM ¾ rate H.264; 16QAM ½ rate H.264; QPSK ¾ rate H.264; QPSK ½ rate H.264; BPSK ¾ rate H.264; BPSK ½ rate Channel is better than critical point  Video doesn’t improve Channel is worse than critical point  Video is unwatchable

Ideally: One-Video for All Channel Qualities H.264; 16QAM ½ rate Ideal H.264; QPSK ¾ rate H.264; QPSK ½ rate H.264; BPSK ¾ rate H.264; BPSK ½ rate How can we obtian this ideal? To undertand this we first need to understand why existing video suffers form cliff effect Large Bandwidth Saving No glitches or stalls with mobility Transmitter broadcasts one video Each receiver decodes a video quality commensurate with its channel quality

Why Does Today’s Video Suffer a Cliff? Pixels Video Codec (Compression) Bits PHY Code (Error Protection) Compression and error protection convert real-valued pixels to bits Bits destroy the numerical properties of original pixels 11110 and 11111 could refer to pixels as different as 5 and 149 If all bit errors can be corrected all pixels are correct Even one residual bit error arbitrary errors in pixels so *why* cannot the current design *provide* smooth video degradation? The reason is that it has completely sacrificed smooth degradation for efficiency, that is, it tries very hard to compress and error-protect the stream but in the process gives up on smooth degradation. Current compression and error protection convert real-valued pixels to sequences of bits. These bits, have _no numerical relation, _whatsoever_, to the original pixel values. For example, two sequences that differ in only one bit, like 11110 and 111111, could refer to pixel values as different as 5 and 149. You end up with a system where - if you can correct *all* bit errors, then all the pixels are *correct*… however, even *one* residual bit error leads to _arbitrary_ errors in pixel values -- and *sharp* degradation in video quality.

Analog TV Did not Suffer a Cliff It did not convert pixels to bits Real-Valued Pixels 2, 153, … α Transmitted Values 2α, 153α, … Transmitted values are linearly related to pixels Small perturbation in pixel values Small perturbation on channel But we_had_ a system that provided smooth video degradation: analog TV (pause) Analog TV, did *not* convert pixels to *bits*. Instead, it simply transmitted a scaled version of the *pixels*. It was LINEAR. -- so naturally, when the channel perturbed the transmitted signal, it caused a _proportional_ perturbation in the pixel values, and hence *smooth* degradation. But the *problem* with analog TV is that it is not *efficient*, because it has no compression nor error protection coding. But Analog TV was not efficient: No compression No error protection

SoftCast + SoftCast combines the best of both worlds Is as efficient as digital video Has no cliff effect, like analog video

SoftCast +

SoftCast + Joint code to compress and protect from error Pixels Joint code to compress and protect from error Video Codec (Compression) Bits PHY Code (Error Protection) Signal samples Linear Small perturbation in pixel values Small perturbation on channel No Cliff Effect Need to compress and protect from errors, while staying linear!

Existing compression is not linear Challenge 1

Compress by dropping 3D frequencies Solution 1 Black Regions are Zeros 3D DCT First, how does SoftCast compress? -> In an image, pixels change *gradually*, which means the *frequency* of change is small; so if we *change* image representation to the _frequency_ domain, we find that most of the *high* frequencies are _zero_. SoftCast compression *exploits* this fact, and has the following *two* steps: -> first, it converts each frame to the frequency domain using DCT (DCT is a *well known* transform, if you haven’t *heard* of it before, just *think* of it as the Fourier transform) ->So here’s a frame. SoftCast computes DCT on all pixels in the frame. By applying DCT on the frame as a whole, we get a representation that looks -> like this. ( ) The level of gray in *this* image corresponds to the magnitude of each frequency. So all of the values in the black areas are zeros. We don’t need to transmit the zeros, we just need to tell the decoder where they are, because it can just insert the zeros back. So now in the second step, -> SoftCast ignores all the zero frequencies, and transmits only the non-zero frequencies. ( ) -> Since a *large* fraction of the frequencies is zeros…, by discarding them, we can achieve high *compression* rate, without losing *information*. Pixel values change slowly in space and time In the frequency domain, most temporal and spatial frequencies are zeros SoftCast+ transforms to freq. domain using 3D-DCT

Compress by dropping 3D frequencies Solution 1 Black Regions are Zeros 3D DCT Compression: Send only non-zero frequencies More aggressive compression: Send only frequencies above a threshold value

Compress by dropping 3D frequencies Solution 1 Black Regions are Zeros 3D DCT 3D DCT compresses within and across frames Compression: Send only non-zero frequencies More aggressive compression: Send only frequencies above a threshold value DCT is a linear operator  Linear Compression

Existing error protection codes operate on bits not reals Challenge 2 Now that we have _compressed_ the video, how do we *protect it* from *channel* noise? Conventional error protection codes are designed to operate on *bit sequences*, so they are not *suitable* for SoftCast. -> In order to provide error protection to _real_ values, SoftCast uses *magnitude scaling*.

Protect transmitted values using magnitude-scaling Solution 2 Protect transmitted values using magnitude-scaling 24.9 25.1 ±0.1 25 After Rx Scale down Before Tx Scale up Channel Noise ±0.1 /10 x10 2.49 2.51 ±0.01 2.5 Let’s see how this works using an example. -> Suppose we want to transmit a codeword that has a value of 2.5. -> Say, we scale the codeword up 10x before transmission, -> in this case, we’re going to transmit 25. -> the channel adds noise to the transmitted value, for example suppose the noise is +- 0.1 -> the receiver then receives a value between 24.9 and 25.1 -> when the receiver scales this value back down, the error is reduced to just 0.01 => Thus, scaling the codeword *up*, scales the effective noise on the channel _down_ by the same factor. (emo) Ok! Let’s just scale *everything* *all the way up*!! Compressed value Transmitted Received Decoded Scaling the transmitted values up, scales down the error by the same factor

How much to scale up? Magnitude Scaling is Linear Scaled-up values are larger  take more power to transmit But hardware has limited power Formulate it as an optimization that finds the scaling factors that minimize received video errors Idea: Scale DCT frequencies based on their information content, i.e., their variance Theorem Let λi be the variance of a set of frequencies i The linear encoder that minimizes video errors scales the values xi in the set i as follows: yi = gi xi where gi ~ λi-1/4 Magnitude Scaling is Linear  Linear Error Protection

How Does the PHY Transmit? Recall: Channel transmits pairs of real values (I and Q) Traditional PHY maps bits to reals (I,Q) using modulation QAM modulation I Q …0011001 SoftCast PHY sends the real-valued codewords as I and Q y[1] y[3]y[1] I Q So now, how do we _transmit_ these compressed and error-protected *codewords*? At a high level, recall that the wireless channel transmits *pairs of real values*, that are referred to as the I and Q samples. The current PHY has to map the *bits* to these real-valued I and Q. The process that performs this mapping is called Quadrature Amplitude Modulation or QAM In contrast, SoftCast’s codewords are *already* real-valued. Thus the job of the PHY is much simpler: -> it can directly transmit pairs of SoftCast codewords as the I and Q samples For example, if the incoming codewords are y1, y2, y3, and so on, then we can take the first pair y1 and y2 and transmit them as the first pair of I/Q samples, then take the next pair y3,y4 and transmit them as the next pair of I/Q, and so on. As you can see, by maintaining the real-valued representation, => SoftCast achieves its goal of ensuring that the transmitted signal is linearly related to the pixels. …y[5]y[4]y[3]y[2]y[1] …y[5]y[4]y[3] …y[5] y[2] y[4]y[2] SoftCast+ achieves its goal of ensuring that the transmitted signal is linearly related to the pixels

Performance Let’s see how SoftCast performs.

Implementation USRP2 Hardware GNURadio software Carrier Freq: 2.4 GHz OFDM-Based Physical Layer

Testbed In each run, we pick a transmitter at random and let the other nodes be receivers

Compared Schemes SoftCast + H.264/MPEG4 over 802.11-like OFDM physical layer Layered video (i.e., SCV) over Hierarchical Modulation

Video Quality as Function of Channel Quality

Video Quality as Function of Channel Quality H.264; BPSK ½ rate

Video Quality as Function of Channel Quality H.264; BPSK ¾ rate

Video Quality as Function of Channel Quality H.264; QPSK ½ rate

Video Quality as Function of Channel Quality H.264; 16QAM ¾ rate H.264; 16QAM ½ rate H.264; QPSK ¾ rate H.264; QPSK ½ rate H.264; BPSK ¾ rate H.264; BPSK ½ rate Current approach cannot deliver a single video that works well for all channel qualities

Video Quality as Function of Channel Quality H.264; BPSK ½ rate H.264; BPSK ¾ rate H.264; QPSK ½ rate H.264; 16QAM ½ rate H.264; 16QAM ¾ rate H.264; QPSK ¾ rate SoftCast + SoftCast+ delivers one-video that satisfies all channels qualities

Video Quality as Function of Channel Quality SoftCast 2-layer video +

Video Quality as Function of Channel Quality SoftCast 2-layer video 3-layer video + Alternatives, simply replace one cliff with a few smaller cliffs

SoftCast+ is beneficial even with a single mobile receiver Mobility Demo SoftCast+ is beneficial even with a single mobile receiver http://people.csail.mit.edu/szym/softcast/single.swf?config=data/tennis.xml&chart=0

Related Work Rate distortion theory Past work on joint source channel coding Analog and hybrid systems But has compression & error protection over real values

Conclusion SoftCast+ : one video to satisfy all channel qualities Key idea: Linear JSCC over the reals Is implemented and evaluated in a wireless testbed Increases scalability and robustness to mobility