Title :
Index assignment optimization for joint source-channel MAP decoding
Author :
Wang, Xiaohan ; Wu, Xiaolin
Author_Institution :
Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, ON, Canada
fDate :
3/1/2010 12:00:00 AM
Abstract :
Channel-optimized quantizer index assignment and maximum a posteriori (MAP) decoding have been extensively studied for error-resilient communications. An interesting and largely untreated problem is how to optimize the index assignment with respect to joint source-channel MAP decoding. In this paper we formulate the above problem as one of quadratic assignment, and discuss its solutions from very general to some special cases. For highly correlated Gaussian Markov sources and Hamming distortion, we can construct the optimal index assignment analytically. For general cases, simulated annealing algorithm is adopted to search for the optimal index assignment. Experimental results are presented to demonstrate the performance improvement of the index assignments optimized for MAP decoding over those designed for hard-decision decoding (e.g. Gray code). The reduction of symbol error rate and mean squared error can be as large as 40% and 50% respectively for highly correlated Gaussian Markov sources.
Keywords :
Gaussian processes; Hamming codes; Markov processes; channel coding; combined source-channel coding; decoding; error statistics; maximum likelihood estimation; mean square error methods; Gaussian Markov sources; Hamming distortion; channel-optimized quantizer index assignment; error-resilient communications; index assignment optimization; joint source-channel MAP decoding; maximum a posteriori decoding; mean squared error; optimal index assignment; quadratic assignment; Bandwidth; Channel coding; Communication systems; Decoding; Design optimization; Error analysis; Hamming distance; Niobium compounds; Reflective binary codes; Simulated annealing; Graph bandwidth, index assignment, joint source-channel coding (JSCC), Markov process, maximum a posteriori probability (MAP) estimation, quadratic assignment problem (QAP);
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2010.03.080456