Multi-class source-channel coding

Abstract

This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be seen as a concatenation of a source code and a channel code, the overall performance improves on that of separate source-channel coding and approaches that of joint source-channel coding when the number of classes increases.


This work was supported in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant FPDI-2013-18602, Grant RYC-2011-08150, Grant TEC2012-38800-C03-03, and Grant TEC2013-41718-R, and in part by the European Union’s 7th Framework Programme under Grant 303633 and Grant 329837.

Document Type

Article


Accepted version

Language

English

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related items

IEEE Information Theory Society. 2016 Jul 7;62(9):5093-104.

info:eu-repo/grantAgreement/EC/FP7/259663

info:eu-repo/grantAgreement/ES/1PE/FPD2013-18602

info:eu-repo/grantAgreement/ES/3PN/RYC2011-08150

info:eu-repo/grantAgreement/ES/3PN/TEC2012-38800-C03-03

info:eu-repo/grantAgreement/ES/1PE/TEC2013-41718-R

info:eu-repo/grantAgreement/EC/FP7/303633

info:eu-repo/grantAgreement/EC/FP7329837

Recommended citation

This citation was generated automatically.

Rights

© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published article can be found at http://dx.doi.org/10.1109/TIT.2016.2588496

This item appears in the following Collection(s)