arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.05761cs.ITcs.DSmath.IT
收藏

二元扩张有限域上的FFT算法及其在Reed-Solomon码中的应用

FFT Algorithm for Binary Extension Finite Fields and its Application to Reed-Solomon Codes

Sian-Jheng Lin, Tareq Y. Al-Naffouri, Yunghsiang S. Han

摘要:

最近,提出了一种新的二元扩张域上的多项式基,使得这种域上的快速傅里叶变换(FFT)的计算复杂度为$\mathcal{O}(n\lg(n))$阶,其中$\mathcal{O}(n\lg(n))$是FFT中计算的点数.在这项工作中,我们重新制定这个FFT算法,使它可以更容易理解,并扩展到开发频域解码算法的$(n=2^m,k)$系统Reed-Solomon~(RS)码在$\mathbb{F}_{2^m},m\in \mathbb{Z}^+$,与$n-k$的2的幂。首先,在解码过程中重新制定伴随式多项式的基础,以便新的变换可以应用于解码过程。提出了一种快速确定误差定位多项式的扩展欧几里德算法。所提出的解码算法的计算复杂度是$\mathcal{O}(n\lg(n-k)+(n-k)\lg^2(n-k))$,改进了当前可用的最佳解码复杂度$\mathcal{O}(n\lg^2(n)\lg\lg(n))$,并且达到了Justesen在1976年建立的最佳已知复杂度界限。然而,Justesen的方法仅适用于某些特定域上的代码,可以应用Cooley-Tucky FFT。计算机仿真结果表明,该译码算法比传统的译码算法快$50$倍,译码性能优于$\mathbb{F}_{2^{16}}$上的$(2^{16},2^{15})$ RS码.

英文摘要:

Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points evaluated in FFT. In this work, we reformulate this FFT algorithm such that it can be easier understood and be extended to develop frequency-domain decoding algorithms for $(n=2^m,k)$ systematic Reed-Solomon~(RS) codes over $\mathbb{F}_{2^m},m\in \mathbb{Z}^+$, with $n-k$ a power of two. First, the basis of syndrome polynomials is reformulated in the decoding procedure so that the new transforms can be applied to the decoding procedure. A fast extended Euclidean algorithm is developed to determine the error locator polynomial. The computational complexity of the proposed decoding algorithm is $\mathcal{O}(n\lg(n-k)+(n-k)\lg^2(n-k))$, improving upon the best currently available decoding complexity $\mathcal{O}(n\lg^2(n)\lg\lg(n))$, and reaching the best known complexity bound that was established by Justesen in 1976. However, Justesen's approach is only for the codes over some specific fields, which can apply Cooley-Tucky FFTs. As revealed by the computer simulations, the proposed decoding algorithm is $50$ times faster than the conventional one for the $(2^{16},2^{15})$ RS code over $\mathbb{F}_{2^{16}}$.

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

↑