New time-domain decoder for correcting both errors and erasures of reed-solomon codes

Erl Huei Lu, Tso Cho Chen, Chih Wen Shih*

*此作品的通信作者

研究成果: 期刊稿件文章同行評審

1 引文 斯高帕斯(Scopus)

摘要

A new time-domain decoder for Reed-Solomon (RS) codes is proposed. Because this decoder can correct both errors and erasures without computing the erasure locator, errata locator, or errata evaluator polynomials, the computational complexity can be substantially reduced. Herein, to demonstrate this benefit, complexity comparisons between the proposed decoder and the Truong-Jeng-Hung and Lin-Costello decoders are presented. These comparisons show that the proposed decoder consistently has lower computational requirements when correcting all combinations of v errors and μ erasures than both of the related decoders under the condition of 2v+μ≤dmin where dmin denotes the minimum distance of the RS code. Finally, the (255, 223) and (63, 39) RS codes are used as examples for complexity comparisons under the upper bounded condition of 2v+μdmin To decode the two RS codes, the new decoder can save about 40% additions and multiplications when μ=dmin 1 as compared with the two related decoders. Furthermore, it can also save 50% of the required inverses for 0≤μ≤dmin-1.

原文英語
頁(從 - 到)612-621
頁數10
期刊ETRI Journal
38
發行號4
DOIs
出版狀態已出版 - 08 2016

文獻附註

Publisher Copyright:
© 2016 ETRI.

指紋

深入研究「New time-domain decoder for correcting both errors and erasures of reed-solomon codes」主題。共同形成了獨特的指紋。

引用此