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.
On the Reduction of the Additive Complexity of Cyclotomic FFTs
S Bellini;M Ferrari;A Tomasoni
2012
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
