The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Os códigos LDPC quase cíclicos (QC-LDPC) que consistem em matrizes de permutação circulante (CPM-QC-LDPC) são um dos tipos mais atraentes de códigos LDPC devido às suas muitas vantagens. Neste artigo, fazemos pesquisas principalmente sobre códigos CPM-QC-LDPC. Primeiro propomos um esquema de decodificação de dois estágios baseado principalmente na transformação da matriz de verificação de paridade (MT), que pode melhorar eficientemente o desempenho da taxa de erro de bit. Para otimizar a compensação entre a complexidade da implementação de hardware e o desempenho da decodificação, é apresentado um método aprimorado que combina nosso esquema MT proposto com o esquema de decodificação CPM-RID existente. Um experimento mostra que ambos os esquemas podem melhorar o desempenho da taxa de erro de bit (BER). Finalmente, mostramos que o mecanismo de decodificação MT pode ser aplicado a outros tipos de códigos LDPC. Aplicamos o esquema MT a códigos LDPC aleatórios e mostramos que ele pode reduzir com eficiência o piso de erro.
Zuohong XU
National University of Defense and Technology
Jiang ZHU
National University of Defense and Technology
Qian CHENG
National University of Defense and Technology
Zixuan ZHANG
National University of Defense and Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Zuohong XU, Jiang ZHU, Qian CHENG, Zixuan ZHANG, "An Iterative Decoding Scheme for CPM-QC-LDPC Codes Based on Matrix Transform" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 3, pp. 496-509, March 2019, doi: 10.1587/transcom.2018EBP3177.
Abstract: Quasi cyclic LDPC (QC-LDPC) codes consisting of circulant permutation matrices (CPM-QC-LDPC) are one of the most attractive types of LDPC codes due to their many advantages. In this paper, we mainly do some research on CPM-QC-LDPC codes. We first propose a two-stage decoding scheme mainly based on parity check matrix transform (MT), which can efficiently improve the bit error rate performance. To optimize the tradeoff between hardware implementation complexity and decoding performance, an improved method that combines our proposed MT scheme with the existing CPM-RID decoding scheme is presented. An experiment shows that both schemes can improve the bit error rate (BER) performance. Finally, we show that the MT decoding mechanism can be applied to other types of LDPC codes. We apply the MT scheme to random LDPC codes and show that it can efficiently lower the error floor.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3177/_p
Copiar
@ARTICLE{e102-b_3_496,
author={Zuohong XU, Jiang ZHU, Qian CHENG, Zixuan ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={An Iterative Decoding Scheme for CPM-QC-LDPC Codes Based on Matrix Transform},
year={2019},
volume={E102-B},
number={3},
pages={496-509},
abstract={Quasi cyclic LDPC (QC-LDPC) codes consisting of circulant permutation matrices (CPM-QC-LDPC) are one of the most attractive types of LDPC codes due to their many advantages. In this paper, we mainly do some research on CPM-QC-LDPC codes. We first propose a two-stage decoding scheme mainly based on parity check matrix transform (MT), which can efficiently improve the bit error rate performance. To optimize the tradeoff between hardware implementation complexity and decoding performance, an improved method that combines our proposed MT scheme with the existing CPM-RID decoding scheme is presented. An experiment shows that both schemes can improve the bit error rate (BER) performance. Finally, we show that the MT decoding mechanism can be applied to other types of LDPC codes. We apply the MT scheme to random LDPC codes and show that it can efficiently lower the error floor.},
keywords={},
doi={10.1587/transcom.2018EBP3177},
ISSN={1745-1345},
month={March},}
Copiar
TY - JOUR
TI - An Iterative Decoding Scheme for CPM-QC-LDPC Codes Based on Matrix Transform
T2 - IEICE TRANSACTIONS on Communications
SP - 496
EP - 509
AU - Zuohong XU
AU - Jiang ZHU
AU - Qian CHENG
AU - Zixuan ZHANG
PY - 2019
DO - 10.1587/transcom.2018EBP3177
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2019
AB - Quasi cyclic LDPC (QC-LDPC) codes consisting of circulant permutation matrices (CPM-QC-LDPC) are one of the most attractive types of LDPC codes due to their many advantages. In this paper, we mainly do some research on CPM-QC-LDPC codes. We first propose a two-stage decoding scheme mainly based on parity check matrix transform (MT), which can efficiently improve the bit error rate performance. To optimize the tradeoff between hardware implementation complexity and decoding performance, an improved method that combines our proposed MT scheme with the existing CPM-RID decoding scheme is presented. An experiment shows that both schemes can improve the bit error rate (BER) performance. Finally, we show that the MT decoding mechanism can be applied to other types of LDPC codes. We apply the MT scheme to random LDPC codes and show that it can efficiently lower the error floor.
ER -