Elimination of Cyclic Stopping Sets for Enhanced Decoding of LDPC Codes

Anxiao Jiang

Abstract: Ahstract- The Stopping-Set Elimination Problem is studied for LDPC codes: how to remove the fewest number of erasures from a stopping set such that the remaining erasures can be decoded by belief propagation in $k$ iterations (including $k$ = ∞). The problem is known to be NP-hard. Here efficient exact algorithms and approximation algorithms are presented for stopping sets whose induced graphs in Tanner graphs contain cycles.