BOUNDS AND APPROXIMATIONS FOR THE BIT ERROR-PROBABILITY OF CONVOLUTIONAL-CODES

A G Burr

BOUNDS AND APPROXIMATIONS FOR THE BIT ERROR-PROBABILITY OF CONVOLUTIONAL-CODES

Electronic Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

The bit error probability P(b) of convolutional codes decoded using the Viterbi algorithm using both soft and hard decision techniques is considered. Approximations to the additive or union upper bound on P(b) which also form good approximations to P(b) at values up to 10(-2) or higher are presented. Tables are given for the best codes listed for constraint lengths between 3 and 7 and rates 1/2 and 1/3.

Original language	English
Pages (from-to)	1287-1288
Number of pages	2
Journal	Electronics Letters
Volume	29
Issue number	14
Publication status	Published - 8 Jul 1993

Keywords

CONVOLUTIONAL CODES
VITERBI CODING
BIT ERROR RATE

Cite this

@article{c77d7ff429e344baa85b55383c059c2f,

title = "BOUNDS AND APPROXIMATIONS FOR THE BIT ERROR-PROBABILITY OF CONVOLUTIONAL-CODES",

abstract = "The bit error probability P(b) of convolutional codes decoded using the Viterbi algorithm using both soft and hard decision techniques is considered. Approximations to the additive or union upper bound on P(b) which also form good approximations to P(b) at values up to 10(-2) or higher are presented. Tables are given for the best codes listed for constraint lengths between 3 and 7 and rates 1/2 and 1/3.",

keywords = "CONVOLUTIONAL CODES, VITERBI CODING, BIT ERROR RATE",

author = "Burr, {A G}",

year = "1993",

month = jul,

day = "8",

language = "English",

volume = "29",

pages = "1287--1288",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "Institution of Engineering and Technology",

number = "14",

}

TY - JOUR

T1 - BOUNDS AND APPROXIMATIONS FOR THE BIT ERROR-PROBABILITY OF CONVOLUTIONAL-CODES

AU - Burr, A G

PY - 1993/7/8

Y1 - 1993/7/8

N2 - The bit error probability P(b) of convolutional codes decoded using the Viterbi algorithm using both soft and hard decision techniques is considered. Approximations to the additive or union upper bound on P(b) which also form good approximations to P(b) at values up to 10(-2) or higher are presented. Tables are given for the best codes listed for constraint lengths between 3 and 7 and rates 1/2 and 1/3.

AB - The bit error probability P(b) of convolutional codes decoded using the Viterbi algorithm using both soft and hard decision techniques is considered. Approximations to the additive or union upper bound on P(b) which also form good approximations to P(b) at values up to 10(-2) or higher are presented. Tables are given for the best codes listed for constraint lengths between 3 and 7 and rates 1/2 and 1/3.

KW - CONVOLUTIONAL CODES

KW - VITERBI CODING

KW - BIT ERROR RATE

M3 - Article

SN - 0013-5194

VL - 29

SP - 1287

EP - 1288

JO - Electronics Letters

JF - Electronics Letters

IS - 14

ER -