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

DOI10.1109/TSP.2007.913162zbMATH Open1390.65164OpenAlexW2115985534MaRDI QIDQ4568671FDOQ4568671

Authors: Guoan Bi, Yingtuo Ju, Xiumei Li 

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)

Cited In (6)

• Local polynomial Fourier transform: a review on recent developments and applications
• The reassigned local polynomial periodogram and its properties
• Title not available (Why is that?)
• Fast algorithm for real joint time–frequency transformations of time-varying signals
• An algorithm for fast Hilbert transform of real functions
• Fractional Fourier transform as a signal processing tool: an overview of recent developments

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

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