Generalized Fast Algorithms for the Polynomial Time-Frequency Transform

DOI10.1109/TSP.2007.896102MaRDI QIDQ4567471zbMATH OpenOpenAlexFDO

Authors Yingtuo Ju, Guoan Bi

Publication date 27 June 2018

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

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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(5)

• The reassigned local polynomial periodogram and its properties
• Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution.
• Fast algorithm for real joint time–frequency transformations of time-varying signals
• Fractional Fourier transform as a signal processing tool: an overview of recent developments
• Local polynomial Fourier transform: a review on recent developments and applications

This page was built for publication: Generalized Fast Algorithms for the Polynomial Time-Frequency Transform

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