In this letter, we study turbo product codes with quadratic residue codes (called QR-TPCs) as the component codes. We propose an efficient decoder based on Chase-II algorithm with two convergence conditions for the iterative decoding of QR-TPCs. For each row and column, the Chase-II decoder will stop immediately when one of the conditions is met. The simulation results show that the proposed algorithm has a lower computational complexity compared with existing decoding methods. Moreover, a comparison with 5G low-density parity-check codes shows that the proposed turbo product codes have better performance for short code lengths
This paper presents a comparative performance and complexity study between low-density parity-check ...
Includes bibliographical references (p. 39)Linear block codes are used in modern communication and d...
Product codes have large minimum Hamming distance and their complexity might be compared with Tu...
AbstractIn this paper, a general matrix structure for shortened turbo product codes (TPC) and an imp...
Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (...
Block turbo codes (BTCs) under iterative decoding are product codes showing excellent performance wi...
Two soft-input-soft-output iterative decoding algorithms for product code were studied and developed...
International audienceIn a recent article, Yi et al. proposed an algorithm for the decoding of binar...
Block turbo codes (BTCs) are constructed by serially concatenating linear block codes and iterativel...
Residue (QR) codes are presented. The key ideas behind this decoding technique are based on one-to-o...
International audienceIn turbo decoding of product codes, we propose an algorithm implementation, ba...
In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadr...
Abstract—Recently, a novel decoding procedure which is called the syndrome-weight determination for ...
Iteratively decoded block turbo codes are product codes that exhibit excellent performance with reas...
This paper proposes encoding and decoding for nonlinear turbo product codes and investigates the per...
This paper presents a comparative performance and complexity study between low-density parity-check ...
Includes bibliographical references (p. 39)Linear block codes are used in modern communication and d...
Product codes have large minimum Hamming distance and their complexity might be compared with Tu...
AbstractIn this paper, a general matrix structure for shortened turbo product codes (TPC) and an imp...
Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (...
Block turbo codes (BTCs) under iterative decoding are product codes showing excellent performance wi...
Two soft-input-soft-output iterative decoding algorithms for product code were studied and developed...
International audienceIn a recent article, Yi et al. proposed an algorithm for the decoding of binar...
Block turbo codes (BTCs) are constructed by serially concatenating linear block codes and iterativel...
Residue (QR) codes are presented. The key ideas behind this decoding technique are based on one-to-o...
International audienceIn turbo decoding of product codes, we propose an algorithm implementation, ba...
In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadr...
Abstract—Recently, a novel decoding procedure which is called the syndrome-weight determination for ...
Iteratively decoded block turbo codes are product codes that exhibit excellent performance with reas...
This paper proposes encoding and decoding for nonlinear turbo product codes and investigates the per...
This paper presents a comparative performance and complexity study between low-density parity-check ...
Includes bibliographical references (p. 39)Linear block codes are used in modern communication and d...
Product codes have large minimum Hamming distance and their complexity might be compared with Tu...