Turbo codes with rate-m/(m+ 1) constituent convolutional codes
C Douillard, C Berrou - IEEE transactions on communications, 2005 - ieeexplore.ieee.org
The original turbo codes (TCs), presented in 1993 by Berrou et al., consist of the parallel
concatenation of two rate-1/2 binary recursive systematic convolutional (RSC) codes. This …
concatenation of two rate-1/2 binary recursive systematic convolutional (RSC) codes. This …
Channel Coding Towards 6G: Technical Overview and Outlook
Channel coding plays a pivotal role in ensuring reliable communication over wireless
channels. With the growing need for ultra-reliable communication in emerging wireless use …
channels. With the growing need for ultra-reliable communication in emerging wireless use …
[图书][B] Codes et turbocodes
C Berrou - 2010 - Springer
L'invention des turbocodes au début des années 90 a véritablement bouleversé le champ
du codage correcteur d'erreur. Des codes relativement simples à construire et à décoder …
du codage correcteur d'erreur. Des codes relativement simples à construire et à décoder …
On the computing of the minimum distance of linear block codes by heuristic methods
The evaluation of the minimum distance of linear block codes remains an open problem in
coding theory, and it is not easy to determine its true value by classical methods, for this …
coding theory, and it is not easy to determine its true value by classical methods, for this …
Optimum distance quadratic permutation polynomial-based interleavers for turbo codes
E Rosnes, OY Takeshita - 2006 IEEE International Symposium …, 2006 - ieeexplore.ieee.org
An interleaver is a critical component for the channel coding performance of turbo codes.
Algebraic constructions are of particular interest because they admit analytical designs and …
Algebraic constructions are of particular interest because they admit analytical designs and …
Estimating the minimum distance of turbo-codes using double and triple impulse methods
S Crozier, P Guinand, A Hunt - IEEE Communications Letters, 2005 - ieeexplore.ieee.org
A long-standing problem for turbo-codes has been the efficient and accurate determination
of the distance spectrum, or even just the minimum distance, for specific interleavers. This …
of the distance spectrum, or even just the minimum distance, for specific interleavers. This …
Improved method for searching interleavers from a certain set using Garello's method with applications for the LTE standard
L Trifina, D Tarniceriu - annals of telecommunications-annales des …, 2014 - Springer
In this paper, we propose a method for searching interleavers within a certain class, with the
aim of designing turbo codes with good distance spectrum. The method is based on a …
aim of designing turbo codes with good distance spectrum. The method is based on a …
Turbo decoding on the binary erasure channel: Finite-length analysis and turbo stopping sets
This paper is devoted to the finite-length analysis of turbo decoding over the binary erasure
channel (BEC). The performance of iterative belief-propagation decoding of low-density …
channel (BEC). The performance of iterative belief-propagation decoding of low-density …
[PDF][PDF] Comparison of distance measurement methods for turbo codes
Y Ould-Cheikh-Mouhamedou, S Crozier… - … of Canadian Workshop …, 2005 - ece.mcgill.ca
Reliable distance measurement methods for turbo codes are a key element in the design of
interleavers with high minimum distances, which are essential for lowering the flare effect at …
interleavers with high minimum distances, which are essential for lowering the flare effect at …
Interleaver optimization of convolutional turbo code for 802.16 systems
SJ Park, JH Jeon - IEEE communications letters, 2009 - ieeexplore.ieee.org
Convolutional turbo code (CTC) has been adopted as an optional channel coding scheme
for wireless metropolitan area networks (WMAN) and digital video broadcasting (DVB) …
for wireless metropolitan area networks (WMAN) and digital video broadcasting (DVB) …