Abstract
In this paper we present a modified version of the belief propagation algorithm for regular and irregular LDPC codes, the aims of the research presented in this article is to improve convergence and reduce latency. The developed algorithm has two new features, one in the strategy for reweighting check nodes in tanner graph and a second for exploiting the existence of short cycles with an exponential function for the determination of the factor appearance probability. The proposed algorithm is called exponential factor appearance probability belief propagation (EFAP-BP), and is suitable for wireless communication. The simulation results obtained show that the proposed algorithm is better compared to the standard BP and the VFAP-BP algorithms in the literature for both regular and irregular codes.
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 callMore From: AEU - International Journal of Electronics and Communications
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.
