Rateless Codes for Single-Server Streaming to Diverse Users

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Invited paper, the 47th Annual Allerton Conference on Communication, Control, and Computing, 2009

Scientific paper

We investigate the performance of rateless codes for single-server streaming to diverse users, assuming that diversity in users is present not only because they have different channel conditions, but also because they demand different amounts of information and have different decoding capabilities. The LT encoding scheme is employed. While some users accept output symbols of all degrees and decode using belief propagation, others only collect degree- 1 output symbols and run no decoding algorithm. We propose several performance measures, and optimize the performance of the rateless code used at the server through the design of the code degree distribution. Optimization problems are formulated for the asymptotic regime and solved as linear programming problems. Optimized performance shows great improvement in total bandwidth consumption over using the conventional ideal soliton distribution, or simply sending separately encoded streams to different types of user nodes. Simulation experiments confirm the usability of the optimization results obtained for the asymptotic regime as a guideline for finite-length code design.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Rateless Codes for Single-Server Streaming to Diverse Users does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rateless Codes for Single-Server Streaming to Diverse Users, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rateless Codes for Single-Server Streaming to Diverse Users will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-567925

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.