We investigate a property that we have found in many efficient bilinear cyclic convolutions in GF(2^m). 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 Additive Complexity of Cyclotomic FFTs

BELLINI, SANDRO;FERRARI, MARCO PIETRO;TOMASONI, ALESSANDRO
2012-01-01

Abstract

We investigate a property that we have found in many efficient bilinear cyclic convolutions in GF(2^m). 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.
Fourier transforms; Galois fields; convolution
File in questo prodotto:
File Dimensione Formato  
06188998.pdf

Accesso riservato

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 131.71 kB
Formato Adobe PDF
131.71 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/685838
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 8
social impact