Error-resilient and complexity-constrained distributed coding for large scale sensor networks
Proceedings of the 11th international conference on Information Processing in Sensor Networks
| Hi-index | 0.00 |
Scalable joint decoding of correlated observations transmitted using distributed quantization in a sensor-network is considered. In particular, quantized observations are modeled as a Markov-random filed (MRF), from which we construct a factor-graph for implementing the decoder using the well known sum-product algorithm. An attractive property of this approach is that the decoder complexity can be controlled by the choice of the clique structure used to define the Gibbs distribution of the MRF model. The experimental results obtained with a widely used correlated Gaussian observation model is presented, which demonstrate that substantial performance gains can be achieved by joint decoding based on simple clique structures and potential functions.