Performance estimation of finite-length repeat–accumulate codes

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.