A Novel Algorithm for Clustering of Radar Interleaved Pulses in Busy Radar Environments
Publish place: The first international conference of modern research engineers in electricity and computer
Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 610
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CBCONF01_0969
تاریخ نمایه سازی: 16 شهریور 1395
Abstract:
Deinterleaving of radar pulses is performed based on features of pulse trains, including pulse arrival time, pulse width, radio frequency, and among others. Radar pulse deinterleaving is one of the most important parts of radar identification system in which identification/detection process of radar transmitters is done in simultaneous fashion. In this paper, a novel algorithm is proposed by the combination of Imperialist Competitive Algorithm, ICA, and k-means algorithm based on Rough set theory. The identification accuracy on radar data by this method was 78%, emphasizing the improved performance over the conventional methods. It will be shown that this new method can be successfully utilized in busy radar environments with various signals.
Keywords:
Authors
Navid Daryasafar
Faculty of Electrical Engineering Dashtestan Branch, Islamic Azad University Borazjan, iran
Hamid Dehghani
Faculty of Electrical Engineering Malek Ashtar University Tehran, Iran
Azim Rezaei Motlagh
Faculty of Electrical Engineering Dashtestan Branch, Islamic Azad University Borazjan, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :