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
Pages585-589
Number of pages5
DOIs
Publication statusPublished - 2008
Event2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 - Shanghai, China
Duration: 2007 Aug 222007 Aug 24

Other

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

Fingerprint

Block codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Jianqin, Z., & Ohtsuki, T. (2008). 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] https://doi.org/10.1109/CHINACOM.2007.4469459

Isomorphic constructions of tail-biting trellises for linear block codes. / Jianqin, Zhou; Ohtsuki, Tomoaki.

Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007. 2008. p. 585-589 4469459.

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

Jianqin, Z & Ohtsuki, T 2008, 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., 4469459, pp. 585-589, 2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007, Shanghai, China, 07/8/22. https://doi.org/10.1109/CHINACOM.2007.4469459
Jianqin Z, Ohtsuki T. 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. 2008. p. 585-589. 4469459 https://doi.org/10.1109/CHINACOM.2007.4469459
Jianqin, Zhou ; Ohtsuki, Tomoaki. / Isomorphic constructions of tail-biting trellises for linear block codes. Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007. 2008. pp. 585-589
@inproceedings{b26f6471d5d04862b378756e99186e7b,
title = "Isomorphic constructions of tail-biting trellises for linear block codes",
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.",
author = "Zhou Jianqin and Tomoaki Ohtsuki",
year = "2008",
doi = "10.1109/CHINACOM.2007.4469459",
language = "English",
isbn = "9781424410095",
pages = "585--589",
booktitle = "Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007",

}

TY - GEN

T1 - Isomorphic constructions of tail-biting trellises for linear block codes

AU - Jianqin, Zhou

AU - Ohtsuki, Tomoaki

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=43949088826&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43949088826&partnerID=8YFLogxK

U2 - 10.1109/CHINACOM.2007.4469459

DO - 10.1109/CHINACOM.2007.4469459

M3 - Conference contribution

SN - 9781424410095

SP - 585

EP - 589

BT - Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007

ER -