Skip to search formSkip to main contentSkip to account menu

Cyclotomic fast Fourier transform

The cyclotomic fast Fourier transform is a type of fast Fourier transform algorithm over finite fields. This algorithm first decomposes a DFT into… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Circulant matrixConvolutionDiscrete Fourier transformFast Fourier transform

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Design of Common Subexpression Elimination Algorithm for Cyclotomic Fast Fourier Transform Over GF (23)
The frequency transformation methods like fast fourier transform algorithms can be competently used in realization of discrete… 
2016
2016
Design and Implementation of the Cyclotomic Fast Fourier Transform Architecture over GF ( 2 3 )
The hardware design and the FPGA implementation of the Fast Fourier Transform over Galois Field i.e. GF(2 3 ) is described. By… 
2015
2015
Design of cyclotomic Fast Fourier Transform architecture over Galois field for 15 point DFT
The Fast Fourier Transform can be determined in Complex field and Galois field. The paper suggests the architecture for finding… 
2007
2007
On the FPGA implementation of the Fourier Transform over finite fields GF(2m)
The hardware design and implementation of cyclotomic Fast Fourier Transform (FFT) over finite fields GF(2m) is described. By… 
2007
2007
Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding
Cyclotomic fast Fourier transform (CFFT) was recently proposed and shown to be efficient for lengths up to 511. In this paper, we… 
2004
2004
Efficient algorithm for computing syndrome polynomial in Reed-Solomon decoder
Application of the cyclotomic Fast Fourier Transform algorithm to the syndrome evaluation problem in classical Reed-Solomon… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)