Optimal Identical Binary Quantizer Design for Distributed Estimation
From MaRDI portal
Abstract: We consider the design of identical one-bit probabilistic quantizers for distributed estimation in sensor networks. We assume the parameter-range to be finite and known and use the maximum Cram'er-Rao Lower Bound (CRB) over the parameter-range as our performance metric. We restrict our theoretical analysis to the class of antisymmetric quantizers and determine a set of conditions for which the probabilistic quantizer function is greatly simplified. We identify a broad class of noise distributions, which includes Gaussian noise in the low-SNR regime, for which the often used threshold-quantizer is found to be minimax-optimal. Aided with theoretical results, we formulate an optimization problem to obtain the optimum minimax-CRB quantizer. For a wide range of noise distributions, we demonstrate the superior performance of the new quantizer - particularly in the moderate to high-SNR regime.
Recommendations
- Distributed quantization estimation and optimal bit allocation for a random variable
- Performance Limit for Distributed Estimation Systems With Identical One-Bit Quantizers
- Distributed estimation and quantization
- On the optimality of finite-level quantizations for distributed signal detection
- On Quantizer Design for Distributed Bayesian Estimation in Sensor Networks
- Quantizer Precision for Distributed Estimation in a Large Sensor Network
- Asymptotically optimal quantizers for detection of i.i.d
- Quantization Design for Distributed Optimization
- Design of Binary Quantizers for Distributed Detection Under Secrecy Constraints
- Design and Analysis of Distributed Averaging With Quantized Communication
Cited in
(2)
This page was built for publication: Optimal Identical Binary Quantizer Design for Distributed Estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573894)