### Abstract

This paper presents a majority-logic decoding (MLgD) algorithm for non-binary LDPC codes based on a novel expansion of the Tanner graph. The expansion introduced converts the Q-ary graph into a binary one, which makes the new MLgD algorithm more attractive for hardware implementations. Proposed algorithm performs significantly better than the existing MLgD algorithms in the waterfall region, and it shows a much lower error-floor as well. Algorithm only requires integer additions, comparisons, finite field operations and some binary operations. Thus, it offers an effective trade-off between performance and complexity in decoding non-binary LDPC codes.

Original language | English |
---|---|

Title of host publication | 2019 IEEE Information Theory Workshop (ITW 2019) |

Editors | Michael Lentmaier, Sennur Ulukus, Serdar Yüksel |

Place of Publication | Piscataway NJ USA |

Publisher | IEEE, Institute of Electrical and Electronics Engineers |

Pages | 539-543 |

Number of pages | 5 |

ISBN (Electronic) | 9781538669006, 97815386-68993 |

ISBN (Print) | 9781538669013 |

DOIs | |

Publication status | Published - Aug 2019 |

Event | Information Theory Workshop 2019 - Visby, Sweden Duration: 25 Aug 2019 → 28 Aug 2019 http://itw2019.org/ |

### Conference

Conference | Information Theory Workshop 2019 |
---|---|

Abbreviated title | ITW 2019 |

Country | Sweden |

City | Visby |

Period | 25/08/19 → 28/08/19 |

Internet address |

### Keywords

- Graph expansion
- Majority-logic decoding
- Non-binary LDPC codes

## Cite this

*2019 IEEE Information Theory Workshop (ITW 2019)*(pp. 539-543). IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ITW44776.2019.8989103