pith. sign in

arxiv: 1312.4805 · v1 · pith:KKGO3EWInew · submitted 2013-12-17 · 💻 cs.IT · math.IT

Array Convolutional Low-Density Parity-Check Codes

classification 💻 cs.IT math.IT
keywords codescodedesignlow-densityparity-checkperformancepreviousrti-ldpcc
0
0 comments X
read the original abstract

This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density parity-check (LDPC) block code into an RTI-LDPCC code, and we obtain a new method to design RTI-LDPCC codes with better performance and shorter constraint length. Differently from previous techniques, we start the design from an array LDPC block code. We show that, for codes with high rate, a performance gain and a reduction in the constraint length are achieved with respect to previous proposals. Additionally, an increase in the minimum distance is observed.

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.