Discrete chirp-Fourier transform

Xiang Gen Xia

Discrete chirp-Fourier transform

Xiang Gen Xia^*

^*此作品的通讯作者

University of Delaware

科研成果: 期刊稿件 › 会议文章 › 同行评审

3 引用（Scopus）

摘要

In this study, an attempt is made to evaluate discrete chirp-Fourier transform (DCFT). It is shown that the magnitudes of all the sidelobes of the DCFT of a quadratic chirp signal are 1 while the magnitude of the mainlobe of the DCFT is √N, where N is a prime and is the length of the signal. With this result, an upper bound for the number of the detectable chirp components using the DCFT is provided in terms of signal length, signal and noise powers. It is also shown that the N-point DCFT performs optimally when N is a prime.

源语言	英语
页（从-至）	27-38
页数	12
期刊	Proceedings of SPIE - The International Society for Optical Engineering
卷	3810
出版状态	已出版 - 1999
已对外发布	是
活动	Proceedings of the 1999 Radar Processing, Technology, and Applications IV - Denver, CO, USA 期限: 21 7月 1999 → 22 7月 1999

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{063312a0faf9487aad7a71cd6dfe209b,

title = "Discrete chirp-Fourier transform",

abstract = "In this study, an attempt is made to evaluate discrete chirp-Fourier transform (DCFT). It is shown that the magnitudes of all the sidelobes of the DCFT of a quadratic chirp signal are 1 while the magnitude of the mainlobe of the DCFT is √N, where N is a prime and is the length of the signal. With this result, an upper bound for the number of the detectable chirp components using the DCFT is provided in terms of signal length, signal and noise powers. It is also shown that the N-point DCFT performs optimally when N is a prime.",

author = "Xia, \{Xiang Gen\}",

year = "1999",

language = "English",

volume = "3810",

pages = "27--38",

journal = "Proceedings of SPIE - The International Society for Optical Engineering",

issn = "0277-786X",

publisher = "SPIE",

note = "Proceedings of the 1999 Radar Processing, Technology, and Applications IV ; Conference date: 21-07-1999 Through 22-07-1999",

}

TY - JOUR

T1 - Discrete chirp-Fourier transform

AU - Xia, Xiang Gen

PY - 1999

Y1 - 1999

N2 - In this study, an attempt is made to evaluate discrete chirp-Fourier transform (DCFT). It is shown that the magnitudes of all the sidelobes of the DCFT of a quadratic chirp signal are 1 while the magnitude of the mainlobe of the DCFT is √N, where N is a prime and is the length of the signal. With this result, an upper bound for the number of the detectable chirp components using the DCFT is provided in terms of signal length, signal and noise powers. It is also shown that the N-point DCFT performs optimally when N is a prime.

AB - In this study, an attempt is made to evaluate discrete chirp-Fourier transform (DCFT). It is shown that the magnitudes of all the sidelobes of the DCFT of a quadratic chirp signal are 1 while the magnitude of the mainlobe of the DCFT is √N, where N is a prime and is the length of the signal. With this result, an upper bound for the number of the detectable chirp components using the DCFT is provided in terms of signal length, signal and noise powers. It is also shown that the N-point DCFT performs optimally when N is a prime.

UR - https://www.scopus.com/pages/publications/0033314337

M3 - Conference article

AN - SCOPUS:0033314337

SN - 0277-786X

VL - 3810

SP - 27

EP - 38

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

T2 - Proceedings of the 1999 Radar Processing, Technology, and Applications IV

Y2 - 21 July 1999 through 22 July 1999

ER -

Discrete chirp-Fourier transform

摘要

其它文件与链接

指纹

引用此