DeepAI AI Chat
Log In Sign Up

Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes

by   Anastasia Kurmukova, et al.
Higher School of Economics
Institute for Problems of Information Transmission

In this paper, we provide a new approach to the analytical estimation of the bit-error rate (BER) for convolutional codes for Viterbi decoding in the binary symmetric channel (BSC). The expressions we obtained for lower and upper BER bounds are based on the active distances of the code and their distance spectrum. The estimates are derived for convolutional codes with the rate R=1/2 but can be easily generalized for any convolutional code with rate R=1/n and systematic encoder. The suggested approach is not computationally expensive for any crossover probability of BSC channel and convolutional code memory, and it allows to obtain precise estimates of BER.


page 1

page 2

page 3

page 4


On Systematic Polarization-Adjusted Convolutional (PAC) Codes

Polarization-adjusted convolutional (PAC) codes were recently proposed a...

Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes

Recently, the authors showed that Reed-Muller (RM) codes achieve capacit...

Error-rate in Viterbi decoding of a duobinary signal in presence of noise and distortions: theory and simulation

The Viterbi algorithm, presented in 1967, allows a maximum likelihood de...

Probabilistic Value-Deviation-Bounded Integer Codes for Approximate Communication

When computing systems can tolerate the effects of errors or erasures in...

CRC-Aided Short Convolutional Codes and RCU Bounds for Orthogonal Signaling

We extend earlier work on the design of convolutional code-specific CRC ...

`local' vs. `global' parameters -- breaking the gaussian complexity barrier

We show that if F is a convex class of functions that is L-subgaussian, ...

Low density majority codes and the problem of graceful degradation

We study a problem of constructing codes that transform a channel with h...