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
Neste artigo, consideramos condições suficientes para descartar algumas etapas de iteração inúteis em uma classe de algoritmos de decodificação iterativa de decisão suave para códigos de bloco binários usados no canal AWGN usando sinalização BPSK. Condições suficientes para excluir a próxima etapa de decodificação, chamadas condições de exclusão, e aquelas para excluir todas as etapas de iteração subsequentes, chamadas condições de término antecipado, são formuladas de maneira unificada, sem degradação do desempenho do erro. Essas condições são mostradas como um tipo de problema de programação inteira. São apresentadas diversas técnicas para reduzir tal problema de programação inteira a um conjunto de subprogramas com complexidades computacionais menores. Como exemplo, é apresentada uma condição de encerramento antecipado para algoritmo de decodificação do tipo Chase. Os resultados da simulação para o código Reed-Muller (64, 42, 8) e o código BCH estendido (64, 45, 8) mostram que a condição de rescisão antecipada combinada com uma condição de exclusão proposta anteriormente é consideravelmente eficaz na redução do número de testes padrões de erro, especialmente à medida que cresce o número total de padrões de erro de teste em questão.
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
Tadao KASAMI, Yuansheng TANG, Takuya KOUMOTO, Toru FUJIWARA, "Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 10, pp. 2061-2073, October 1999, doi: .
Abstract: In this paper, we consider sufficient conditions for ruling out some useless iteration steps in a class of soft-decision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Sufficient conditions for ruling out the next single decoding step, called ruling-out conditions and those for ruling out all the subsequent iteration steps, called early termination conditions, are formulated in a unified way without degradation of error performance. These conditions are shown to be a type of integer programming problems. Several techniques for reducing such an integer programming problem to a set of subprograms with smaller computational complexities are presented. As an example, an early termination condition for Chase-type decoding algorithm is presented. Simulation results for the (64, 42, 8) Reed-Muller code and (64, 45, 8) extended BCH code show that the early termination condition combined with a ruling-out condition proposed previously is considerably effective in reducing the number of test error patterns, especially as the total number of test error patterns concerned grows.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2061/_p
Copiar
@ARTICLE{e82-a_10_2061,
author={Tadao KASAMI, Yuansheng TANG, Takuya KOUMOTO, Toru FUJIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms},
year={1999},
volume={E82-A},
number={10},
pages={2061-2073},
abstract={In this paper, we consider sufficient conditions for ruling out some useless iteration steps in a class of soft-decision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Sufficient conditions for ruling out the next single decoding step, called ruling-out conditions and those for ruling out all the subsequent iteration steps, called early termination conditions, are formulated in a unified way without degradation of error performance. These conditions are shown to be a type of integer programming problems. Several techniques for reducing such an integer programming problem to a set of subprograms with smaller computational complexities are presented. As an example, an early termination condition for Chase-type decoding algorithm is presented. Simulation results for the (64, 42, 8) Reed-Muller code and (64, 45, 8) extended BCH code show that the early termination condition combined with a ruling-out condition proposed previously is considerably effective in reducing the number of test error patterns, especially as the total number of test error patterns concerned grows.},
keywords={},
doi={},
ISSN={},
month={October},}
Copiar
TY - JOUR
TI - Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2061
EP - 2073
AU - Tadao KASAMI
AU - Yuansheng TANG
AU - Takuya KOUMOTO
AU - Toru FUJIWARA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1999
AB - In this paper, we consider sufficient conditions for ruling out some useless iteration steps in a class of soft-decision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Sufficient conditions for ruling out the next single decoding step, called ruling-out conditions and those for ruling out all the subsequent iteration steps, called early termination conditions, are formulated in a unified way without degradation of error performance. These conditions are shown to be a type of integer programming problems. Several techniques for reducing such an integer programming problem to a set of subprograms with smaller computational complexities are presented. As an example, an early termination condition for Chase-type decoding algorithm is presented. Simulation results for the (64, 42, 8) Reed-Muller code and (64, 45, 8) extended BCH code show that the early termination condition combined with a ruling-out condition proposed previously is considerably effective in reducing the number of test error patterns, especially as the total number of test error patterns concerned grows.
ER -