We consider a new problem in multiterminal source coding motivated by the following decentralized communication/estimation task. A firm's Chief Executive Officer (CEO) is interested in the data sequence {X(t)}/sub t=1//sup /spl infin// which cannot be observed directly, perhaps because it represents tactical decisions by a competing firm. The CEO deploys a team of L agents who observe independently corrupted versions of {X(t)}/sub t=1//sup /spl infin//. Because {X(t)} is only one among many pressing matters to which the CEO must attend, the combined data rate at which the agents may communicate information about their observations to the CEO is limited to, say, R bits per second. If the agents were permitted to confer and pool their data, then in the limit as L/spl rarr//spl infin/ they usually would be able to smooth out their independent observation noises entirely. Then they could use their R bits per second to provide the CEO with a representation of {X(t)} with fidelity D(R), where D(/spl middot/) is the distortion-rate function of {X(t)}. In particular, with such data pooling D can be made arbitrarily small if R exceeds the entropy rate H of {X(t)}. Suppose, however, that the agents are not permitted to convene, Agent i having to send data based solely on his own noisy observations {Y/sub i/(t)}. We show that then there does not exist a finite value of R for which even infinitely many agents can make D arbitrarily small. Furthermore, in this isolated-agents case we determine the asymptotic behavior of the minimal error frequency in the limit as L and then R tend to infinity.
[1]
Te Han,et al.
Hypothesis testing with multiterminal data compression
,
1987,
IEEE Trans. Inf. Theory.
[2]
A. Barron.
THE STRONG ERGODIC THEOREM FOR DENSITIES: GENERALIZED SHANNON-MCMILLAN-BREIMAN THEOREM'
,
1985
.
[3]
Hossam M. H. Shalaby,et al.
Error exponents for distributed detection of Markov sources
,
1994,
IEEE Trans. Inf. Theory.
[4]
Hossam M. H. Shalaby,et al.
Multiterminal detection with zero-rate data compression
,
1992,
IEEE Trans. Inf. Theory.
[5]
Shun-ichi Amari,et al.
Statistical inference under multiterminal rate restrictions: A differential geometric approach
,
1989,
IEEE Trans. Inf. Theory.
[6]
Rudolf Ahlswede,et al.
Hypothesis testing with communication constraints
,
1986,
IEEE Trans. Inf. Theory.
[7]
Nils Sandell,et al.
Detection with Distributed Sensors
,
1980,
IEEE Transactions on Aerospace and Electronic Systems.
[8]
Te Sun Han,et al.
Exponential-type error probabilities for multiterminal hypothesis testing
,
1989,
IEEE Trans. Inf. Theory.
[9]
Richard E. Blahut,et al.
Hypothesis testing and information theory
,
1974,
IEEE Trans. Inf. Theory.
[10]
A. Barron.
ENTROPY AND THE CENTRAL LIMIT THEOREM
,
1986
.
[11]
Toby Berger,et al.
Estimation via compressed information
,
1988,
IEEE Trans. Inf. Theory.
[12]
John N. Tsitsiklis,et al.
Decentralized detection by a large number of sensors
,
1988,
Math. Control. Signals Syst..