Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
567238 | Signal Processing | 2007 | 10 Pages |
Abstract
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 (PPSs). The transform can be computed by directly using the 1D fast Fourier transforms (FFT), which requires a prohibitive computational load for higher-order PPSs. By exploiting two properties of the PTFT, this paper presents a decimation-in-time fast algorithm to significantly reduce the computational complexity compared with that by only using 1D FFT. For example, the numbers of both complex multiplications and additions are reduced by a factor of 2Mlog2N for N -point (M+1)(M+1)th-order PTFTs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Signal Processing
Authors
Yongmei Wei, Guoan Bi,