pith. sign in

arxiv: 1801.03235 · v1 · pith:32VDQAZ2new · submitted 2018-01-10 · 💻 cs.IT · math.IT

Combating Error Propagation in Window Decoding of Braided Convolutional Codes

classification 💻 cs.IT math.IT
keywords errorwindowcomplexitypropagationalgorithmbccsbraidedcodes
0
0 comments X p. Extension
pith:32VDQAZ2 Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{32VDQAZ2}

Prints a linked pith:32VDQAZ2 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

In this paper, we study sliding window decoding of braided convolutional codes (BCCs) in the context of a streaming application, where decoder error propagation can be a serious problem. A window extension algorithm and a resynchronization mechanism are introduced to mitigate the effect of error propagation. In addition, we introduce a soft bit-error-rate stopping rule to reduce computational complexity, and the tradeoff between performance and complexity is examined. Simulation results show that, using the proposed window extension algorithm and resynchronization mechanism, the error performance of BCCs can be improved by up to three orders of magnitude with reduced computational complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.