Abstract
In this paper, we propose a class of irregular turbo codes that approach the capacity of the binary erasure channel. First, an analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This expression will then be used to study the density evolution of turbo codes over the binary erasure channel, that will allow for the design of capacity-approaching infinite-length irregular turbo codes. Next, a graph-optimal interleaver for finite-length irregular turbo codes is proposed. Finally, simulation results for different coding rates are shown.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
