New Recursive Fast Radix-2 Algorithm for the Modulated Complex Lapped Transform

DOI10.1109/TSP.2012.2213082zbMATH Open1393.94636OpenAlexW1967342830MaRDI QIDQ4574237FDOQ4574237

Authors: Vladimir Britanak 

Publication date: 18 July 2018

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

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

Recommendations

• Very fast computation of the radix-2 discrete Fourier transform
• A Novel DCT-Based Algorithm for Computing the Modulated Complex Lapped Transform
• A Novel Split-Radix Fast Algorithm for 2-D Discrete Hartley Transform
• scientific article; zbMATH DE number 613348
• A novel algorithm for computing the 2D split-vector-radix FFT
• A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
• A novel modularized fast polynomial transform algorithm for two- dimensional convolutions
• A new efficient algorithm to compute the two-dimensional discrete Fourier transform
• Radix-2 × 2 × 2 algorithm for the 3-D discrete Hartley transform
• Multiple radix fast Fourier transformation based on number theoretic transforms

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical algorithms for computer arithmetic, etc. (65Y04) Modulation and demodulation in information and communication theory (94A14)

This page was built for publication: New Recursive Fast Radix-2 Algorithm for the Modulated Complex Lapped Transform

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