Decentralized estimation under communication constraints

Üney, Murat
In this thesis, we consider the problem of decentralized estimation under communication constraints in the context of Collaborative Signal and Information Processing. Motivated by sensor network applications, a high volume of data collected at distinct locations and possibly in diverse modalities together with the spatially distributed nature and the resource limitations of the underlying system are of concern. Designing processing schemes which match the constraints imposed by the system while providing a reasonable accuracy has been a major challenge in which we are particularly interested in the tradeoff between the estimation performance and the utilization of communications subject to energy and bandwidth constraints. One remarkable approach for decentralized inference in sensor networks is to exploit graphical models together with message passing algorithms. In this framework, after the so-called information graph of the problem is constructed, it is mapped onto the underlying network structure which is responsible for delivering the messages in accordance with the schedule of the inference algorithm. However it is challenging to provide a design perspective that addresses the tradeoff between the estimation accuracy and the cost of communications. Another approach has been performing the estimation at a fusion center based on the quantized information provided by the peripherals in which the fusion and quantization rules are sought while taking a restricted set of the communication constraints into account. We consider two classes of in-network processing strategies which cover a broad range of constraints and yield tractable Bayesian risks that capture the cost of communications as well as the penalty for estimation errors. A rigorous design setting is obtained in the form of a constrained optimization problem utilizing the Bayesian risks. These processing schemes have been previously studied together with the structures that the solutions exhibit in the context of decentralized detection in which a decision out of finitely many choices is made. We adopt this framework for the estimation problem. However, for the case, computationally infeasible solutions arise that involve integral operators that are impossible to evaluate exactly in general. In order not to compromise the fidelity of the model we develop an approximation framework using Monte Carlo methods and obtain particle representations and approximate computational schemes for both the in-network processing strategies and the solution schemes to the design problem. Doing that, we can produce approximating strategies for decentralized estimation networks under communication constraints captured by the framework including the cost. The proposed Monte Carlo optimization procedures operate in a scalable and efficient manner and can produce results for any family of distributions of concern provided that samples can be produced from the marginals. In addition, this approach enables a quantification of the tradeoff between the estimation accuracy and the cost of communications through a parameterized Bayesian risk.


Electromagnetic scattering analysis and design of sandwich type radomes
Şerefoğlu, Mehmet Murat; Dural Ünver, Mevlüde Gülbin; Department of Electrical and Electronics Engineering (2009)
In this thesis work, importance of radome structures for antenna systems is emphasized. Structural and electromagnetic requirements of various types of radome structures are analyzed and specific properties are given. Electromagnetic scattering analysis of sandwich type radome seams has been done. Total antenna system far electromagnetic field expression, which is the combination of original antenna far electromagnetic field and the scattered electromagnetic field of the framework of the sandwich radome str...
Parallelized architectures for low latency turbo structures
Gazi, Orhan; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2007)
In this thesis, we present low latency general concatenated code structures suitable for parallel processing. We propose parallel decodable serially concatenated codes (PDSCCs) which is a general structure to construct many variants of serially concatenated codes. Using this most general structure we derive parallel decodable serially concatenated convolutional codes (PDSCCCs). Convolutional product codes which are instances of PDSCCCs are studied in detail. PDSCCCs have much less decoding latency and show ...
Chaotic digital modulation and demodulation
Öztürk, Uygar; Demirbaş, Kerim; Department of Electrical and Electronics Engineering (2005)
This thesis considers a communication system with chaotic modulation. Noise-like signals are generated by chaotic systems with different parameters to modulate binary digital signals. Demodulation is performed by both the Extended Kalman Filter (EKF) and Optimum Decoding Based Smoothing Algorithm (ODSA). Simulations are performed using both of these algorithms for different parameters affecting the performance of the communication system. Simulation results of these algorithms are compared.
Signal reconstruction from nonuniform samples
Serdaroğlu, Bülent; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2005)
Sampling and reconstruction is used as a fundamental signal processing operation since the history of signal theory. Classically uniform sampling is treated so that the resulting mathematics is simple. However there are various instances that nonuniform sampling and reconstruction of signals from their nonuniform samples are required. There exist two broad classes of reconstruction methods. They are the reconstruction according to a deterministic, and according to a stochastic model. In this thesis, the mos...
Recursive passive localization methods using time difference of arrival
Çamlıca, Sedat; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2009)
In this thesis, the passive localization problem is studied. Robust and recursive solutions are presented by the use of Time Difference of Arrival (TDOA). The TDOA measurements are assumed to be gathered by moving sensors which makes the number of the sensors increase synthetically. First of all, a location estimator should be capable of processing the new measurements without omitting the past data. This task can be accomplished by updating the estimate recursively whenever new measurements are available. ...
Citation Formats
M. Üney, “Decentralized estimation under communication constraints,” Ph.D. - Doctoral Program, Middle East Technical University, 2009.