Comparison of Convolutional and Block Codes for Low Structural Delay
Authors:
- 12 October 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 63 (12) , 4629-4638
Abstract
The performance of short block length low-density parity-check (LDPC) codes (both binary and nonbinary) and convolutional codes is compared under the constraint of tight structural delay constraints. Additionally, we use fundamental bounds on block codes and low rate turbo codes to evaluate our results in a broader context. It turns out that-depending on the code rate and given delay-convolutional codes are able to outperform fundamental lower bounds for block codes, yielding a definite result on the question, which codes are superior in this regime. From a break-even point onward, convolutional codes cannot compete with block codes anymore and nonbinary LDPC codes show the best performance. Turbo codes with a short interleaver length show competitive results.Keywords
Funding Information
- International Symposium on Turbo Codes and Iterative Information Processing 2014
This publication has 20 references indexed in Scilit:
- Low latency-constrained high rate coding: LDPC codes vs. convolutional codes2014
- LDPC codes and convolutional codes with equal structural delay: a comparisonIEEE Transactions on Communications, 2009
- A truncation depth rule of thumb for convolutional codes2008
- Multiple-Bases Belief-Propagation for Decoding of Short Block Codes2007
- Regular and irregular progressive edge-growth tanner graphsIEEE Transactions on Information Theory, 2005
- Low-rate LDPC codes with simple protograph structure2005
- Protograph based LDPC codes with minimum distance linearly growing with block size2005
- Low-density parity check codes over GF(q)IEEE Communications Letters, 1998
- High-rate punctured convolutional codes for Viterbi and sequential decodingIEEE Transactions on Communications, 1989
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978