scientific article; zbMATH DE number 847093

zbMATH Open0838.65141MaRDI QIDQ4864906

Author name not available (Why is that?)

Publication date: 25 February 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items (5)

A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ ⋮ Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms ⋮ On the multiplicative complexity of discrete cosine transforms ⋮ Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses ⋮ Title not available (Why is that?)

Recommendations

• The multiplicative complexity of the discrete Fourier transform 👍 👎
• On the computational complexity of the general discrete Fourier transform 👍 👎
• An efficient algorithm for the computation of the multidimensional discrete Fourier transform 👍 👎
• The multiplicative complexity of discrete cosine transforms 👍 👎
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms 👍 👎
• On the multiplicative complexity of discrete cosine transforms 👍 👎
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2) 👍 👎
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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