Cyclotomic FFT of Length 2047 Based on a Novel 11-point Cyclic Convolution

2008/12/16 by Meghanad D. Wagh, Ning Chen, Wagh, Meghanad D. +3
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0812.2971

11 pages, 1 figure

arxiv created 2009/04/20 · arxiv updated 2009/12/01

Abstract

In this manuscript, we propose a novel 11-point cyclic convolution algorithm based on alternate Fourier transform. With the proposed bilinear form, we construct a length-2047 cyclotomic FFT.

Related

• Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm
• Cooley-Tukey FFT over ℚ_p via Unramified Cyclotomic Extension
• Computational Complexity of Cyclotomic Fast Fourier Transforms over Characteristic-2 Fields
• Prime Factor Cyclotomic Fourier Transforms with Reduced Complexity over Finite Fields
• General Method for Prime-point Cyclic Convolution over the Real Field