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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
