z-logo
open-access-imgOpen Access
Near‐optimal estimation of radar pulse modulation waveform
Author(s) -
Ru XiaoHu,
Liu Zheng,
Huang ZhiTao,
Jiang WenLi
Publication year - 2016
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2015.0273
Subject(s) - waveform , ambiguity function , modulation (music) , computer science , estimator , algorithm , radar , frequency modulation , signal (programming language) , mathematics , telecommunications , physics , bandwidth (computing) , acoustics , statistics , programming language
In this study, the authors focus on pulse modulation waveform estimation based on a sequence of intercepted pulses from the same radar emitter. In general, modulation waveform estimators first perform pulse alignment in time and frequency separately, and then accumulate the aligned pulses to estimate the waveform. However, commonly used alignment methods may lead to considerable alignment errors which are difficult to detect and compensate, especially under low signal‐to‐noise ratio (SNR) conditions, resulting in non‐ideal effects of accumulation. This study proposes a robust and nearly optimal modulation waveform estimation algorithm. The new algorithm first aligns pulses in time and frequency jointly via the cross‐ambiguity function to avoid the transfer and accumulation of alignment errors. After that, an iterative maximum‐likelihood estimator is invoked to achieve the waveform estimation. Theoretical analysis and extensive experiments show that the proposed algorithm has much smaller alignment errors and better modulation waveform and modulation parameter estimation ability than competing methods at low SNRs, and can approach the ideal case. Moreover, this algorithm does not make any assumption on the type of modulation and is computationally efficient, thus having broad applications.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here