Bidirectional Syndrome Decoding for Binary Rate (<I>n</I>-1)/<I>n</I> Convolutional Codes

Masato TAJIMA; Keiji TAKIDA; Zenshiro KAWASAKI

Bidirectional Syndrome Decoding for Binary Rate (n-1)/n Convolutional Codes

Masato TAJIMA, Keiji TAKIDA, Zenshiro KAWASAKI

Full Text Views

0

Share
Cite this

Summary :

The structure of bidirectional syndrome decoding for binary rate (n-1)/n convolutional codes is investigated. It is shown that for backward decoding based on the trellis of a syndrome former H^T, the syndrome sequence must be generated in time-reversed order using an extra syndrome former H^*T, where H^* is a generator matrix of the reciprocal dual code of the original code. It is also shown that if the syndrome bits are generated once and only once using H^T and H^*T, then the corresponding two error sequences have the intersection of n error symbols, where is the memory length of H^T.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.3 pp.510-513

Publication Date: 1998/03/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Information Theory and Coding Theory

Cite this

Copy

Masato TAJIMA, Keiji TAKIDA, Zenshiro KAWASAKI, "Bidirectional Syndrome Decoding for Binary Rate (n-1)/n Convolutional Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 3, pp. 510-513, March 1998, doi: .
Abstract: The structure of bidirectional syndrome decoding for binary rate (n-1)/n convolutional codes is investigated. It is shown that for backward decoding based on the trellis of a syndrome former H^T, the syndrome sequence must be generated in time-reversed order using an extra syndrome former H^*T, where H^* is a generator matrix of the reciprocal dual code of the original code. It is also shown that if the syndrome bits are generated once and only once using H^T and H^*T, then the corresponding two error sequences have the intersection of n error symbols, where is the memory length of H^T.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e81-a_3_510/_p

Copy

@ARTICLE{e81-a_3_510,
author={Masato TAJIMA, Keiji TAKIDA, Zenshiro KAWASAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Bidirectional Syndrome Decoding for Binary Rate (n-1)/n Convolutional Codes},
year={1998},
volume={E81-A},
number={3},
pages={510-513},
abstract={The structure of bidirectional syndrome decoding for binary rate (n-1)/n convolutional codes is investigated. It is shown that for backward decoding based on the trellis of a syndrome former H^T, the syndrome sequence must be generated in time-reversed order using an extra syndrome former H^*T, where H^* is a generator matrix of the reciprocal dual code of the original code. It is also shown that if the syndrome bits are generated once and only once using H^T and H^*T, then the corresponding two error sequences have the intersection of n error symbols, where is the memory length of H^T.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Bidirectional Syndrome Decoding for Binary Rate (n-1)/n Convolutional Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 510
EP - 513
AU - Masato TAJIMA
AU - Keiji TAKIDA
AU - Zenshiro KAWASAKI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1998
AB - The structure of bidirectional syndrome decoding for binary rate (n-1)/n convolutional codes is investigated. It is shown that for backward decoding based on the trellis of a syndrome former H^T, the syndrome sequence must be generated in time-reversed order using an extra syndrome former H^*T, where H^* is a generator matrix of the reciprocal dual code of the original code. It is also shown that if the syndrome bits are generated once and only once using H^T and H^*T, then the corresponding two error sequences have the intersection of n error symbols, where is the memory length of H^T.
ER -