Several parallel concatenated coding schemes (turbo codes) based on multimemory (MM) convolutional codes (more specifically, a (2,1,4,7) code) were proposed to achieve near Shannon-limit error correction performance with reasonable decoding complexity. On the other hand, in many cases of interest, unit-memory (UM) codes have been demonstrated to have larger free distances than the MM codes with the same rate and the same number of memory elements. New turbo codes based on the (8, 4, 3, 8) UM Hamming code are developed and shown to possess better performance potential in some senses. The standard turbo decoding algorithms, however, do not appear to achieve this potential
this paper, new turbo codes based on the (8; 4; 3; 8) UM Hamming code [5] will be developed and show...
In this letter we propose rate variable turbo codes based on the parallel concatenation of tailbiti...
The aim of this paper is to describe in detail the iterative decoding algorithm used during the impl...
The following topics were dealt with: Shannon theory; universal lossless source coding; CDMA; turbo ...
In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The desi...
The Shannon capacity limit can be reached by less than 0.27 dB at a BER of 10 \Gamma5 by applying ...
Turbo codes can deliver performance that is very close to the Shannon limit. This report investigate...
In this paper we propose a model for the generation of error patterns at the output of a turbo decod...
ABSTRACT ?%e goal of this paper is to describe the main ideas behind the new class of codes called t...
NASA Lewis Research Center s Communications Technology Division has an ongoing program in the develo...
A large number of papers have been published attempting to give some analytical basis for the perfor...
Turbo codes have been widely studied since they were first proposed in 1993 by Berrou, Glavieux, and...
The performance of turbo codes at the error floor region is largely determined by the effective free...
The encoding, decoding and performance analysis of concatenated partial unit memory (PUM) code struc...
In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-err...
this paper, new turbo codes based on the (8; 4; 3; 8) UM Hamming code [5] will be developed and show...
In this letter we propose rate variable turbo codes based on the parallel concatenation of tailbiti...
The aim of this paper is to describe in detail the iterative decoding algorithm used during the impl...
The following topics were dealt with: Shannon theory; universal lossless source coding; CDMA; turbo ...
In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The desi...
The Shannon capacity limit can be reached by less than 0.27 dB at a BER of 10 \Gamma5 by applying ...
Turbo codes can deliver performance that is very close to the Shannon limit. This report investigate...
In this paper we propose a model for the generation of error patterns at the output of a turbo decod...
ABSTRACT ?%e goal of this paper is to describe the main ideas behind the new class of codes called t...
NASA Lewis Research Center s Communications Technology Division has an ongoing program in the develo...
A large number of papers have been published attempting to give some analytical basis for the perfor...
Turbo codes have been widely studied since they were first proposed in 1993 by Berrou, Glavieux, and...
The performance of turbo codes at the error floor region is largely determined by the effective free...
The encoding, decoding and performance analysis of concatenated partial unit memory (PUM) code struc...
In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-err...
this paper, new turbo codes based on the (8; 4; 3; 8) UM Hamming code [5] will be developed and show...
In this letter we propose rate variable turbo codes based on the parallel concatenation of tailbiti...
The aim of this paper is to describe in detail the iterative decoding algorithm used during the impl...