Radar Signal Recovery using Compressive Sampling Matching Pursuit Algorithm

2016 ◽  
Vol 67 (1) ◽  
pp. 94 ◽  
Author(s):  
M Sreenivasa Rao ◽  
K Krishna Naik ◽  
K Maheshwara Reddy
Keyword(s):  
Matching Pursuit ◽  
Sampling Rate ◽  
Recovery Process ◽  
Wide Frequency Range ◽  
Compressive Sampling ◽  
Radar Signal ◽  
Signal Recovery ◽  
Time Frequency ◽  
Receiver System ◽  
Radar Signals

In this study, we propose compressive sampling matching pursuit (CoSaMP) algorithm for sub-Nyquist based electronic warfare (EW) receiver system. In compressed sensing (CS) theory time-frequency plane localisation and discretisation into a N×N grid in union of subspaces is established. The train of radar signals are sparse in time and frequency can be under sampled with almost no information loss. The CS theory may be applied to EW digital receivers to reduce sampling rate of analog to digital converter; to improve radar parameter resolution and increase input bandwidth. Simulated an efficient approach for radar signal recovery by CoSaMP algorithm by using a set of various sample and different sparsity level with various radar signals. This approach allows a scalable and flexible recovery process. The method has been satisfied with data in a wide frequency range up to 40 GHz. The simulation shows the feasibility of our method.

scholarly journals Estimating the Instantaneous Frequency of Linear and Nonlinear Frequency Modulated Radar Signals—A Comparative Study

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2840
Author(s):  
Hubert Milczarek ◽  
Czesław Leśnik ◽  
Igor Djurović ◽  
Adam Kawalec
Keyword(s):  
Instantaneous Frequency ◽  
Early Warning Systems ◽  
Vital Role ◽  
Estimation Methods ◽  
Radar Signal ◽  
Nonlinear Frequency ◽  
Modulation Recognition ◽  
Electronic Warfare ◽  
Time Frequency ◽  
Radar Signals

Automatic modulation recognition plays a vital role in electronic warfare. Modern electronic intelligence and electronic support measures systems are able to automatically distinguish the modulation type of an intercepted radar signal by means of real-time intra-pulse analysis. This extra information can facilitate deinterleaving process as well as be utilized in early warning systems or give better insight into the performance of hostile radars. Existing modulation recognition algorithms usually extract signal features from one of the rudimentary waveform characteristics, namely instantaneous frequency (IF). Currently, there are a small number of studies concerning IF estimation methods, specifically for radar signals, whereas estimator accuracy may adversely affect the performance of the whole classification process. In this paper, five popular methods of evaluating the IF–law of frequency modulated radar signals are compared. The considered algorithms incorporate the two most prevalent estimation techniques, i.e., phase finite differences and time-frequency representations. The novel approach based on the generalized quasi-maximum likelihood (QML) method is also proposed. The results of simulation experiments show that the proposed QML estimator is significantly more accurate than the other considered techniques. Furthermore, for the first time in the publicly available literature, multipath influence on IF estimates has been investigated.

Least Support Orthogonal Matching Pursuit Algorithm With Prior Information

2014 ◽  
Vol 6 (2) ◽  
pp. 111-134 ◽  
Author(s):  
Israa Sh. Tawfic ◽  
Sema Koc Kayhan
Keyword(s):  
Numerical Experiments ◽  
Prior Information ◽  
Matching Pursuit ◽  
Recovery Process ◽  
Orthogonal Matching Pursuit ◽  
Sparse Signal Recovery ◽  
Sparse Signals ◽  
Signal Recovery ◽  
Reconstruction Performance ◽  
Matching Pursuit Algorithm

Abstract This paper proposes a new fast matching pursuit technique named Partially Known Least Support Orthogonal Matching Pursuit (PKLS-OMP) which utilizes partially known support as a prior knowledge to reconstruct sparse signals from a limited number of its linear projections. The PKLS-OMP algorithm chooses optimum least part of the support at each iteration without need to test each candidate independently and incorporates prior signal information in the recovery process. We also derive sufficient condition for stable sparse signal recovery with the partially known support. Result shows that inclusion of prior information weakens the condition on the sensing matrices and needs fewer samples for successful reconstruction. Numerical experiments demonstrate that PKLS-OMP performs well compared to existing algorithms both in terms of reconstruction performance and execution time.

Separation of Intercepted Multi-Radar Signals Based on Parameterized Time-Frequency Analysis

Frequenz ◽  
2016 ◽  
Vol 70 (9-10) ◽  
Author(s):  
W. L. Lu ◽  
J. W. Xie ◽  
H. M. Wang ◽  
C. Sheng
Keyword(s):  
Frequency Analysis ◽  
Simulated Data ◽  
Radar Signal ◽  
Electronic Warfare ◽  
Time Frequency Analysis ◽  
Time Frequency ◽  
Frequency Domains ◽  
Stationary Signals ◽  
Radar Signals ◽  
Electronic Intelligence

AbstractModern radars use complex waveforms to obtain high detection performance and low probabilities of interception and identification. Signals intercepted from multiple radars overlap considerably in both the time and frequency domains and are difficult to separate with primary time parameters. Time–frequency analysis (TFA), as a key signal-processing tool, can provide better insight into the signal than conventional methods. In particular, among the various types of TFA, parameterized time-frequency analysis (PTFA) has shown great potential to investigate the time–frequency features of such non-stationary signals. In this paper, we propose a procedure for PTFA to separate overlapped radar signals; it includes five steps: initiation, parameterized time-frequency analysis, demodulating the signal of interest, adaptive filtering and recovering the signal. The effectiveness of the method was verified with simulated data and an intercepted radar signal received in a microwave laboratory. The results show that the proposed method has good performance and has potential in electronic reconnaissance applications, such as electronic intelligence, electronic warfare support measures, and radar warning.

scholarly journals A Radar Signal Recognition Approach via IIF-Net Deep Learning Models

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Ji Li ◽  
Huiqiang Zhang ◽  
Jianping Ou ◽  
Wei Wang
Keyword(s):  
Recognition Accuracy ◽  
Signal To Noise Ratio ◽  
Recognition Rate ◽  
Software Radio ◽  
Radar Signal ◽  
Signal Recognition ◽  
Electromagnetic Environment ◽  
Time Frequency ◽  
Low Snr ◽  
Radar Signals

In the increasingly complex electromagnetic environment of modern battlefields, how to quickly and accurately identify radar signals is a hotspot in the field of electronic countermeasures. In this paper, USRP N210, USRP-LW N210, and other general software radio peripherals are used to simulate the transmitting and receiving process of radar signals, and a total of 8 radar signals, namely, Barker, Frank, chaotic, P1, P2, P3, P4, and OFDM, are produced. The signal obtains time-frequency images (TFIs) through the Choi–Williams distribution function (CWD). According to the characteristics of the radar signal TFI, a global feature balance extraction module (GFBE) is designed. Then, a new IIF-Net convolutional neural network with fewer network parameters and less computation cost has been proposed. The signal-to-noise ratio (SNR) range is −10 to 6 dB in the experiments. The experiments show that when the SNR is higher than −2 dB, the signal recognition rate of IIF-Net is as high as 99.74%, and the signal recognition accuracy is still 92.36% when the SNR is −10 dB. Compared with other methods, IIF-Net has higher recognition rate and better robustness under low SNR.

scholarly journals An Intra-Pulse Modulation Type Recognition Algorithm for Radar Signals Based on the Improved Residual Network

2021 ◽  
Vol 2050 (1) ◽  
pp. 012009
Author(s):  
Fan Wang ◽  
Yifeng Huang ◽  
Ming Zhu ◽  
Jun Tang ◽  
Zhaohong Jia
Keyword(s):  
Loss Function ◽  
Pulse Signal ◽  
Recognition Algorithm ◽  
Radar Signal ◽  
Residual Network ◽  
Pulse Modulation ◽  
Time Frequency ◽  
Signal Features ◽  
Modulation Type ◽  
Radar Signals

Abstract For purpose of solve the problem of poor discrimination and robustness of intra-pulse signal features extracted by the traditional methods, this paper proposes a radar signal intra-pulse modulation type recognition algorithm based on the improved residual network. Firstly, one-dimensional time-domain radar signal is converted into two-dimensional time-frequency image by Smoothing Pseudo Wigner-Ville Distribution; Then the time-frequency image is preprocessed; ResNet-50 network is chosen as the framework. In order to retain the feature map information as much as possible, the convolution kernel is increased in the residual module. The cross entropy loss function and the center loss function are used as the loss function to speed up the convergence of the network. The improved residual network is used to realize the intra-pulse modulation type recognition of radar signal. The simulation experiments show that when the SNR is -14dB, the overall average recognition accuracy of the improved algorithm for eight kinds of radar signals (CM, LFM, NLFM, BLFM, BPSK, QPSK, OPSK, LFM+BPSK) can reach 97.29%, which shows the effectiveness.

Reconfigurable FPGA/GPU-Based Architecture of Block Compressive Sampling Matching Pursuit Algorithm

2015 ◽  
Vol 24 (04) ◽  
pp. 1550055 ◽  
Author(s):  
Amin Jarrah ◽  
Mohsin M. Jamali
Keyword(s):  
Matching Pursuit ◽  
Recursive Algorithm ◽  
Software Tool ◽  
Compressive Sampling ◽  
Radar Signal ◽  
Sparse Signal ◽  
Graphic Processing Units ◽  
Compression Technique ◽  
User Input ◽  
Computationally Intensive

The signals in reality are sparse signal where a few numbers of samples are non-zero. So, a compression technique must be applied to reduce the overhead of processing, storing, and transmission. Blocking compressive sampling matching pursuit (BCoSaMP) algorithm is a recursive algorithm which provides an accurate reconstruction of sparse signal from a small number of noisy samples. It doesn't assume that the noise is Gaussian or bounded but it uses information about the noise magnitude for stopping criterion. However, BCoSaMP is a computationally intensive algorithm. So, BCoSaMP algorithm has been implemented on both field-programmable gate array (FPGA) and graphic processing units (GPU) by exploiting parallel and pipelining approaches. A new software tool called radar signal processing tool (RSPT) is also presented. It allows the designer to auto-generate fully optimized VHDL representation of BCoSaMP by specifying many user input parameters through graphical user interface (GUI). Moreover, it provides the designer a feedback on various performance parameters. This offer the designer the ability to make any adjustments to the BCoSaMP component until gets the desired performance of the overall system-on-chip (SoC). Our simulation results indicate that the achieved speed-up of FPGA and GPU over the sequential one is improved by up to 14 and 10.7, respectively.

scholarly journals Detection of Polyphase Codes Radar Signals in Low SNR

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Runlan Tian ◽  
Guoyi Zhang ◽  
Rui Zhou ◽  
Wei Dong
Keyword(s):  
Hough Transform ◽  
Signal To Noise Ratio ◽  
Superior Performance ◽  
Radar Signal ◽  
Time Frequency ◽  
Low Snr ◽  
Radar Signals ◽  
Core Idea ◽  
Code Type ◽  
Electronic Intelligence

A novel effective detection method is proposed for electronic intelligence (ELINT) systems detecting polyphase codes radar signal in the low signal-to-noise ratio (SNR) scenario. The core idea of the proposed method is first to calculate the time-frequency distribution of polyphase codes radar signals via Wigner-Ville distribution (WVD); then the modified Hough transform (HT) is employed to cumulate all the energy of WVD’s ridges effectively to achieve signal detection. Compared with the generalised Wigner Hough transform (GWHT) method, the proposed method has a superior performance in low SNR and is not sensitive to the code type. Simulation results verify the validity of the proposed method.

Image Reconstruction Based on Compressive Sensing via CoSaMP

2014 ◽  
Vol 631-632 ◽  
pp. 436-440 ◽  
Author(s):  
Lin Zhang
Keyword(s):  
Image Reconstruction ◽  
Compressive Sensing ◽  
Matching Pursuit ◽  
Curvelet Transform ◽  
Stopping Rule ◽  
Compressive Sampling ◽  
New Method ◽  
Signal Recovery ◽  
Recovery Algorithm ◽  
Number Of Iterations

Compressive Sampling Matching Pursuit (CoSaMP) is a new iterative recovery algorithm which has splendid theoretical guarantees for convergence and delivers the same guarantees as the best optimization-based approaches. In this paper, we propose a new signal recovery framework which combines CoSaMP and Curvelet transform for better performance. In classic CoSaMP, the number of iterations is fixed. We discuss a new stopping rule to halting the algorithm in this paper. In addition, the choice of several adjustable parameters in algorithm such as the number of measurements and the sparse level of the signal also will impact the performance. So we gain above parameters via a large number of experiments. According to experiments, we determine an optimum value for the parameters to use in this application. The experiments show that the new method not only has better recovery quality and higher PSNRs, but also can achieve optimization steadily and effectively.

scholarly journals Marine Distributed Radar Signal Identification and Classification Based on Deep Learning

2021 ◽  
Vol 38 (5) ◽  
pp. 1541-1548
Author(s):  
Chang Liu ◽  
Ruslan Antypenko ◽  
Iryna Sushko ◽  
Oksana Zakharchenko ◽  
Ji Wang
Keyword(s):  
Neural Network ◽  
Deep Learning ◽  
Frequency Domain ◽  
Detection Algorithm ◽  
Radar Signal ◽  
Signal Identification ◽  
Time Frequency ◽  
Weight Calculation ◽  
Radar Signals ◽  
Frequency Features

Distributed radar is applied extensively in marine environment monitoring. In the early days, the radar signals are identified inefficiently by operators. It is promising to replace manual radar signal identification with machine learning technique. However, the existing deep learning neural networks for radar signal identification consume a long time, owing to autonomous learning. Besides, the training of such networks requires lots of reliable time-frequency features of radar signals. This paper mainly analyzes the identification and classification of marine distributed radar signals with an improved deep neural network. Firstly, the time frequency features were extracted from signals based on short-time Fourier transform (STFT) theory. Then, a target detection algorithm was proposed, which weighs and fuses the heterogenous marine distributed radar signals, and four methods were provided for weight calculation. After that, the frequency-domain priori model feature assistive training was introduced to train the traditional deep convolutional neural network (DCNN), producing a CNN with feature splicing operation. The features of time- and frequency-domain signals were combined, laying the basis for radar signal classification. Our model was proved effective through experiments.

scholarly journals A Multipulse Radar Signal Recognition Approach via HRF-Net Deep Learning Models

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Ji Li ◽  
Huiqiang Zhang ◽  
Jianping Ou ◽  
Wei Wang
Keyword(s):  
Deep Learning ◽  
Feature Fusion ◽  
Signal To Noise Ratio ◽  
Software Radio ◽  
Radar Signal ◽  
Time Frequency ◽  
Recognition Result ◽  
Electronic Countermeasure ◽  
Radar Signals ◽  
Deep Learning Model

In the field of electronic countermeasure, the recognition of radar signals is extremely important. This paper uses GNU Radio and Universal Software Radio Peripherals to generate 10 classes of close-to-real multipulse radar signals, namely, Barker, Chaotic, EQFM, Frank, FSK, LFM, LOFM, OFDM, P1, and P2. In order to obtain the time-frequency image (TFI) of the multipulse radar signal, the signal is Choi–Williams distribution (CWD) transformed. Aiming at the features of the multipulse radar signal TFI, we designed a distinguishing feature fusion extraction module (DFFE) and proposed a new HRF-Net deep learning model based on this module. The model has relatively few parameters and calculations. The experiments were carried out at the signal-to-noise ratio (SNR) of −14 ∼ 4 dB. In the case of −6 dB, the recognition result of HRF-Net reached 99.583% and the recognition result of the network still reached 97.500% under −14 dB. Compared with other methods, HRF-Nets have relatively better generalization and robustness.

Sign in / Sign up

Export Citation Format

Share Document