Joint source-channel coding and guessing with application to sequential decoding

• Published in: IEEE transactions on information theory Vol. 44; no. 5; pp. 1756 - 1769
• Main Authors: Arikan, E., Merhav, N.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.1998; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Channel coding; Codes; Computational complexity; Data transmission; Decoding; Distortion measurement; H infinity control; Information; Information theory; Laboratories; Random variables; Rate-distortion; Source coding
• ISSN: 0018-9448; 1557-9654; 1557-9654
• DOI: 10.1109/18.705557

We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense that it is allowed to generate successive estimates of the source output until the distortion criterion is met. The problem is to design the encoder and the decoder so as to minimize the average number of estimates until successful reconstruction. We derive estimates on nonnegative moments of the number of guesses, which are asymptotically tight as the length of the source block goes to infinity. Using the close relationship between guessing and sequential decoding, we give a tight lower bound to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev (1973) and Hellman (1975). Another topic explored here is the probability of error for list decoders with exponential list sizes for joint source-channel coding systems, for which we obtain tight bounds as well. It is noteworthy that optimal performance w.r.t. the performance measures considered here can be achieved in a manner that separates source coding and channel coding.