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 |
| Pages | 585-589 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2008 |
| Event | 2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 - Shanghai, China Duration: 2007 Aug 22 → 2007 Aug 24 |
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 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
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 proceeding › Conference contribution
}
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 -