UEP-optimal convolutional encoders with smallest McMillan degree

Chung-Hsuan Wang*, Wei Fan Wu, Jian Jia Weng

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In this paper, convolutional encoders are studied for unequal error protection (UEP) from an algebraic theoretical viewpoint. Given any convolutional code, UEP-optimal encoders with the smallest McMillan degree are constructed to minimize the coding complexity. The noncatastrophic property of encoder is also maintained to avoid the undesired catastrophic propagation of decoding errors.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages2028-2032
Number of pages5
DOIs
StatePublished - 23 Aug 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
CountryUnited States
CityAustin, TX
Period13/06/1018/06/10

Fingerprint Dive into the research topics of 'UEP-optimal convolutional encoders with smallest McMillan degree'. Together they form a unique fingerprint.

  • Cite this

    Wang, C-H., Wu, W. F., & Weng, J. J. (2010). UEP-optimal convolutional encoders with smallest McMillan degree. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings (pp. 2028-2032). [5513368] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513368