Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

In Proceedings of the 48th Annual Allerton Conference on Communication, Control and Computing, University of Illinois, Montice

Scientific paper

Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor networks provides a free gossip mechanism which can be used to simplify encoding/decoding and reduce transmission power. Using this broadcast advantage, we present a new two-encoder scheme which imitates the ping-pong game and has a successive approximation structure. For the quadratic Gaussian case, we prove that this scheme is successively refinable on the {sum-rate, distortion pair} surface, which is characterized by the rate-distortion region of the distributed two-encoder source coding. A potential energy saving over conventional distributed coding is also illustrated. This ping-pong distributed coding idea can be extended to the multiple encoder case and provides the theoretical foundation for a new class of distributed image coding method in wireless scenarios.

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

Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case 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 Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-305475

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