By Topic

Optimal rate allocation for the vector Gaussian CEO problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jin-Jun Xiao ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Mineapolis, MN, USA ; Zhi-Quan Luo

Consider the problem of estimating a vector source with a bandwidth constrained sensor network in which sensors make distributed observations on the source and collaborate with a fusion center (FC) to generate a final estimate. Due to power and bandwidth limitations, each sensor must compress its data and transmit to the FC only the minimum amount of information necessary to ensure the final estimate meets a given distortion bound. The optimal power allocation for the class of linear decentralized analog compression schemes was considered in Z-Q Luo et al. (2005) and proved to be NP-hard in general. In this paper, we consider the optimal rate allocation problem in the so called Berger-Tung achievable rate distortion region. In contrast to the power allocation for the linear analog compression schemes, we show that the optimal rate allocation can be formulated as a convex optimization problem which can be efficiently solved by interior point methods. Our convex reformulation technique is also applicable to the vector Gaussian multiterminal source coding problem.

Published in:

Computational Advances in Multi-Sensor Adaptive Processing, 2005 1st IEEE International Workshop on

Date of Conference:

13-15 Dec. 2005