LDPC code construction with low error floor based on the IPEG algorithm

Sung-Ha Kim

doi:10.1109/LCOMM.2007.061650

LDPC code construction with low error floor based on the IPEG algorithm

2007-07-01

13

PRE

AI

DOI：10.1109/LCOMM.2007.061650

Original

Original request for help

Save

Abstract

En 中文

We propose a modification on the improved progressive-edge-growth(IPEG) algorithm. Proposed modification increases the connectivity of variable nodes using extrinsic message degree of variable nodes, which results in reducing the small stopping sets. Through computer simulation, we confirm that the codes constructed by the proposed algorithm have lower error floor than those constructed by the original IPEG algorithm.

Keywords:

progressive-edge-growth (PEG) algorithm

stopping set

extrinsic message degree(EMD)

LDPC code construction with low error floor based on the IPEG algorithm

Abstract

Journal

Organization