Computer Science – Information Theory
Scientific paper
2008-04-03
Computer Science
Information Theory
6 pages, submitted Turbo-Symposium 2008
Scientific paper
In 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.
Kraidy Ghassan M.
Savin Valentin
No associations
LandOfFree
Irregular turbo code design for the binary erasure channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Irregular turbo code design for the binary erasure channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Irregular turbo code design for the binary erasure channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-352471