论文信息 - On the Reduction of Additive Complexity of Cyclotomic FFTs

On the Reduction of Additive Complexity of Cyclotomic FFTs

We investigate a property that we have found in many efficient bilinear cyclic convolutions in GF (2m). We show that this property can reduce the additive complexity of cyclotomic FFTs. We explain how it arises, and why the most common constructions of cyclic convolutions yield this beneficial feature.

[1] Elena Costa,et al. On computing the syndrome polynomial in Reed-Solomon decoder , 2004, Eur. Trans. Telecommun..

[2] Sandro Bellini,et al. On the Structure of Cyclotomic Fourier Transforms and Their Applications to Reed-Solomon Codes , 2011, IEEE Transactions on Communications.

[3] Ning Chen,et al. Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm , 2007, IEEE Transactions on Signal Processing.

[4] R. Blahut. Theory and practice of error control codes , 1983 .

[5] Peter Trifonov,et al. A Method for Fast Computation of the Fourier Transform over a Finite Field , 2003, Probl. Inf. Transm..