Skip to Main Content
The belief-propagation decoding algorithm for low-density parity check codes is analyzed and the convergence characteristic of this algorithm is researched. A modified belief-propagation decoding algorithm aiming at decreasing the number of iteration is proposed. Simulation result shows that the number of iteration of the proposed algorithm is only half of that of the standard one at expense of little loss in performance.
Date of Conference: 27-28 Feb. 2009