2008/04/03 by Ghassan M. Kraidy, Kraidy, Ghassan M., Valentin Savin +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithms and Data Compression #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0804.0539
6 pages, submitted Turbo-Symposium 2008
arxiv created 2008/04/03 · openalex publication_date 2008/04/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.