ChinaCom2008-Information and Coding Theory Symposium

Research Article

Embedding Constructions of Tail-Biting Trellises for Linear Block Codes

  • @INPROCEEDINGS{10.1109/CHINACOM.2008.4685035,
        author={Jianqin Zhou and Xifeng Wang and Zhenfei Xie},
        title={Embedding Constructions of Tail-Biting Trellises for Linear Block Codes},
        proceedings={ChinaCom2008-Information and Coding Theory Symposium},
        publisher={IEEE},
        proceedings_a={CHINACOM2008-ICT},
        year={2008},
        month={11},
        keywords={Linear block code conventional trellis nonmergeable trellis tail-biting trellis embedding construction},
        doi={10.1109/CHINACOM.2008.4685035}
    }
    
  • Jianqin Zhou
    Xifeng Wang
    Zhenfei Xie
    Year: 2008
    Embedding Constructions of Tail-Biting Trellises for Linear Block Codes
    CHINACOM2008-ICT
    IEEE
    DOI: 10.1109/CHINACOM.2008.4685035
Jianqin Zhou1,*, Xifeng Wang2,*, Zhenfei Xie2,*
  • 1: Telecommunication School, Hangzhou Dianzi University Hangzhou 310018, China
  • 2: Computer Science School, Anhui University of Technology Ma’anshan, 243002 China
*Contact email: zhou@hdu.edu.cn, wxf80106@163.com, xie_zhenfei@ahut.edu.cn

Abstract

In this paper, an embedding construction of tail-biting trellises for linear block codes is presented. With the new approach of constructing tail-biting trellises, most of the study of tail-biting trellises can be converted into the study of conventional trellises. It is proved that any minimal tail-biting trellis can be constructed by the recursive process of embedding constructions from the well-known Bahl-Cocke-Jelinek-Raviv (BCJR) constructed conventional trellises. Furthermore, several properties of embedding constructions of tail-biting trellises are discussed.