pith. machine review for the scientific record. sign in

arxiv: 1010.3519 · v1 · pith:2T6N6L32new · submitted 2010-10-18 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords codingdistributedbroadcastcasetwo-encoderadvantageapproximationping-pong
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.