On the probabilistic computation algorithm for 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, 2008. ISIT 2008. IEEE International Symposium on
Publication Date: 6-11 July 2008
On page(s): 295-299
Location: Toronto, ON,
ISBN: 978-1-4244-2256-2
INSPEC Accession Number: 10156279
Digital Object Identifier: 10.1109/ISIT.2008.4594995
Current Version Published: 2008-08-08
Abstract
On the binary erasure channel, the performance of LDPC codes decoded by iterative algorithms is estimated by small-size stopping sets. We have proposed a probabilistic algorithm for computing the minimum size of stopping sets of LDPC codes. In this paper, we analyze the probability and the complexity of finding the minimum-size stopping sets, and give an error probability of determining the minimum size of stopping sets after processing our algorithm. Additionally, we show the numerical results of computing the minimum size of stopping sets of several LDPC codes. In these result, we could compute the minimum size of stopping sets with high reliability.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
