arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.3458cs.ITmath.IT
收藏

新型多项式基及其在Reed-Solomon纠删码中的应用

Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes

Sian-Jheng Lin, Wei-Ho Chung, Yunghsiang S. Han

摘要:

本文提出了特征为2的有限域上多项式的一种新基,并将其应用于Reed-Solomon纠删码的编译码中。所提出的多项式基允许在具有小前导常数的$O(h\log_2(h))$有限域运算中计算$h$ -点多项式求值。与规范多项式基相比,该基将加法、乘法运算和多项式次数确定的运算复杂度从$O(h\log_2(h)\log_2\log_2(h))$提高到$O(h\log_2(h))$ .在此基础上,我们进一步研究了$(n=2^r,k)$ Reed-Solomon码的编码和纠删译码算法。由于基于多项式基的变换效率高,编码可以在$O(n\log_2(k))$有限域运算中完成,擦除解码可以在$O(n\log_2(n))$有限域运算中完成。据我们所知,这是第一种方法,支持里德-所罗门擦除码的特征2有限域,同时实现了$O(n\log_2(n))$的复杂性,在加法和乘法的复杂性。由于算法复杂度领先因子较小,因此在实际应用中具有一定的优势。

英文摘要:

In this paper, we present a new basis of polynomial over finite fields of characteristic two and then apply it to the encoding/decoding of Reed-Solomon erasure codes. The proposed polynomial basis allows that $h$-point polynomial evaluation can be computed in $O(h\log_2(h))$ finite field operations with small leading constant. As compared with the canonical polynomial basis, the proposed basis improves the arithmetic complexity of addition, multiplication, and the determination of polynomial degree from $O(h\log_2(h)\log_2\log_2(h))$ to $O(h\log_2(h))$. Based on this basis, we then develop the encoding and erasure decoding algorithms for the $(n=2^r,k)$ Reed-Solomon codes. Thanks to the efficiency of transform based on the polynomial basis, the encoding can be completed in $O(n\log_2(k))$ finite field operations, and the erasure decoding in $O(n\log_2(n))$ finite field operations. To the best of our knowledge, this is the first approach supporting Reed-Solomon erasure codes over characteristic-2 finite fields while achieving a complexity of $O(n\log_2(n))$, in both additive and multiplicative complexities. As the complexity leading factor is small, the algorithms are advantageous in practical applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑