Computer Science – Information Theory
Scientific paper
2008-09-08
Computer Science
Information Theory
26 pages
Scientific paper
We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-tooptimal solutions based on Turbo and LDPC codes exist for this problem, in most cases the proposed techniques do not scale to networks of hundreds of sensors. We present a scalable solution based on the following key elements: (a) distortion-optimized index assignments for low-complexity distributed quantization, (b) source-optimized hierarchical clustering based on the Kullback-Leibler distance and (c) sum-product decoding on specific factor graphs exploiting the correlation of the data.
Barros Jake
Maierbacher G.
No associations
LandOfFree
Low-Complexity Coding and Source-Optimized Clustering for Large-Scale Sensor Networks 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 Low-Complexity Coding and Source-Optimized Clustering for Large-Scale Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-Complexity Coding and Source-Optimized Clustering for Large-Scale Sensor Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-30766