Abstract
For the double protograph low-density parity-check (DP-LDPC) code pair, indicating the source and channel codes utilized in the joint source channel coding, the coding optimization is generally implemented by the differential evolution searching with high complexity. In this paper, a new structured design of the DP-LDPC code pair is proposed based on Graph theory to reduce the searching complexity, namely mesh model-based merging (M3) method. Firstly, four basic mesh models are designed to merge the protographs at any dimension. According to the different structures of the source and channel codes, the merging boundary constraint is statistically established to limit the using number of basic models. Then, a prior sorting algorithm is proposed to arrange the selection priorities of basic models for source and channel codes, respectively, which greatly refines the merging accuracy. Since most of the degrees are symmetric and predetermined in the merged protographs, the searching complexity is significantly reduced when the merged protographs are used as the initial input. Finally, simulation results demonstrate that the merging DP-LDPC code pairs show better performances compared to the existing code pairs. Furthermore, the proposed M3 method is hardware-friendly in Internet of Things because of its simple structure.
Sign-in/Register to access full text options 
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.
