Specific Emitter Identification via Hilbert-Huang Transform in Single-Hop and Relaying Scenarios

In this paper, we investigate the specific emitter identification (SEI) problem, which distinguishes different emitters using features generated by the nonlinearity of the power amplifiers of emitters. SEI is performed by measuring the features representing the individual specifications of emitters...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information forensics and security 2016-06, Vol.11 (6), p.1192-1205
Hauptverfasser: Jingwen Zhang, Fanggang Wang, Dobre, Octavia A., Zhangdui Zhong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we investigate the specific emitter identification (SEI) problem, which distinguishes different emitters using features generated by the nonlinearity of the power amplifiers of emitters. SEI is performed by measuring the features representing the individual specifications of emitters and making a decision based on their differences. In this paper, the SEI problem is considered in both single-hop and relaying scenarios, and three algorithms based on the Hilbert spectrum are proposed. The first employs the entropy and the first- and second-order moments as identification features, which describe the uniformity of the Hilbert spectrum. The second uses the correlation coefficient as an identification feature, by evaluating the similarity between different Hilbert spectra. The third exploits Fisher's discriminant ratio to obtain the identification features by selecting the Hilbert spectrum elements with strong class separability. When compared with the existing literature, we further consider the identification problem in a relaying scenario, in which the fingerprint of different emitters is contaminated by the relay's fingerprints. Moreover, we explore the identification performance under various channel conditions, such as additive white Gaussian noise, non-Gaussian noise, and fading. Extensive simulation experiments are performed to evaluate the identification performance of the proposed algorithms, and results show their effectiveness in both single-hop and relaying scenarios, as well as under different channel conditions.
ISSN:1556-6013
1556-6021
DOI:10.1109/TIFS.2016.2520908