Fast Converging ADMM-Penalized Algorithm for LDPC Decoding PROJECT TITLE :Fast Converging ADMM-Penalized Algorithm for LDPC DecodingABSTRACT:The alternate direction methodology of multipliers (ADMM) approach has been recently thought-about for LDPC decoding. It has been approved to enhance the error rate performance compared with standard message passing (MP) techniques in both the waterfall and error floor regions at the price of a higher computation complexity. During this letter, a formulation of the ADMM decoding algorithm with modified computation scheduling is proposed. It will increase the error correction performance of the decoding algorithm and reduces the common computation complexity of the decoding method due to a faster convergence. Simulation results show that this modified scheduling hastens the decoding procedure on the subject of the ADMM initial formulation while enhancing the error correction performance. This decoding speed-up is further improved when the proposed scheduling is teamed with a recent complexity reduction technique detailed in Wei et al.IEEE Commun. Lett., 2015. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Codebook Calibration Method for Vector Quantizers Implemented at the Focal Plane of CMOS Imagers Scattering of Waves by a Perfectly Conducting Wedge Residing at the Interface Between Two Isorefractive Media
