Abstract
In this paper, the authors study the performance of finite-length repeat–accumulate (RA) codes in the waterfall region. Utilising density evolution technique, the authors present estimation algorithms to predict the error performance of finite-length RA codes over binary memoryless channels. Through comparison with numerical results, the authors show that the finite-length performance of RA codes can be closely estimated by using authors’ proposed approach.
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.
