Irregular turbo code design for the binary erasure channel
Ghassan M. Kraidy, Valentin Savin
TL;DR
This paper develops irregular turbo codes optimized for the binary erasure channel, deriving exact erasure probability expressions and proposing a graph-optimal interleaver to approach channel capacity.
Contribution
It introduces an analytic erasure probability formula and a graph-optimal interleaver design for irregular turbo codes over the erasure channel.
Findings
Derived exact erasure probability expression for punctured recursive systematic convolutional codes.
Designed a graph-optimal interleaver for irregular turbo codes.
Simulation results demonstrate improved performance at various coding rates.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Algorithms and Data Compression