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
Este artigo propõe métodos para melhorar o desempenho de decodificação de entrada e saída suave de códigos BCH por algoritmo de produto de soma (SPA). Um método para remover ciclos de comprimento quatro (RmFC) no grafo de Tanner foi proposto. No entanto, o RmFC não consegue obter um bom desempenho de decodificação para códigos BCH que possuem mais de uma capacidade de correção de erros. Para superar esse problema, este artigo propõe dois métodos. Uma é usar uma matriz de verificação de paridade da forma canônica escalonada como matriz de verificação inicial do RmFC. A outra é usar uma matriz de verificação de paridade que é a concatenação (ConC) de múltiplas matrizes de verificação de paridade. Para código BCH (31,11,11), SPA com ConC realiza Eb/No 3.7 dB melhor na taxa de erro de bit 10-5 que o SPA original e 3.1 dB melhor que o SPA com apenas RmFC.
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
Haruo OGIWARA, Kyouhei SHIMAMURA, Toshiyuki SHOHON, "Sum-Product Decoding of BCH Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 10, pp. 2729-2736, October 2008, doi: 10.1093/ietfec/e91-a.10.2729.
Abstract: This paper proposes methods to improve soft-input and soft-output decoding performance of BCH codes by sum-product algorithm (SPA). A method to remove cycles of length four (RmFC) in the Tanner graph has been proposed. However, the RmFC can not realize good decoding performance for BCH codes which have more than one error correcting capability. To overcome this problem, this paper proposes two methods. One is to use a parity check matrix of the echelon canonical form as the starting check matrix of RmFC. The other is to use a parity check matrix that is concatenation (ConC) of multiple parity check matrices. For BCH(31,11,11) code, SPA with ConC realizes Eb/No 3.7 dB better at bit error rate 10-5 than the original SPA, and 3.1 dB better than the SPA with only RmFC.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.10.2729/_p
Copiar
@ARTICLE{e91-a_10_2729,
author={Haruo OGIWARA, Kyouhei SHIMAMURA, Toshiyuki SHOHON, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sum-Product Decoding of BCH Codes},
year={2008},
volume={E91-A},
number={10},
pages={2729-2736},
abstract={This paper proposes methods to improve soft-input and soft-output decoding performance of BCH codes by sum-product algorithm (SPA). A method to remove cycles of length four (RmFC) in the Tanner graph has been proposed. However, the RmFC can not realize good decoding performance for BCH codes which have more than one error correcting capability. To overcome this problem, this paper proposes two methods. One is to use a parity check matrix of the echelon canonical form as the starting check matrix of RmFC. The other is to use a parity check matrix that is concatenation (ConC) of multiple parity check matrices. For BCH(31,11,11) code, SPA with ConC realizes Eb/No 3.7 dB better at bit error rate 10-5 than the original SPA, and 3.1 dB better than the SPA with only RmFC.},
keywords={},
doi={10.1093/ietfec/e91-a.10.2729},
ISSN={1745-1337},
month={October},}
Copiar
TY - JOUR
TI - Sum-Product Decoding of BCH Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2729
EP - 2736
AU - Haruo OGIWARA
AU - Kyouhei SHIMAMURA
AU - Toshiyuki SHOHON
PY - 2008
DO - 10.1093/ietfec/e91-a.10.2729
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2008
AB - This paper proposes methods to improve soft-input and soft-output decoding performance of BCH codes by sum-product algorithm (SPA). A method to remove cycles of length four (RmFC) in the Tanner graph has been proposed. However, the RmFC can not realize good decoding performance for BCH codes which have more than one error correcting capability. To overcome this problem, this paper proposes two methods. One is to use a parity check matrix of the echelon canonical form as the starting check matrix of RmFC. The other is to use a parity check matrix that is concatenation (ConC) of multiple parity check matrices. For BCH(31,11,11) code, SPA with ConC realizes Eb/No 3.7 dB better at bit error rate 10-5 than the original SPA, and 3.1 dB better than the SPA with only RmFC.
ER -