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

Simple item page
dc.citation.epage1769en_US
dc.citation.issueNumber5en_US
dc.citation.spage1756en_US
dc.citation.volumeNumber44en_US
dc.contributor.authorArikan, E.en_US
dc.contributor.authorMerhav, N.en_US
dc.date.accessioned2016-02-08T10:43:24Z
dc.date.available2016-02-08T10:43:24Z
dc.date.issued1998-09en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe 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 and Hellman. 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.en_US
dc.identifier.doi10.1109/18.705557en_US
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/11693/25359
dc.language.isoEnglishen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/18.705557en_US
dc.source.titleIEEE Transactions on Information Theoryen_US
dc.subjectJoint source-channel codingen_US
dc.subjectCommunication channels (information theory)en_US
dc.subjectData communication systemsen_US
dc.subjectDecodingen_US
dc.subjectError analysisen_US
dc.subjectProbabilityen_US
dc.subjectSignal distortionen_US
dc.subjectSequential decodingen_US
dc.subjectSignal encodingen_US
dc.titleJoint source-channel coding and guessing with application to sequential decodingen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Joint source-channel coding and guessing.pdf
Size:
829.13 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Electrical and Electronics Engineering