Abstract
Nonbinary LDPC coding is a class of excellent error correcting codes in wireless communication systems. The hardware realization of this decoder architecture put forth a challenge at making a better tradeoff between the computation complexities and decoding performance. This letter proposes modifications in the structure of H-matrix which characterizes the Low Density Parity Check (LDPC) codes. The modification is aimed towards the reduction of computation complexity by retaining the properties of H-matrix. Two masking matrices are proposed with reduced number of non- zero elements, forming the diagonals of the parity check matrix. Simulation results indicate improved decoding performance and reduced computational complexity with the proposed H-matrix structures.
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.
