Isomorphic constructions of tail-biting trellises for linear block codes

Zhou Jianqin, Tomoaki Ohtsuki

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007
出版社Institute of Electrical and Electronics Engineers Inc.
ページ585-589
ページ数5
ISBN(印刷版)9781424410095
DOI
出版ステータスPublished - 2007 1月 1
イベント2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 - Shanghai, China
継続期間: 2007 8月 222007 8月 24

出版物シリーズ

名前Proceedings 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
国/地域China
CityShanghai
Period07/8/2207/8/24

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • 電子工学および電気工学

フィンガープリント

「Isomorphic constructions of tail-biting trellises for linear block codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル