pith. sign in

arxiv: 1605.04664 · v1 · pith:KGSIVF5Unew · submitted 2016-05-16 · 💻 cs.IT · math.IT

A Joint Optimization Technique for Multi-Edge Type LDPC Codes

classification 💻 cs.IT math.IT
keywords codesmet-ldpcoptimizationjointmulti-edgealgorithmdecodingmaximum
0
0 comments X
read the original abstract

This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimization is particularly important for MET-LDPC codes as it is not clear a priori which structures will be good. Using several examples, we demonstrate that the MET-LDPC codes designed by the proposed joint optimization algorithm exhibit improved decoding thresholds compared to previously reported MET-LDPC codes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.