DocumentCode :
1501455
Title :
On the Reduction of Additive Complexity of Cyclotomic FFTs
Author :
Bellini, S. ; Ferrari, M. ; Tomasoni, A.
Author_Institution :
Dipt. di Elettron. e Inf., Politec. di Milano, Milan, Italy
Volume :
60
Issue :
6
fYear :
2012
fDate :
6/1/2012 12:00:00 AM
Firstpage :
1465
Lastpage :
1468
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.
Keywords :
Galois fields; bilinear systems; fast Fourier transforms; additive complexity reduction; bilinear cyclic convolutions; cyclotomic FFT; Additives; Complexity theory; Convolutional codes; Fourier transforms; Indexes; Polynomials; Vectors; Fourier transforms; Galois fields; convolution;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2012.041212.110168
Filename :
6188998
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1501455
بازگشت