Resource-scalable joint source-channel MAP and MMSE estimation of multiple descriptions

Authors:
Xiaolin Wu;Xiaohan Wang;Zhe Wang
Affiliations:
Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 6
Cited 1

Iterative Decoding of Multiple Descriptions

DCC '99 Proceedings of the Conference on Data Compression
Multiple Description Lattice Vector Quantization

DCC '99 Proceedings of the Conference on Data Compression
The good, bad and ugly: distributed detection of a known signal in dependent Gaussian noise

IEEE Transactions on Signal Processing
Decentralized detection in sensor networks

IEEE Transactions on Signal Processing
Multiple-description vector quantization with lattice codebooks: design and analysis

IEEE Transactions on Information Theory
Monotonicity-based fast algorithms for MAP estimation of Markov sequences over noisy channels

IEEE Transactions on Information Theory

Adaptive multiple description coding for hybrid networks with dynamic PLR and BER

Image Communication

Quantified Score

Hi-index	35.68

Visualization

Abstract

A joint source-channel multiple description (JSC-MD) framework for signal estimation and communication in resource-constrained lossy networks is presented. To keep the encoder complexity at a minimum, a signal is coded by a multiple description quantizer (MDQ) with neither entropy nor channel coding. The code diversity of MDQ and the path diversity of the network are exploited by decoders to combat transmission errors. A key design objective is resource scalability: powerful nodes in the network can perform JSC-MD estimation under the criteria of maximum a posteriori probability (MAP) or minimum mean-square error (MMSE), while primitive nodes resort to simpler MD decoding, all working with the same MDQ code. The application of JSC-MD to distributed estimation of hidden Markov models in a sensor network is demonstrated. The proposed JSC-MD MAP estimator is an algorithm of the longest path in a weighted directed acyclic graph, while the JSC-MD MMSE decoder is an extension of the well-known forward-backward algorithm to multiple descriptions. Both algorithms simultaneously exploit the source memory, the redundancy of the fixed-rate MDQ and the inter-description correlations. They outperform the existing hard-decision MDQ decoders by large margins (up to 8 dB). For Gaussian Markov sources, the complexity of JSC-MD distributed MAP sequence estimation can be made as low as that of typical single description Viterbi-type algorithms.