A Comparative Study on Partial-Inverse based Time-Domain RS Decoder

• Main Authors: Yang, Po-Yen, 楊伯彥
• Other Authors: Su, Yu-Ted
• Format: Others
• Language: en_US
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/c7px7j

碩士 === 國立交通大學 === 電信工程研究所 === 107 === The Berlekamp-Massey (BM) algorithm and the Forney’s interpolation have been widely used in practice for decoding time-domain Reed-Solomon codes. In this thesis, we investigate the use of the partial-inverse (PI) algorithm along with the generalized Horiguchi-Koetter (HK) interpolation [8] to decode such codes. To analyze their decoding complexities, we modify the PI algorithm so that we can make a side-by-side algorithmic comparison. We confirm the analytic complexity by computer simulations and show that the PI-HK algorithm is indeed more efficient than the BM one as it requires less number of iterations, less decoding complexity, and does not need to compute the error evaluator polynomial. The issue of early decoding termination for both algorithms is addressed as well. We also review the relationship between the PI and the Euclidean algorithms [8] and compare their decoding complexities. An analytic decoding complexity upper bound for the PI algorithm is derived.