Radix-2 DIF fast algorithms for polynomial time-frequency transforms

Author

Guoan Bi ; Yongmei Wei ; Gang Li ; Chunru Wan

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ.

Volume

42

Issue

4

fYear

2006

fDate

10/1/2006 12:00:00 AM

Firstpage

1540

Lastpage

1546

Abstract

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 which the phase coefficients are estimated. To significantly reduce the prohibitive computational complexity to deal with high order PPSs, effective decomposition of the overall computational task is important for any practical applications. This paper derives a radix-2 decimation-in-frequency (DIF) fast algorithms for any order of the PPSs by using the periodic and symmetric properties of the PTFT. Compared with other reported fast algorithms, the proposed one is simple in concept and achieves a significant reduction of the required computational complexity

Keywords

array signal processing; computational complexity; polynomials; time-frequency analysis; transforms; 1D polynomial-phase signal; computational complexity; frequency domain; multidimensional output array; periodic properties; phase coefficients; polynomial time-frequency transforms; radix-2 DIF fast algorithms; radix-2 decimation-in-frequency fast algorithms; symmetric properties; Computational complexity; Frequency domain analysis; Maximum likelihood estimation; Phase estimation; Phased arrays; Polynomials; Pulse compression methods; Radar applications; Synthetic aperture radar; Time frequency analysis;

fLanguage

English

Journal_Title

Aerospace and Electronic Systems, IEEE Transactions on

Publisher

ieee

ISSN

0018-9251

Type

jour

DOI

10.1109/TAES.2006.314595

Filename

4107979