Open AccessPerformance estimation of finite‐length repeat–accumulate codes
Author(s) -
NoorARahim Md.,
Zhang Nan,
Wang Siyi
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.1193
Subject(s) - waterfall , algorithm , computer science , binary number , error floor , turbo code , mathematics , theoretical computer science , block code , decoding methods , arithmetic , archaeology , history
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.