Irregular turbo code design for the binary erasure channel

Simple item page
dc.creatorKraidy, Ghassan M.
dc.creatorSavin, Valentin
dc.date2008-04-03
dc.date.accessioned2026-07-07T09:30:07Z
dc.date.available2026-07-07T09:30:07Z
dc.descriptionIn this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This exact expression will be used to track the density evolution of turbo codes over the erasure channel, that will allow for the design of capacity-approaching irregular turbo codes. Next, we propose a graph-optimal interleaver for irregular turbo codes. Simulation results for different coding rates is shown at the end.
dc.description6 pages, submitted Turbo-Symposium 2008
dc.identifierhttps://arxiv.org/abs/0804.0539
dc.identifierhttp://arxiv.org/abs/0804.0539
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158025
dc.subjectInformation Theory
dc.titleIrregular turbo code design for the binary erasure channel
dc.typetext

Files

Collections

arXiv