Interleavers for turbo codes that yield a minimum distance growing with blocklength

Joseph Boutros, Gilles Zémor

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

The interleavers for turbo codes that yields a minimum distance growing with blocklength were discussed. It was found that the interleaver was essentially chosen at random among a family. The block error rates of turbo codes under the AWGN channel for the pure random interleaver, the S-random were presented. Analysis shows that the bidimensional interleaver size was 400 bits and the constituent convolutional code had a feedback.

Original languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 20 Oct 2004
Externally publishedYes

Fingerprint

Turbo Codes
Turbo codes
Minimum Distance
Convolutional codes
Convolutional Codes
Feedback
Error Rate

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

@article{fc96c8c1789e4957838cf9c615b562ad,
title = "Interleavers for turbo codes that yield a minimum distance growing with blocklength",
abstract = "The interleavers for turbo codes that yields a minimum distance growing with blocklength were discussed. It was found that the interleaver was essentially chosen at random among a family. The block error rates of turbo codes under the AWGN channel for the pure random interleaver, the S-random were presented. Analysis shows that the bidimensional interleaver size was 400 bits and the constituent convolutional code had a feedback.",
author = "Joseph Boutros and Gilles Z{\'e}mor",
year = "2004",
month = "10",
day = "20",
language = "English",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8097",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Interleavers for turbo codes that yield a minimum distance growing with blocklength

AU - Boutros, Joseph

AU - Zémor, Gilles

PY - 2004/10/20

Y1 - 2004/10/20

N2 - The interleavers for turbo codes that yields a minimum distance growing with blocklength were discussed. It was found that the interleaver was essentially chosen at random among a family. The block error rates of turbo codes under the AWGN channel for the pure random interleaver, the S-random were presented. Analysis shows that the bidimensional interleaver size was 400 bits and the constituent convolutional code had a feedback.

AB - The interleavers for turbo codes that yields a minimum distance growing with blocklength were discussed. It was found that the interleaver was essentially chosen at random among a family. The block error rates of turbo codes under the AWGN channel for the pure random interleaver, the S-random were presented. Analysis shows that the bidimensional interleaver size was 400 bits and the constituent convolutional code had a feedback.

UR - http://www.scopus.com/inward/record.url?scp=5044242521&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5044242521&partnerID=8YFLogxK

M3 - Conference article

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8097

ER -