Efficient architecture for algebraic soft‐decision decoding of Reed–Solomon codes
Xuemei Li, Wei Zhang, Yanyan Liu
Tianjin University Nankai University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Reed–Solomon (RS) codes possess excellent error correction capability. Algebraic soft‐decision decoding (ASD) of RS codes can provide better correction performance than the hard‐decision decoding (HDD). The low‐complexity Chase (LCC) decoding has the lowest complexity cost and similar or even higher coding gain among all of the available ASD algorithms. Instead of employing complicated interpolation technique, the LCC decoding can be implemented based on the HDD. This study proposes a modified serial LCC decoder, which employs a novel syndrome calculation, polynomial selection, Chien search and Forney algorithm block. In addition, an improved two‐dimensional optimisation is provided to reduce the hardware complexity of the proposed decoder. Compared with the previous design, the proposed decoder can improve about 1.27 times speed and obtain 1.29 times higher efficiency in terms of throughput‐over‐slice ratio.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AICoding theory and cryptography
Error Correcting Code Techniques · Cryptography and Residue Arithmetic