Generalized Performance Upper Bounds for Terminated Convolutional Codes

Hichan MOON; Donald C. COX

doi:10.1093/ietcom/e90-b.6.1360

Generalized Performance Upper Bounds for Terminated Convolutional Codes

Hichan MOON, Donald C. COX

Full Text Views

0

Share
Cite this

Summary :

In this paper, we propose tight performance upper bounds for convolutional codes terminated with an input sequence of finite length. To obtain the upper bounds, a generalized weight enumerator of single error event is defined to represent the relation between the Hamming distance of the coded output and the Hamming distance of the selected input bits of a terminated convolutional code. In the generalized weight enumerator of single error event, codewords composed of multiple error events are not counted to provide tighter performance upper bounds. The upper bounds on frame error rate (FER) and average bit error rate (BER) of selected bits are computed from the generalized weight enumerators of single error event. A simple method is presented to compute the weight enumerator of a terminated convolutional code based on a modified trellis diagram.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.6 pp.1360-1366

Publication Date: 2007/06/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.6.1360

Type of Manuscript: PAPER

Category: Fundamental Theories for Communications

Cite this

Copy

Hichan MOON, Donald C. COX, "Generalized Performance Upper Bounds for Terminated Convolutional Codes" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 6, pp. 1360-1366, June 2007, doi: 10.1093/ietcom/e90-b.6.1360.
Abstract: In this paper, we propose tight performance upper bounds for convolutional codes terminated with an input sequence of finite length. To obtain the upper bounds, a generalized weight enumerator of single error event is defined to represent the relation between the Hamming distance of the coded output and the Hamming distance of the selected input bits of a terminated convolutional code. In the generalized weight enumerator of single error event, codewords composed of multiple error events are not counted to provide tighter performance upper bounds. The upper bounds on frame error rate (FER) and average bit error rate (BER) of selected bits are computed from the generalized weight enumerators of single error event. A simple method is presented to compute the weight enumerator of a terminated convolutional code based on a modified trellis diagram.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.6.1360/_p

Copy

@ARTICLE{e90-b_6_1360,
author={Hichan MOON, Donald C. COX, },
journal={IEICE TRANSACTIONS on Communications},
title={Generalized Performance Upper Bounds for Terminated Convolutional Codes},
year={2007},
volume={E90-B},
number={6},
pages={1360-1366},
abstract={In this paper, we propose tight performance upper bounds for convolutional codes terminated with an input sequence of finite length. To obtain the upper bounds, a generalized weight enumerator of single error event is defined to represent the relation between the Hamming distance of the coded output and the Hamming distance of the selected input bits of a terminated convolutional code. In the generalized weight enumerator of single error event, codewords composed of multiple error events are not counted to provide tighter performance upper bounds. The upper bounds on frame error rate (FER) and average bit error rate (BER) of selected bits are computed from the generalized weight enumerators of single error event. A simple method is presented to compute the weight enumerator of a terminated convolutional code based on a modified trellis diagram.},
keywords={},
doi={10.1093/ietcom/e90-b.6.1360},
ISSN={1745-1345},
month={June},}

Copy

TY - JOUR
TI - Generalized Performance Upper Bounds for Terminated Convolutional Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 1360
EP - 1366
AU - Hichan MOON
AU - Donald C. COX
PY - 2007
DO - 10.1093/ietcom/e90-b.6.1360
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2007
AB - In this paper, we propose tight performance upper bounds for convolutional codes terminated with an input sequence of finite length. To obtain the upper bounds, a generalized weight enumerator of single error event is defined to represent the relation between the Hamming distance of the coded output and the Hamming distance of the selected input bits of a terminated convolutional code. In the generalized weight enumerator of single error event, codewords composed of multiple error events are not counted to provide tighter performance upper bounds. The upper bounds on frame error rate (FER) and average bit error rate (BER) of selected bits are computed from the generalized weight enumerators of single error event. A simple method is presented to compute the weight enumerator of a terminated convolutional code based on a modified trellis diagram.
ER -