.png){kind=icon}
返回
Rate and Power Allocation Under the Pairwise Distributed Source Coding Constraint
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2009.12.080519.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Distributed source coding
Slepian-Wolf theorem
matching forest
directed spanning tree
resource allocation
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
查看更多内容