Isomorphic constructions of tail-biting trellises for linear block codes

Zhou Jianqin; Tomoaki Ohtsuki

doi:10.1109/CHINACOM.2007.4469459

Isomorphic constructions of tail-biting trellises for linear block codes

Zhou Jianqin, Tomoaki Ohtsuki

Department of Information and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	585-589
Number of pages	5
ISBN (Print)	9781424410095
DOIs	https://doi.org/10.1109/CHINACOM.2007.4469459
Publication status	Published - 2007 Jan 1
Event	2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 - Shanghai, China Duration: 2007 Aug 22 → 2007 Aug 24

Publication series

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

Other

Other	2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007
Country	China
City	Shanghai
Period	07/8/22 → 07/8/24

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/CHINACOM.2007.4469459

Fingerprint Dive into the research topics of 'Isomorphic constructions of tail-biting trellises for linear block codes'. Together they form a unique fingerprint.

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

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. Institute of Electrical and Electronics Engineers Inc., 2007. p. 585-589 4469459 (Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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., 4469459, Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007, Institute of Electrical and Electronics Engineers Inc., 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. Institute of Electrical and Electronics Engineers Inc. 2007. p. 585-589. 4469459. (Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007). 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. Institute of Electrical and Electronics Engineers Inc., 2007. pp. 585-589 (Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007).

@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 = "2007",

month = jan,

day = "1",

doi = "10.1109/CHINACOM.2007.4469459",

language = "English",

isbn = "9781424410095",

series = "Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "585--589",

booktitle = "Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007",

note = "2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 ; Conference date: 22-08-2007 Through 24-08-2007",

}

TY - GEN

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

AU - Jianqin, Zhou

AU - Ohtsuki, Tomoaki

PY - 2007/1/1

Y1 - 2007/1/1

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

AN - SCOPUS:43949088826

SN - 9781424410095

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

SP - 585

EP - 589

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

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007

Y2 - 22 August 2007 through 24 August 2007

ER -