Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images

2008/10/01 by Charly Poulliat, Marc Fossorier, M.P.C. Fossorier +1 · 8 citations
Computer Science · Engineering · #Error Correcting Code Techniques #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding

paper · doi:10.1109/tcomm.2008.060527

Abstract

In this paper, a method to design regular (2, dc)- LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of their binary image. First, the algebraic properties of rows of the parity check matrix H associated with a code are characterized and optimized to improve the waterfall. Then the algebraic properties of cycles and stopping sets associated with the underlying Tanner graph are studied and linked to the global binary minimum distance of the code. Finally, simulations are presented to illustrate the excellent performance of the designed codes.

Citations

• Regular and irregular progressive edge-growth tanner graphs

Cited by

• Group Probability Decoding of Turbo Product Codes over Higher-Order Fields
• An ontology-based approach to the optimization of non-binary (2,v)-regular LDPC codes
• Binary Representaion for Non-binary LDPC Code with Decoder Design
• Simple Low-Rate Non-Binary LDPC Coding for Relay Channels
• Multiplicatively Repeated Non-Binary LDPC Codes
• Low-Complexity Joint Channel Estimation and List Decoding of Short Codes
• Construction and Decoding Algorithms for for Polar Codes based on 2×2 Non-Binary Kernels
• Optimization of NB QC-LDPC Block Codes and Their Performance Analysis

Related

• Quasi-Cyclic LDPC Codes based on Pre-Lifted Protographs
• An ontology-based approach to the optimization of non-binary (2,v)-regular LDPC codes
• Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding
• On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families
• GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets