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 -