Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences

DOI10.1109/TSP.2007.913162zbMath1390.65164OpenAlexW2115985534MaRDI QIDQ4568671

Guoan Bi, Xiumei Li, Yingtuo Ju

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.913162

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (3)

Fractional Fourier transform as a signal processing tool: an overview of recent developments ⋮ Local polynomial Fourier transform: a review on recent developments and applications ⋮ The reassigned local polynomial periodogram and its properties

This page was built for publication: Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences