A probabilistic algorithm for finding the minimum-size stopping sets of LDPC codes
Hirotomo, M.
Konishi, Y.
Morii, M.
Hyogo Inst. of Inf. Educ. Found., Kobe;
This paper appears in: Information Theory Workshop, 2008. ITW '08. IEEE
Publication Date: 5-9 May 2008
On page(s): 66-70
E-ISBN: 978-1-4244-2271-5
Location: Porto,
ISBN: 978-1-4244-2269-2
INSPEC Accession Number: 10114197
Digital Object Identifier: 10.1109/ITW.2008.4578623
Current Version Published: 2008-07-25
Abstract
On the binary erasure channel, the performance of LDPC codes decoded by iterative algorithms is dominated by small-size stopping sets, especially minimal stopping sets. In this paper, we propose a probabilistic algorithm for computing the minimum size of stopping sets of LDPC codes. In this algorithm, we generate efficiently small-size stopping sets by using the relation between small-size stopping sets and low-weight codewords. In numerical experiments, we could compute the minimum size of stopping sets of LDPC codes of length about 500, 1000 and 5000 with high reliability, and could find smaller stopping sets than that found by conventional methods.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
