The polynomial time frequency transform is one of important tools for estimating the
coefficients of the polynomial-phase signals (PPSs) with the maximum likelihood method …

The polynomial time frequency transforms have been used as an effective tool to reveal the
polynomial-phase information by converting a one-dimensional polynomial-phase signal in …

The computation of polynomial time frequency transform (PTFT) is required for the maximum
likelihood method to estimate the phase parameters of the polynomial-phase signals …

This paper presents a general class of fast algorithms for computing the polynomial time-
frequency transform (PTFT) of length-a pb, where a, b, and p are positive integers. The …

The polynomial time-frequency transform (PTFT) converts a one-dimensional polynomial-
phase signal (PPS) into a multi-dimensional (MD) output array in the frequency domain from …

A fast algorithm is presented for the computation of the third-order polynomial time frequency
transform, which is needed by the maximum likelihood method to estimate the phase …

The discrete polynomial transform (DPT) has been introduced as a computationally efficient
algorithm for estimating the phase parameters of constant-amplitude polynomial phase …

The 2-D quasi-maximum likelihood algorithm for estimation of 2-D polynomial phase signals
(2-D PPSs) is proposed. Estimation of all phase parameters is performed in an efficient …

A novel approach for the parameter estimation of the polynomial phase signals (PPS) based
on the short‐time Fourier transform (STFT) is proposed. Estimator accuracy is significantly …

The discrete polynomial-phase transform (DPT) is a new tool for analyzing constant-
amplitude polynomial-phase signals. The main properties of the DPT are its ability to identify …