Détection binaire distribuée sous contraintes de communication

Abstract : In recents years, interest has been growing in research of different autonomous systems. From the self-dring car to the Internet of Things (IoT), it is clear that the ability of automated systems to make autonomous decisions in a timely manner is crucial in the 21st century. These systems will often operate under stricts constains over their resources. In this thesis, an information-theoric approach is taken to this problem, in hope that a fundamental understanding of the limitations and perspectives of such systems can help future engineers in designing them.Throughout this thesis, collaborative distributed binary decision problems are considered. Two statisticians are required to declare the correct probability measure of two jointly distributed memoryless process, denoted by $vct{X}^n=(X_1,dots,X_n)$ and $vct{Y}^n=(Y_1,dots,Y_n)$, out of two possible probability measures on finite alphabets, namely $P_{XY}$ and $P_{bar{X}bar{Y}}$. The marginal samples given by $vct{X}^n$ and $vct{Y}^n$ are assumed to be available at different locations.The statisticians are allowed to exchange limited amounts of data over a perfect channel with a maximum-rate constraint. Throughout the thesis, the nature of communication varies. First, only unidirectional communication is allowed. Using its own observations, the receiver of this communication is required to first identify the legitimacy of its sender by declaring the joint distribution of the process, and then depending on such authentication it generates an adequate reconstruction of the observations satisfying an average per-letter distortion. Bidirectional communication is subsequently considered, in a scenario that allows interactive communication between the participants.
Document type :
Theses
Complete list of metadatas

Cited literature [105 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01461651
Contributor : Abes Star <>
Submitted on : Monday, February 20, 2017 - 11:50:07 AM
Last modification on : Tuesday, April 16, 2019 - 9:07:25 AM
Long-term archiving on : Sunday, May 21, 2017 - 12:24:04 PM

Identifiers

  • HAL Id : tel-01461651, version 1

Citation

Gil Katz. Détection binaire distribuée sous contraintes de communication. Autre. Université Paris-Saclay, 2017. Français. ⟨NNT : 2017SACLC001⟩. ⟨tel-01461651⟩

Share

Metrics

Record views

862

Files downloads

370