Fast computation for third-order polynomial time frequency transforms

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 parameters of third-order polynomial-phase signals. Detailed derivation of the algorithm and analysis of the computational complexity are also provided. It is shown that the proposed algorithm significantly reduces the computational complexity compared to the algorithm directly using 1D four Fourier transforms.