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
Esta carta apresenta uma condição necessária e suficiente para uma classe de códigos quase cíclicos de verificação de paridade de baixa densidade (QC LDPC) sem circunferência quatro. A propriedade circunferência quatro de uma classe de códigos LDPC de QC é investigada. Bons códigos QC LDPC sem circunferência quatro podem ser construídos selecionando fatores de mudança adequados de acordo com os teoremas propostos. Exemplos são fornecidos para verificar os teoremas. Os resultados da simulação mostram que os códigos LDPC QC sem circunferência quatro alcançam um melhor desempenho de BER em comparação com os códigos LDPC construídos aleatoriamente.
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
Ying ZHAO, Yang XIAO, "The Necessary and Sufficient Condition of a Class of Quasi-Cyclic LDPC Codes without Girth Four" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 1, pp. 306-309, January 2009, doi: 10.1587/transcom.E92.B.306.
Abstract: This letter presents a necessary and sufficient condition for a class of quasi-cyclic low-density parity-check (QC LDPC) codes without girth four. Girth-four property of a class of QC LDPC codes is investigated. Good QC LDPC codes without girth four can be constructed by selecting proper shifting factors according to the proposed theorems. Examples are provided to verify the theorems. The simulation results show that the QC LDPC codes without girth four achieve a better BER performance compared with that of randomly constructed LDPC codes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.306/_p
Copiar
@ARTICLE{e92-b_1_306,
author={Ying ZHAO, Yang XIAO, },
journal={IEICE TRANSACTIONS on Communications},
title={The Necessary and Sufficient Condition of a Class of Quasi-Cyclic LDPC Codes without Girth Four},
year={2009},
volume={E92-B},
number={1},
pages={306-309},
abstract={This letter presents a necessary and sufficient condition for a class of quasi-cyclic low-density parity-check (QC LDPC) codes without girth four. Girth-four property of a class of QC LDPC codes is investigated. Good QC LDPC codes without girth four can be constructed by selecting proper shifting factors according to the proposed theorems. Examples are provided to verify the theorems. The simulation results show that the QC LDPC codes without girth four achieve a better BER performance compared with that of randomly constructed LDPC codes.},
keywords={},
doi={10.1587/transcom.E92.B.306},
ISSN={1745-1345},
month={January},}
Copiar
TY - JOUR
TI - The Necessary and Sufficient Condition of a Class of Quasi-Cyclic LDPC Codes without Girth Four
T2 - IEICE TRANSACTIONS on Communications
SP - 306
EP - 309
AU - Ying ZHAO
AU - Yang XIAO
PY - 2009
DO - 10.1587/transcom.E92.B.306
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2009
AB - This letter presents a necessary and sufficient condition for a class of quasi-cyclic low-density parity-check (QC LDPC) codes without girth four. Girth-four property of a class of QC LDPC codes is investigated. Good QC LDPC codes without girth four can be constructed by selecting proper shifting factors according to the proposed theorems. Examples are provided to verify the theorems. The simulation results show that the QC LDPC codes without girth four achieve a better BER performance compared with that of randomly constructed LDPC codes.
ER -