A Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N=4 (mod 8)
Data Structures and Algorithms
2018-02-12 v1 Discrete Mathematics
Signal Processing
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.
Keywords
Cite
@article{arxiv.1502.01566,
title = {A Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N=4 (mod 8)},
author = {H. M. de Oliveira and R. M. Campello de Souza and R. C. de Oliveira},
journal= {arXiv preprint arXiv:1502.01566},
year = {2018}
}
Comments
6 pages, 2 figures, 2 tables. Conference: XXVII Simposio Brasileiro de Telecomunicacoes - SBrT'09, 2009, Blumenau, SC, Brazil