Braided Convolutional Codes With Sliding Window Decoding
نویسندگان
چکیده
منابع مشابه
Combating Error Propagation in Window Decoding of Braided Convolutional Codes
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 c...
متن کاملSkip-Sliding Window Codes
Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window. A skip-sliding window (SSW) code is defined in terms of the length L of a sliding window, skip length J , and cost constraint E in each sliding window. Each valid codeword of length L+kJ is determined by k+1 windows of le...
متن کاملSliding-window dynamic frameproof codes
A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper we formally define sliding-window dynamic frameproof codes and provide optimal constructions for a certain class of these schemes. We also discuss bounds on the number of users such schemes
متن کاملHeuristic decoding of convolutional codes
The Viterbi decoding algorithm for convolutional codes presented in 1967 ([1]) offers a good basis for the conception of a hard-wired decoder designed as a system consisting of a great number of very simple processing units (capable of adding and comparing) with a common memory of sufficient size. The software implementa tion of this algorithm using a universal monoprocessor system seems to be...
متن کاملSequential Decoding of Convolutional Codes
This article surveys many variants of sequential decoding in literature. Rather than introducing them chronologically, this article first presents the Algorithm A, a general sequential search algorithm. The stack algorithm and the Fano algorithm are then described in details. Next, trellis variants of sequential decoding, including the recently proposed maximum-likelihood sequential decoding al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2017
ISSN: 0090-6778
DOI: 10.1109/tcomm.2017.2707073