International audienceIn this paper, we propose a set of design criteria of constructing shortened turbo product codes. Based on the criteria, we design two families of rate-compatible turbo product codes. The performance of rate-compatible turbo product codes is evaluated on the Gaussian channels using Monte Carlo simulations. We also propose a modified Gallager bounding technique to the rate-compatible turbo product codes. We show that the performance bound has a good match with the simulation result
The most powerful channel-coding schemes, namely, those based on turbo codes and low-density parity-...
In this paper, we study product codes based on extended Hamming codes. We focus on their performance...
Recently, several groups have increased the coding gain of iteratively decoded Gallager codes (low d...
We propose and compare some design criteria for the search of good systematic rate-compatible punctu...
We propose and compare some design criteria for the search of good systematic rate-compatible punctu...
In this letter, we propose and compare some design criteria for the search of good rate-compatible s...
AbstractIn this paper, a general matrix structure for shortened turbo product codes (TPC) and an imp...
This paper presents a comparative performance and complexity study between low-density parity-check ...
Turbo codes can deliver performance that is very close to the Shannon limit. This report investigate...
In this paper, we study a class of spatially coupled turbo codes, namely partially information- and ...
Turbo codes are one of error correction coding where the errors which may be added into the transmis...
The purpose of this study is to construct a near capacity Irregular-Turbo Code (I-TC) and to evaluat...
Low rate codes can be used to achieve coding gain in spread spectrum applications such as direct-seq...
Two soft-input-soft-output iterative decoding algorithms for product code were studied and developed...
Abstract—This letter is concerned with a family of modified turbo-type codes, referred to as turbo-S...
The most powerful channel-coding schemes, namely, those based on turbo codes and low-density parity-...
In this paper, we study product codes based on extended Hamming codes. We focus on their performance...
Recently, several groups have increased the coding gain of iteratively decoded Gallager codes (low d...
We propose and compare some design criteria for the search of good systematic rate-compatible punctu...
We propose and compare some design criteria for the search of good systematic rate-compatible punctu...
In this letter, we propose and compare some design criteria for the search of good rate-compatible s...
AbstractIn this paper, a general matrix structure for shortened turbo product codes (TPC) and an imp...
This paper presents a comparative performance and complexity study between low-density parity-check ...
Turbo codes can deliver performance that is very close to the Shannon limit. This report investigate...
In this paper, we study a class of spatially coupled turbo codes, namely partially information- and ...
Turbo codes are one of error correction coding where the errors which may be added into the transmis...
The purpose of this study is to construct a near capacity Irregular-Turbo Code (I-TC) and to evaluat...
Low rate codes can be used to achieve coding gain in spread spectrum applications such as direct-seq...
Two soft-input-soft-output iterative decoding algorithms for product code were studied and developed...
Abstract—This letter is concerned with a family of modified turbo-type codes, referred to as turbo-S...
The most powerful channel-coding schemes, namely, those based on turbo codes and low-density parity-...
In this paper, we study product codes based on extended Hamming codes. We focus on their performance...
Recently, several groups have increased the coding gain of iteratively decoded Gallager codes (low d...