Isomorphic constructions of tail-biting trellises for linear block codes

Zhou Jianqin, Tomoaki Ohtsuki

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

1 Citation (Scopus)

Abstract

In this paper, a new approach of constructing tailbiting trellises for linear block codes is presented. It is proved that any minimal tail-biting trellis can be constructed by the recursive process of uniting two isomorphic subgraphs from the well-known Bahl-Cocke-Jelinek-Raviv(BCJR) constructed conventional trellises. Furthermore, several properties of isomorphic constructions of tail-biting trellises are discussed.

Original languageEnglish
Title of host publicationProceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages585-589
Number of pages5
ISBN (Print)9781424410095
DOIs
Publication statusPublished - 2007 Jan 1
Event2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 - Shanghai, China
Duration: 2007 Aug 222007 Aug 24

Publication series

NameProceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007

Other

Other2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007
CountryChina
CityShanghai
Period07/8/2207/8/24

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Jianqin, Z., & Ohtsuki, T. (2007). Isomorphic constructions of tail-biting trellises for linear block codes. In Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007 (pp. 585-589). [4469459] (Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CHINACOM.2007.4469459