标题:Infeasible primal-dual interior-point algorithm for linear-programming decoding of LDPC codes
作者:Wang, Xuye ;Ma, Piming
通讯作者:Wang, X
作者机构:[Wang, Xuye ;Ma, Piming ] School of Information Science and Engineering, Shandong University, Jinan, 250100, China
会议名称:2011 IEEE 13th International Conference on Communication Technology, ICCT 2011
会议日期:25 September 2011 through 28 September 2011
来源:International Conference on Communication Technology Proceedings, ICCT
出版年:2011
页码:109-113
DOI:10.1109/ICCT.2011.6157843
关键词:centering parameter; corrector step; IPDIP algorithm; LDPC codes; LP decoding; predictor step
摘要:The linear programming (LP) decoding of Low-Density Parity-Check (LDPC) codes is widely concerned for its maximum likelihood (ML) features. It is that the ML decoding rule for LDPC codes can be relaxed to LP optimization problem. Therefore, this paper focus on an efficient algorithm called infeasible primal-dual interior-point (IPDIP) to solve the LP problem. In each iteration, the IPDIP algorithm obtains the predictor and corrector steps by solving the Karush-Kuhn-Tucker (KKT) equation twice. The predictor term is used to responsible for optimal solution and the corrector term keeps the current iteration away from the boundary of the feasible region. Furthermore, a modification of the centering parameter is developed to accelerate the convergence speed for the IPDIP algorithm. Simulation results of LP decoding demonstrate that the proposed IPDIP algorithm achieves beautiful bit error rate (BER) performance and good global convergence properties with less iteration number and time than other algorithms which only solve the KKT equation once by Newton method or use the not modified centering parameter. © 2011 IEEE.
收录类别:EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84863266098&doi=10.1109%2fICCT.2011.6157843&partnerID=40&md5=82ec4f1a46a0e9f080bc8c70075748e5
TOP