INSPEC Accession Number:8584465 DOI: 10.1109/TCOMM.2005.855019The iterative decoding structure and component maximum a posteriori decoders used for decoding binary concatenated codes can be extended to the nonbinary domain. This paper considers turbo codes over nonbinary rings, specifically ternary, quaternary, penternary, hexernary, and octernary codes. The best rate-1/2 component codes are determined using a practical search algorithm. The performance of the resulting rate-1/3 turbo codes on an additive white Gaussian noise channel using q-ary phase-shift keying modulation is given
International audienceThe original turbo codes (TCs), presented in 1993 by Berrou et al., consist of...
In this article, we present two versions of a simplifled maximum a posteriori decoding algorithm. Th...
Turbo-codes have attracted an explosion of interest since their discovery in 1993: for the first tim...
International audienceNon-binary turbo codes are built from recursive systematic convolutional (RSC)...
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convo...
This thesis is about non-binary convolutional turbo codes--codes constructed via parallel concatenat...
The introduction of turbo codes in 1993 provided a code structure that could approach Shannon limit ...
Présentation invitéeInternational audience4th and 5th generations of mobile communications systems a...
Abstract – This paper presents a new family of turbo codes whose the constituent codes have R≥1 non-...
In this letter, a turbo product code (TPC) is combined with multilevel modulations (8-phase-shift ke...
A serial concatenation of an outer non-binary turbo code with different inner binary codes is introd...
This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decode...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Binary asymmetric turbo codes an...
Abstract: In this paper the particularities of the interleavers used in the case of the Recursive Sy...
Abstract—The original turbo codes (TCs), presented in 1993 by Berrou et al., consist of the parallel...
International audienceThe original turbo codes (TCs), presented in 1993 by Berrou et al., consist of...
In this article, we present two versions of a simplifled maximum a posteriori decoding algorithm. Th...
Turbo-codes have attracted an explosion of interest since their discovery in 1993: for the first tim...
International audienceNon-binary turbo codes are built from recursive systematic convolutional (RSC)...
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convo...
This thesis is about non-binary convolutional turbo codes--codes constructed via parallel concatenat...
The introduction of turbo codes in 1993 provided a code structure that could approach Shannon limit ...
Présentation invitéeInternational audience4th and 5th generations of mobile communications systems a...
Abstract – This paper presents a new family of turbo codes whose the constituent codes have R≥1 non-...
In this letter, a turbo product code (TPC) is combined with multilevel modulations (8-phase-shift ke...
A serial concatenation of an outer non-binary turbo code with different inner binary codes is introd...
This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decode...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Binary asymmetric turbo codes an...
Abstract: In this paper the particularities of the interleavers used in the case of the Recursive Sy...
Abstract—The original turbo codes (TCs), presented in 1993 by Berrou et al., consist of the parallel...
International audienceThe original turbo codes (TCs), presented in 1993 by Berrou et al., consist of...
In this article, we present two versions of a simplifled maximum a posteriori decoding algorithm. Th...
Turbo-codes have attracted an explosion of interest since their discovery in 1993: for the first tim...