The Dispersion of Mismatched Joint Source-Channel Coding for Arbitrary Sources and Additive Channels

From MaRDI portal
Publication:5223929

DOI10.1109/TIT.2018.2875765zbMATH Open1431.94071arXiv1711.11206OpenAlexW2962974085MaRDI QIDQ5223929FDOQ5223929


Authors: Lin Zhou, Vincent Y. F. Tan, Mehul Motani Edit this on Wikidata


Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We consider a joint source channel coding (JSCC) problem in which we desire to transmit an arbitrary memoryless source over an arbitrary additive channel. We propose a mismatched coding architecture that consists of Gaussian codebooks for both the source reproduction sequences and channel codewords. The natural nearest neighbor encoder and decoder, however, need to be judiciously modified to obtain the highest communication rates at finite blocklength. In particular, we consider a unequal error protection (UEP) scheme in which all sources are partitioned into disjoint power type classes. We also regularize the nearest neighbor decoder so that an appropriate measure of the size of each power type class is taken into account in the decoding strategy. For such an architecture, we derive ensemble-tight second-order and moderate deviations results. Our first-order (optimal bandwidth expansion ratio) result generalizes the seminal results by Lapidoth (1996, 1997). The dispersion of our JSCC scheme is a linear combination of the mismatched dispersions for the channel coding saddle-point problem by Scarlett, Tan and Durisi (2017) and the rate-distortion saddle-point problem by the present authors, thus also generalizing these results.


Full work available at URL: https://arxiv.org/abs/1711.11206







Cited In (2)





This page was built for publication: The Dispersion of Mismatched Joint Source-Channel Coding for Arbitrary Sources and Additive Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223929)