pith. sign in

arxiv: 1607.05647 · v2 · pith:DAHLNFH5new · submitted 2016-07-19 · 💻 cs.IT · math.IT

Design of LDPC Codes using Multipath EMD Strategies and Progressive Edge Growth

classification 💻 cs.IT math.IT
keywords codesperformancemultipatherrorldpcproposedapproachblock
0
0 comments X p. Extension
pith:DAHLNFH5 Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{DAHLNFH5}

Prints a linked pith:DAHLNFH5 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor arises from the loss of independence of messages passed under iterative graph-based decoding. In this paper, the error floor performance of short block length codes is improved by use of a novel candidate selection metric in code graph construction. The proposed Multipath EMD approach avoids harmful structures in the graph by evaluating certain properties of the cycles which may be introduced in each edge placement. We present Multipath EMD based designs for several structured LDPC codes including quasi-cyclic and irregular repeat accumulate codes. In addition, an extended class of diversity-achieving codes on the challenging block fading channel is proposed and considered with the Multipath EMD design. This combined approach is demonstrated to provide gains in decoder convergence and error rate performance. A simulation study evaluates the performance of the proposed and existing state-of-the-art methods.

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.