A New Representation of FFT Algorithms Using Triangular Matrices

DOI10.1109/TCSI.2016.2587822MaRDI QIDQ4956763zbMATH OpenFDO

Authors Mario Garrido

Publication date 2 September 2021

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 4024740
• Publication:3026294
• scientific article; zbMATH DE number 494440
• A new truncated Fourier transform algorithm
• Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
• Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons
• scientific article; zbMATH DE number 500361
• A new matrix approach to real FFTs and convolutions of length \(2^k\)
• New algorithms for the multidimensional discrete Fourier transform
• FFT algorithms for vector computers

This page was built for publication: A New Representation of FFT Algorithms Using Triangular Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956763)