On the Reduction of Additive Complexity of Cyclotomic FFTs
S. Bellini, Marco Ferrari, Alessandro Tomasoni · IEEE Transactions on Communications · 2012
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.