A Low-Complexity Method for Chase-Type Decoding of Reed-Solomon Codes
Jason Bellorado, A. Kavcic
Harvard University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
In this work we present a low-complexity implementation of Chase-type decoding of Reed-Solomon Codes. In such, we first use the soft-information available at the channel output to construct a test-set of 2ηvectors, equival ent in all except the ηηbivariate polynomials, with the roots of each specified by its corresponding test-vector. Here, test-vector similarity is exploited to share much of the required computation. Finally, we obtain the candidate message from the single z-linear factor of each bivariate polynomial. Although we provide an expression for the direct computation of each candidate message, the complexity of repeating this computation for each interpolation polynomial is prohibitive. We, thus, also present a reduced-complexity factorization (RCF) method to select a single polynomial that, with high probability, contains the correctly decoded message in its z-linear factor. Although suboptimal, the loss in performance of RCF decreases rapidly with increasing code length. We provide extensive simulation results showing that a significant performance increase over traditional hard-decision decoding is achievable with a comparable computational complexity (as implemented with the Berlekamp-Massey Algorithm).
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AICoding theory and cryptography
Error Correcting Code Techniques · Cryptography and Residue Arithmetic