Matrix recursive expressions of the DFT of even and odd complex sequences

DOI10.1002/NLA.452MaRDI QIDQ3600003zbMATH OpenOpenAlexFDO

Authors Filippo Notarnicola

Publication date 9 February 2009

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.452

zbMATH Keywords

algorithmsdiscrete cosine transformdiscrete sine transformdiscrete spectral analysisdivide and conquerrecursive matrix expressionsymmetric discrete Fourier transform

Mathematics Subject Classification ID

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

Recommendations

• Recursive Fourier transform using convolutions
• New fast recursive algorithms for the computation of discrete cosine and sine transforms
• scientific article; zbMATH DE number 4013982
• scientific article; zbMATH DE number 1927207
• A fast recursive algorithm for the discrete sine transform

Cites work

• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• scientific article; zbMATH DE number 771803 (Why is no real title available?)
• Some Algorithms for Use with the Fast Fourier Transform

Cited in

(1)

• Computationally efficient methods for analysis and synthesis of real signals using FFT and IFFT

This page was built for publication: Matrix recursive expressions of the DFT of even and odd complex sequences

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