A Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N≡4 (mod 8)

H.M. de Oliveira, R.M. Campello de Souza, R.C. de Oliveira

DOI: 10.14209/sbrt.2009.57813

Evento: XXVII Simpósio Brasileiro de Telecomunicações (SBrT2009)

Keywords: fast algorithms FFT Laurent series Heideman bound

Abstract

General guidelines for a new fast computation of blocklength 8m+4 DFTs are presented, which is based on a Laurent series involving matrices. Results of non-trivial real multiplicative complexity are presented for blocklengths N≤64, achieving lower multiplication counts than previously published FFTs. A detailed description for the cases m=1 and m=2 is presented.

Download