scientific article; zbMATH DE number 2147607

zbMATH Open1065.65152MaRDI QIDQ4659267

Laike Tian, Aihua Ma, Weichang Shen, Hebao Yao, Bing Wang

Publication date: 21 March 2005

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

zbMATH Keywords

fast Fourier transformCooley-Tukey algorithmadding zeros

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• On a fast algorithm for computing the Fourier transform 👍 👎
• Range and error analysis for a fast Fourier transform computed over<tex>Z[{omega}</tex>] 👍 👎
• On the Fixed-Point Accuracy Analysis of FFT Algorithms 👍 👎
• Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs 👍 👎
• A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM 👍 👎
• Frobenius Additive Fast Fourier Transform 👍 👎
• Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform 👍 👎
• Additive Fast Fourier Transforms Over Finite Fields 👍 👎

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 Q4659267)