Efficient DFT Architectures Based Upon Symmetries

DOI10.1109/TSP.2006.880216zbMATH Open1388.65193OpenAlexW2131107556MaRDI QIDQ4587971FDOQ4587971

Authors: Tomaso Erseghe, Gianfranco Cariolaro 

Publication date: 30 October 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2006.880216

Recommendations

• On the structure of efficient DFT algorithms
• Further Symmetries of in-Place FFTs
• Generating symmetric DFTs and equivariant FFT algorithms
• Computationally efficient systolic architecture for computing the discrete Fourier transform
• Symmetric FFTs
• Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
• The use of Symmetrics in the Design of Multidimensional Digital filters
• N-dimensional symmetries and their applications in digital filters
• scientific article; zbMATH DE number 800360

Mathematics Subject Classification ID

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

This page was built for publication: Efficient DFT Architectures Based Upon Symmetries

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