Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms

DOI10.1109/29.31275zbMATH Open0693.65098OpenAlexW1967085181MaRDI QIDQ3468596FDOQ3468596

Paul Gader

Publication date: 1989

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

Fourier matricesbidiagonal factorizationdiscrete Fourier transformssystolic algorithms

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

   Recommendations

• Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Bidiagonal factorization of tetradiagonal matrices and Darboux transformations 👍 👎
• Exact computation in numerical linear algebra: The discrete Fourier transform 👍 👎
• An efficient algorithm for the computation of the multidimensional discrete Fourier transform 👍 👎
• Title not available (Why is that?) 👍 👎
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform 👍 👎
• On systolic array methods for band matrix factorizations 👍 👎

This page was built for publication: Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms

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