Three Schemes for Wireless Coded Broadcast to Heterogeneous Users
Preprint
Abstract
We study and compare three coded schemes for single-server wireless broadcast of multiple description coded content to heterogeneous users. The users (sink nodes) demand different number of descriptions over links with different packet loss rates. The three coded schemes are based on the LT codes, growth codes, and randomized chunked codes. The schemes are compared on the basis of the total number of transmissions required to deliver the demands of all users, which we refer to as the server (source) delivery time. We design the degree distributions of LT codes by solving suitably defined linear optimization problems, and numerically characterize the achievable delivery time for different coding schemes. We find that including a systematic phase (uncoded transmission) is significantly beneficial for scenarios with low demands, and that coding is necessary for efficiently delivering high demands. Different demand and error rate scenarios may require very different coding schemes. Growth codes and chunked codes do not perform as well as optimized LT codes in the heterogeneous communication scenario.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network CodingIEEE Transactions on Information Theory, 2011
- H.264 video streaming with data-partitioning and Growth codes2009
- Network Coding Applications2007
- Unequal Growth Codes: Intermediate Performance and Unequal Error Protection for Video Streaming2007
- Multiple description coding: compression meets the networkIEEE Signal Processing Magazine, 2001
- Rate-distortion optimized layered coding with unequal error protection for robust Internet videoIEEE Transactions on Circuits and Systems for Video Technology, 2001
- Birthday paradox, coupon collectors, caching algorithms and self-organizing searchDiscrete Applied Mathematics, 1992
- General broadcast channels with degraded message setsIEEE Transactions on Information Theory, 1977