LOW-COMPLEXITY CODING FOR THE CEO PROBLEM WITH MANY ENCODERS

摘要

Motivated by a sensor networking application, we consider the CEO problem, in which noisy observations of a common, source process are separately encoded and sent to a. joint receiver. The goal of the decoder is to produce the best possible reconstruction of the source subject to some distortion criterion. Focusing on the quadratic Gaussian case, for which the rate-distortion function has recently been determined, we present practical coding schemes that are feasible for a very large number of distributed encoders, allowing a desirable trade-off between rate-distortion performance and algorithmic complexity.