TY - GEN
T1 - Error-trellises for tailbiting convolutional codes
AU - Tajima, Masato
AU - Okino, Koji
PY - 2012
Y1 - 2012
N2 - In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we obtain the scalar parity-check matrix for a tailbiting convolutional code. Moreover, we show the close relationship between code-trellises for an SST Viterbi decoder and error-trellises for a syndrome decoder. The proposed construction is based on the adjoint-obvious realization of a syndrome former.
AB - In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we obtain the scalar parity-check matrix for a tailbiting convolutional code. Moreover, we show the close relationship between code-trellises for an SST Viterbi decoder and error-trellises for a syndrome decoder. The proposed construction is based on the adjoint-obvious realization of a syndrome former.
UR - http://www.scopus.com/inward/record.url?scp=84873554864&partnerID=8YFLogxK
M3 - 会議への寄与
AN - SCOPUS:84873554864
SN - 9784885522673
T3 - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012
SP - 648
EP - 652
BT - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012
T2 - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012
Y2 - 28 October 2012 through 31 October 2012
ER -