Computer Science ›› 2019, Vol. 46 ›› Issue (11): 328-333.doi: 10.11896/jsjkx.181001871

• Interdiscipline & Frontier • Previous Articles     Next Articles

Study on Optimization of Quantization Algorithm in ADMM Decoding Algorithm Based on Lookup Table

LIU Hua-jun1, TANG Shi-di1, ZHANG Di-ke2, XIA Qiao-qiao1   

  1. (School of Physical Science and Technology,Central China Normal University,Wuhan 430079,China)1
    (School of Electronic Information,Wuhan University,Wuhan 430072,China)2
  • Received:2018-10-09 Online:2019-11-15 Published:2019-11-14

Abstract: In the linear programming decoding based on ADMM,the Euclidean projection calculation of the projection vector to the check multi-cellular body is the most complex and time-consuming part.The ADMM-LDPC decoding algorithm based on look-up tables replace the time complexity of algorithm with simple table look-up operations to simplify the projection process and improve the efficiency of the algorithm,however it expends much memory consumption.La-ter,the researchers proposed the nonuniform quantization method,which can decrease the memory consumption effectively,but the computation complexity of the quantitative method is too high,so that the way is difficult to achieve when the number of segments is too much.For this problem,this paper proposed a new nonuniform quantization method.Firstly,for different code-words,the distribution characteristics of elements in the vector are calculated to be projected under different SNRs conditions by experiment,its distribution rules are explored and the corresponding function is designed as the quantitative mapping relation.Then,differential evolution algorithm is used to optimize the parameters of the function,the optimal quantization schema under the function is obtained,and the quantization function is finally determined.The simulation results show that,compared with the existing quantitative methods,the nonuniform method proposed in this paper has the advantage of not being affected by the number of quantization segment,precision and otherfactors.What’s more,it achieves about 0.05dB performance improvement for different code words in high SNRs.

Key words: LDPC codes, Look-up tables, Nonuniform quantization, Penalized ADMM decoder

CLC Number: 

  • TN911.22
[1]FELDMAN J.Decoding error-correcting codes via linear programming[D].Cambridge:MassachusettsInstitute of Technology,2003.
[2]FELDMAN J,WAINWRIGHT M J,KARGER D R.Using linearprogramming to decode binary linear codes[J].IEEE Transa-ctions on Information Theory,2005,51(3):954-972.
[3]BURSHTEIN D,GOLDENBERG I.Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance[J].IEEE Transactions on Information Theory,2011,57(11):7386-7402.
[4]FELDMAN J,MALKIN T,SERVEDIO R A,et al.LP decoding corrects a constant fraction of errors[J].IEEE Transactions on Information Theory,2007,53(1):82-89.
[5]BARMAN S,LIU X S,DRAPER S C,et al.Decompositionmethods for large scale LP decoding[J].IEEE Transactions on Information Theory,2013,59(12):7870-7886.
[6]JIAO X P,WEI H Y,MU J J.Improved ADMM penalized decoder for irregular low-density parity-check codes[J].IEEE Communication Letters,2015,19(6):913-916.
[7]LIU X S,DRAPER S C.The ADMM Penalized Decoder for LDPC Codes[J].IEEE Transactions on Information Theory,2016,62(6):2966-2984.
[8]WANG B,MU J J,JIAO X P,et al.Improved Penalty Functions of ADMM Decoder for LDPC Codes[J].IEEE Communication Letters,2016,21(99):234-237.
[9]ZHANG X,SIEGEL P H.Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers[C]∥IEEE International Symposium on Information Theory.IEEE,2013:1501-1505.
[10]WEI H,BANIHASHEMI A H.An Iterative Check PolytopeProjection Algorithm for ADMM-Based LP Decoding of LDPC Codes[J].IEEE Communications Letters,2017,PP(99):1-1.
[11]ZHANG G,HEUSDENS R,KLEIJN W.Large scale LP decoding with low complexity[J].IEEE Communications Letters,2013,17(11):2152-2155.
[12]WASSON M,DRAPER S C.Hardware based projection ontothe parity polytope and probability simplex[C]∥Asilomar Conference on Signals,Systems and Computers.IEEE,2015:1015-1020.
[13]WEI H Y,JIAO X P,MU J J.Reduced-complexity linear programming decoding based on ADMM for LDPC codes[J].IEEE Communication Letters,2015,19(6):909-912.
[14]JIAO X P,MU J J,HE Y C,et al.Efficient ADMM Decoding of LDPC Codes Using Look-Up Tables[J].IEEE Transactions on Communications,2017,19(4):271-285.
[15]JIAO X,HE Y C,MU J,et al.Memory-Reduced Lookup Tables for Efficient ADMM Decoding of LDPC Codes[J].IEEE Signal Processing Letters,2018,25(99):1-1.
[16]DEBBABI I,GAL B L,KHOUJA N,et al.Fast ConvergingADMM Penalized Algorithm for LDPC Decoding[J].IEEE Communication Letters,2016,20(4):648-651.
[17]DEBBABI I,GAL B L,KHOUJA N,et al.Comparison of different schedulings for the ADMM based LDPC decoding[C]∥ International Symposium on Turbo Codes & Iterative Information Processing.IEEE,2016:51-55.
[18]STORN R,PRICE K.Differential Evolution-A Simple and Efficient Heuristic for global Optimization over Continuous Spaces[J].Journal of Global Optimization,1997,11(4):341-359.
[1] YANG Xue-fei, ZHENG Dong, REN Fang. Digital Signature Algorithm Based on QC-LDPC Code [J]. Computer Science, 2019, 46(6): 162-167.
[2] MENG Jia-hui, ZHAO Dan-feng, TIAN Hai. Simulation Research on Improved Decoding Algorithm Based on Non-binary LDPC for 5G [J]. Computer Science, 2018, 45(9): 141-145.
[3] ZHANG Wei,ZHU Guang-xi,PENG Li,SHEN Qiong-xia. Design of Structured LDPC Codes with Large Girth [J]. Computer Science, 2009, 36(11): 109-112.
[4] SUN Rong, LIU Jing-Wei, WANG Xin-Mei (State Key Lab of ISN, Xidian University, Xi'an 710071). [J]. Computer Science, 2008, 35(4): 78-81.
Full text



No Suggested Reading articles found!