Abstract
In this work, we propose to use the serial belief propagation or serial scheduling in the 2-D bit patterned media (BPM) system with media noise. The serial scheduling methods are applied to the random LDPC codes and quasi-cyclic LDPC (QC-LDPC) codes of high code rates. Both are constructed from the progress-edge growth (PEG) algorithm. We compare the performance of the LDPC codes using the serial belief propagation and the conventional belief propagation (BP) decoding. The simulation results show that the serial scheduling provides a faster convergence speed and a better bit error rate performance than the conventional BP in an AWGN channel. The serial belief propagation is also shown to offer the performance gains over the BP decoding for the BPM system with various media noise levels.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.