Turbo code design for short blocks
Authors:
- 24 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
This work considers the design of short parallel turbo codes (PTCs) with block lengths in the order of (a few) hundred code bits. In particular we aim at designing codes with large minimum distance. To this end a structured approach is presented to find suitable component code configurations, as well as interleavers. As a result the proposed turbo codes possess low error floors and outperform competing binary low-density parity-check (LDPC) codes by approximately 0:9 dB and state-of-the-art binary turbo codes by 0:4 dB at a code word error rate (CER) of about ≈10-7. The loss w.r.t. the random coding bound (RCB) is only about 0:8 dB.Keywords
This publication has 22 references indexed in Scilit:
- List Decoding of Polar CodesIEEE Transactions on Information Theory, 2015
- Selective Avoidance of Cycles in Irregular LDPC Code ConstructionIEEE Transactions on Communications, 2004
- Box and Match Techniques Applied to Soft-Decision DecodingIEEE Transactions on Information Theory, 2004
- Convergence behavior of iteratively decoded parallel concatenated codesIEEE Transactions on Communications, 2001
- Improved low-density parity-check codes using irregular graphsIEEE Transactions on Information Theory, 2001
- Code construction and decoding of parallel concatenated tail-biting codesIEEE Transactions on Information Theory, 2001
- Minimal tail-biting trellises: the Golay code and moreIEEE Transactions on Information Theory, 1999
- Unveiling turbo codes: some results on parallel concatenated coding schemesIEEE Transactions on Information Theory, 1996
- Some periodic convolutional codes better than any fixed code (Corresp.)IEEE Transactions on Information Theory, 1983
- The random coding bound is tight for the average code (Corresp.)IEEE Transactions on Information Theory, 1973