The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Application-Level Forward Erasure Correction (AL-FEC) codes have become a key component of communication systems in order to recover from packet losses. This work analyzes the benefits of the AL-FEC codes based on a sliding encoding window (A.K.A. convolutional codes) for the reliable broadcast of real-time flows to a potentially large number of receivers over a constant bit rate channel. It first...
In this contribution, we present a coverage driven functional verification environment based on the UVM framework and the System Verilog language to certify the operational correctness of the ECC error management logic used in volatile and nonvolatile memories. We apply this methodology to floatinggate nonvolatile memories for the embedded market, which requires a read error rate of 10−14. The proposed...
Spatially coupled low-density parity-check (SC-LDPC) codes are often thought as codes with very long block lengths. However, they can be decoded through sliding window (SW) decoders achieving near-optimal performance when the window size is a few times larger than the code syndrome former constraint length. This makes SC-LDPC codes with short constraint length suitable for low-latency transmissions,...
The task of the definition of an a priori unknown Error Correcting code is one of the major tasks for governmental radio control authorities. In particular, the case of the choice of the most probable ECC from the predefined ECCs set. The SA-method (Syndromes analysis method) is suggested to solve the issue. This method is based on the sequences syndrome analysis. Here are given basic results, which...
We consider a joint source-channel decoding (JSCD) problem where the source encoder leaves residual redundancy in the source. We first model the redundancy in the source encoder output as the output of a side information channel at the channel decoder, and show that this improves random error exponent. Then, we consider the use of polar codes in this framework when the source redundancy is modeled...
Absorbing sets (ASs) are combinatorially defined objects existing in the Tanner graph of a low-density parity-check (LDPC) code that have been shown to cause failures in the iterative message-passing decoder when transmission occurs over the additive white Gaussian noise channel. In this paper, we propose an edge spreading approach to construct high rate array-based spatially-coupled LDPC codes by...
Spatially coupled codes have been shown to achieve the capacity for a large class of channels universally. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is determined by a very small number of parameters. More precisely, we consider and ensemble of time-invariant low-density parity-check convolutional codes with very large...
In this work, we adapt the notion of generalized Hamming weight of block codes to introduce the novel concept of generalized column distances for convolutional codes. This can be considered as an extension of the work done in [18] on the generalized Hamming weights for free distance of convolutional codes. We also introduce the concept of Almost-MDP and Near-MDP convolutional code. The problem of...
With a development of process technology, a memory density has been increased. However, a smaller feature size makes the memory susceptible to soft errors. For reliability enhancement, ECC with single bit error correction and double bit error detection is widely used. As multiple bit cell upset become dominant, there is a need for stronger ECC. ECC such as RS or BCH code requires significantly large...
Random Linear Network Coding (RLNC) is a popular coding scheme to improve communication over lossy channels. For packet streaming applications (video streaming, general IP streams), recent research has shown that sliding window schemes can improve in-order delay properties compared to the block/-generation based coding. However, implementing sliding window RLNC with a limited coding window poses new...
An application of convolutional codes is the burst error correcting, and the terminated Berlekamp-Preparata convolutional codes are the suboptimal phased burst error correcting codes. This paper presents a decoding method of tail-biting Berlekamp-Preparata convolutional codes that based on tail-biting technology, which can correct the final m block errors without m block termination check data within...
Spatially-coupled (SC) codes have recently attracted significant attention due to their capability to achieve capacity approaching performance. Significant recent research has been devoted to the asymptotic study of SC codes. Although the asymptotic analysis is relevant, it cannot be directly applied in the finite-length setting due to cycle-free and averaging assumptions. In this paper, we consider...
Cyclically-coupled quasi-cyclic LDPC (CC-QC-LDPC) block codes have been shown to achieve outstanding bit error performance with extremely low error floor. In this paper, we propose two new types of CC-QC-LDPC block codes which can achieve a larger girth. We present the error performance of the CC-QC-LDPC codes constructed by the new mechanism. We show that with similar codelengths, the new codes outperform...
In this paper, the performance study of OSMLD convolutional self orthogonal (CSOC) and OSMLD block codes over Gamma-Gamma ΓΓ atmospheric turbulence channel is studied. We analyse the efficiency of channel coding technique for different atmospheric turbulence conditions by modeling the channel with a Gamma-Gamma ΓΓ distribution and with BPSK modulation. The results obtained by Monte Carlo simulation...
This paper exposes a new decoder for linear bloc codes. The proposed decoder is based on the resolution of the parity equations system. Elsewhere, to reduce its complexity we have developed a criteria for early terminating the decoding, on the one hand. On the other hand, we introduced a fast method for generating test error patterns. Our decoder is suitable for linear bloc code of medium and high...
The compact genetic algorithm cGA is used in this paper to design an efficient soft-decision decoding algorithm, especially for the cyclic codes, because the cGA dramatically reduces the population's size and rapidly converges to the optimal solution compared to classical genetic algorithms. Our main contribution is to exploit the cyclic property of cyclic linear codes to reduce the complexity of...
In this paper, we study the block error rate (BLER) performance of spatially coupled low-density parity-check (SC-LDPC) codes using a sliding window decoder suited for streaming applications. Previous studies of SC-LDPC have focused on the bit error rate (BER) performance or the frame error rate (FER) performance over the entire length of the code. Here, we consider protograph-based constructions...
Hamming codes are the first nontrivial family of error-correcting codes that can correct one error in a block of binary symbols. In this paper we extend the notion of error-correction to error-reduction and present several decoding methods with the goal of improving the error-reducing capabilities of Hamming codes. First, the error-reducing properties of Hamming codes with standard decoding are demonstrated...
This paper deals with symbol-pair error channels. First, we generalize the channels to symbol-tuple error channels whose read length is D. Then, we derive a message passing algorithm for decoding LDPC codes over the generalized channels. Furthermore, we investigate the Hamming distance distributions of LDPC codes in terms of D symbol-tuple metric.
In this paper we consider a novel design of space-time block code combined with pre-coding module transmission system. Theory of orthogonal designs has shown that such code cannot be simultaneously orthogonal, of rate 1, with full diversity order, for more than 2 transmit antennas. We propose in this paper a new way to overcome this limitation by adding a pre-coding module before transmitting space-time...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.