A codeword weight lower bound for a class of tail-biting turbo codes

Zheng Yan-Xiu*, Yu-Ted Su

*Corresponding author for this work

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

Abstract

This paper presents an achievable codeword weight lower bound associated with weight-2 input sequences of a class of turbo codes. The class of codes has an interleaver structure that encompasses most practical interleaves used by turbo codes. It partitions the incoming information sequence into blocks of the same size and the interleaver performs intra-block and inter-block permutations. Both pre- and post-permuted blocks are individually tail-biting encoded. Following [4], we refer to the codeword associated with a weight-2 input sequence as a weight-2 error event. We apply a special permutation function that incorporates the separate encoding concept to derive a lower bound of the weight-2 error event. This lower bound reveals that (i) a larger component code period gives better distance for the weight-2 error events, and (ii) separate encoding results in improved distance if the block length is suitably chosen and is large enough.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages661-665
Number of pages5
DOIs
StatePublished - 1 Dec 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

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

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
CountryFrance
CityNice
Period24/06/0729/06/07

Fingerprint Dive into the research topics of 'A codeword weight lower bound for a class of tail-biting turbo codes'. Together they form a unique fingerprint.

  • Cite this

    Yan-Xiu, Z., & Su, Y-T. (2007). A codeword weight lower bound for a class of tail-biting turbo codes. In Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007 (pp. 661-665). [4557300] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2007.4557300