Conference Proceeding

Coding perspectives for collaborative estimation over networks

Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA, USA
Circuits, Systems and Computers, 1977. Conference Record. 1977 11th Asilomar Conference on 12/2010; DOI:10.1109/ACSSC.2010.5757774 In proceeding of: Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on
Source: IEEE Xplore

ABSTRACT A collaborative distributed estimation problem over a communication constrained network is considered from an information theory perspective. A suitable architecture for the codes for this multiterminal information theory problem is determined under source-channel separation. In particular, distributed source codes in which each node multicasts a different message to each subset of other nodes are studied. This code construction hybridizes multiple description codes and codes for the CEO problem. The goal of this paper is to determine the fundamental relationship between the multicast communication rates and estimation performance obtainable. An achievable rate distortion region is proved to this problem and its structural properties are studied. Also, this achievable rate region is shown to simplify to the known bounds to some simpler problems.

0 0
 · 
0 Bookmarks
 · 
52 Views
  • [show abstract] [hide abstract]
    ABSTRACT: A unified treatment of a large class of multiterminal noiseless source coding problems including all previously studied situations is presented. A unified achievable rate region is established for this class by a coding technique based on the typical sequence criterion. This region is tight for all the previously studied situations.
    IEEE Transactions on Information Theory 06/1980; · 2.62 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the "CEO problem." The bound recovers many of the converse results that have been established for special cases of the problem, including the recent one for the Gaussian two-encoder problem.
    IEEE Transactions on Information Theory 06/2008; · 2.62 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We consider a distributed sensor network in which several observations are communicated to the fusion center using limited transmission rate. The observation must be separately encoded so that the target can be estimated with minimum average distortion. We address the problem from an information theoretic perspective and establish the inner and outer bound of the admissible rate-distortion region. We derive an upper bound on the sum-rate distortion function and its corresponding rate allocation schemes by exploiting the contra-polymatroid structure of the achievable rate region. The quadratic Gaussian case is analyzed in detail and the optimal rate allocation schemes in the achievable rate region are characterized. We show that our upper bound on the sum-rate distortion function is tight for the quadratic Gaussian CEO problem in the case of same signal-to-noise ratios at the sensors.
    IEEE Journal on Selected Areas in Communications 09/2004; · 3.12 Impact Factor

Full-text

View
0 Downloads
Available from

S. Ramanan