On Upper Bounds for the Decoding Error Probability of Convolutional Codes

Authors:
M. V. Burnashev
Affiliations:
-
Venue:
Problems of Information Transmission
Year:
2001

Citing 3
Cited 0

Principles of Digital Communication and Coding

Principles of Digital Communication and Coding
Error Control Coding, Second Edition

Error Control Coding, Second Edition
On a technique to calculate the exact performance of a convolutional code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

A new approach to upper bounding the decoding error probability of convolutional codes is proposed. Its idea is, instead of evaluating the individual contribution of each fundamental path, to compare it with contribution of another (lighter) fundamental path. This allows us to (1) take into account the dependence between different fundamental paths based on the code tree structure; (2) represent the decoding error probability through the contribution of the first fundamental paths and a correction factor; (3) get much more accurate estimates.