AbstractIn this paper, a general matrix structure for shortened turbo product codes (TPC) and an improved decoding algorithm based on Chase decoder are presented. In the proposed algorithm, the decoding complexity is decreased by reducing the number of candidate codewords and, an efficient method to estimate the extrinsic information without competing codeword is designed, too. Compared with the conventional algorithm, simulation results show that considerable coding gains can be obtained by the proposed decoding algorithm with decreasing decoding complexity
This paper proposes encoding and decoding for nonlinear turbo product codes and investigates the per...
International audienceIn this paper, we propose a set of design criteria of constructing shortened t...
Absract- A new iterative decoding algorithm for product codes (block) based on soft decoding and sof...
AbstractIn this paper, a general matrix structure for shortened turbo product codes (TPC) and an imp...
Two soft-input-soft-output iterative decoding algorithms for product code were studied and developed...
Block turbo codes (BTCs) under iterative decoding are product codes showing excellent performance wi...
Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (...
In this letter, we study turbo product codes with quadratic residue codes (called QR-TPCs) as the co...
For effective communication to take place between a source and a destination the emphasis lies on th...
Block turbo codes (BTCs) are constructed by serially concatenating linear block codes and iterativel...
Product codes have large minimum Hamming distance and their complexity might be compared with Tu...
Abstract—This paper introduces the Modified Adaptive Belief Propagation (m-ABP) algorithm, an innova...
Turbo coding is one of the best channel coding procedures presented to the coding community in the r...
International audienceThe Adaptive Belief Propagation (ABP) algorithm was recently proposed by Jiang...
International audienceIn turbo decoding of product codes, we propose an algorithm implementation, ba...
This paper proposes encoding and decoding for nonlinear turbo product codes and investigates the per...
International audienceIn this paper, we propose a set of design criteria of constructing shortened t...
Absract- A new iterative decoding algorithm for product codes (block) based on soft decoding and sof...
AbstractIn this paper, a general matrix structure for shortened turbo product codes (TPC) and an imp...
Two soft-input-soft-output iterative decoding algorithms for product code were studied and developed...
Block turbo codes (BTCs) under iterative decoding are product codes showing excellent performance wi...
Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (...
In this letter, we study turbo product codes with quadratic residue codes (called QR-TPCs) as the co...
For effective communication to take place between a source and a destination the emphasis lies on th...
Block turbo codes (BTCs) are constructed by serially concatenating linear block codes and iterativel...
Product codes have large minimum Hamming distance and their complexity might be compared with Tu...
Abstract—This paper introduces the Modified Adaptive Belief Propagation (m-ABP) algorithm, an innova...
Turbo coding is one of the best channel coding procedures presented to the coding community in the r...
International audienceThe Adaptive Belief Propagation (ABP) algorithm was recently proposed by Jiang...
International audienceIn turbo decoding of product codes, we propose an algorithm implementation, ba...
This paper proposes encoding and decoding for nonlinear turbo product codes and investigates the per...
International audienceIn this paper, we propose a set of design criteria of constructing shortened t...
Absract- A new iterative decoding algorithm for product codes (block) based on soft decoding and sof...