Rate and power allocation under the pairwise distributed source coding constraint

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

The first version was published in ISIT 2008. The new version includes all detailed proofs and more simulation results. The la

Scientific paper

We consider the problem of rate and power allocation for a sensor network under the pairwise distributed source coding constraint. For noiseless source-terminal channels, we show that the minimum sum rate assignment can be found by finding a minimum weight arborescence in an appropriately defined directed graph. For orthogonal noisy source-terminal channels, the minimum sum power allocation can be found by finding a minimum weight matching forest in a mixed graph. Numerical results are presented for both cases showing that our solutions always outperform previously proposed solutions. The gains are considerable when source correlations are high.

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

Rate and power allocation under the pairwise distributed source coding constraint 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 Rate and power allocation under the pairwise distributed source coding constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rate and power allocation under the pairwise distributed source coding constraint will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-595656

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