Fast computation for third-order polynomial time frequency transforms
G Bi, Y Wei - Electronics Letters, 2004 - IET
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 …
transform, which is needed by the maximum likelihood method to estimate the phase …
[引用][C] Fast computation for third-order polynomial time frequency transforms
G Bi, Y Wei - Electronics Letters, 2004 - ui.adsabs.harvard.edu
Fast computation for third-order polynomial time frequency transforms - NASA/ADS Now on
home page ads icon ads Enable full ADS view NASA/ADS Fast computation for third-order …
home page ads icon ads Enable full ADS view NASA/ADS Fast computation for third-order …
Fast computation for third-order polynomial time frequency transforms
G Bi, Y Wei - Electronics Letters, 2004 - search.proquest.com
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 …
transform, which is needed by the maximum likelihood method to estimate the phase …