Design of suitable permutations for irregular turbo codes

Kbaier Ben Ismail, D.; Kerouédan, S. and Douillard, C. (2011). Design of suitable permutations for irregular turbo codes. Electronics Letters, 47(13) pp. 748–749.

DOI: https://doi.org/10.1049/el.2011.0990

Abstract

Proposed is a method based on the Dijkstra's algorithm and an estimation of the distance to search for efficient interleavers, adapted to irregular turbo codes, in order to reduce the flattening effect. Simulations show that a gain of three decades and a half in the error floor is obtained for short block sizes.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI

About

• Item ORO ID
• 74106
• Item Type
• Journal Item
• ISSN
• 0013-5194
• Keywords
• graph theory; interleaved codes; turbo codes
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Copyright Holders
• © 2011 The Institution of Engineering and Technology
• Depositing User
• Dhouha Kbaier