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
Para códigos de verificação de paridade de baixa densidade (LDPC), o método de decodificação penalizado baseado no método de multiplicadores de direção alternada (ADMM) pode melhorar o desempenho de decodificação em baixas relações sinal-ruído e também tem baixa complexidade de decodificação. Existem três métodos eficazes que podem aumentar a velocidade de decodificação penalizada pelo ADMM, que são reduzir o número de projeções euclidianas na decodificação penalizada pelo ADMM, projetar uma função de penalidade eficaz e selecionar uma estratégia de escalonamento em camadas apropriada para transmissão de mensagens. A fim de aumentar ainda mais a velocidade de decodificação penalizada ADMM, através da redução do número de projeções euclidianas e usando a estratégia de escalonamento em camadas verticais, este artigo projeta um método de decodificação penalizada ADMM de convergência rápida baseado na função de penalidade aprimorada. Os resultados da simulação mostram que o método proposto não apenas melhora o desempenho de decodificação, mas também reduz o número médio de iterações e o tempo médio de decodificação.
Biao WANG
Baoji University of Arts and Sciences
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
Biao WANG, "Fast Converging ADMM Penalized Decoding Method Based on Improved Penalty Function for LDPC Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 11, pp. 1304-1307, November 2020, doi: 10.1587/transfun.2020EAL2020.
Abstract: For low-density parity-check (LDPC) codes, the penalized decoding method based on the alternating direction method of multipliers (ADMM) can improve the decoding performance at low signal-to-noise ratios and also has low decoding complexity. There are three effective methods that could increase the ADMM penalized decoding speed, which are reducing the number of Euclidean projections in ADMM penalized decoding, designing an effective penalty function and selecting an appropriate layered scheduling strategy for message transmission. In order to further increase the ADMM penalized decoding speed, through reducing the number of Euclidean projections and using the vertical layered scheduling strategy, this paper designs a fast converging ADMM penalized decoding method based on the improved penalty function. Simulation results show that the proposed method not only improves the decoding performance but also reduces the average number of iterations and the average decoding time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2020/_p
Copiar
@ARTICLE{e103-a_11_1304,
author={Biao WANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast Converging ADMM Penalized Decoding Method Based on Improved Penalty Function for LDPC Codes},
year={2020},
volume={E103-A},
number={11},
pages={1304-1307},
abstract={For low-density parity-check (LDPC) codes, the penalized decoding method based on the alternating direction method of multipliers (ADMM) can improve the decoding performance at low signal-to-noise ratios and also has low decoding complexity. There are three effective methods that could increase the ADMM penalized decoding speed, which are reducing the number of Euclidean projections in ADMM penalized decoding, designing an effective penalty function and selecting an appropriate layered scheduling strategy for message transmission. In order to further increase the ADMM penalized decoding speed, through reducing the number of Euclidean projections and using the vertical layered scheduling strategy, this paper designs a fast converging ADMM penalized decoding method based on the improved penalty function. Simulation results show that the proposed method not only improves the decoding performance but also reduces the average number of iterations and the average decoding time.},
keywords={},
doi={10.1587/transfun.2020EAL2020},
ISSN={1745-1337},
month={November},}
Copiar
TY - JOUR
TI - Fast Converging ADMM Penalized Decoding Method Based on Improved Penalty Function for LDPC Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1304
EP - 1307
AU - Biao WANG
PY - 2020
DO - 10.1587/transfun.2020EAL2020
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2020
AB - For low-density parity-check (LDPC) codes, the penalized decoding method based on the alternating direction method of multipliers (ADMM) can improve the decoding performance at low signal-to-noise ratios and also has low decoding complexity. There are three effective methods that could increase the ADMM penalized decoding speed, which are reducing the number of Euclidean projections in ADMM penalized decoding, designing an effective penalty function and selecting an appropriate layered scheduling strategy for message transmission. In order to further increase the ADMM penalized decoding speed, through reducing the number of Euclidean projections and using the vertical layered scheduling strategy, this paper designs a fast converging ADMM penalized decoding method based on the improved penalty function. Simulation results show that the proposed method not only improves the decoding performance but also reduces the average number of iterations and the average decoding time.
ER -