Angle estimation for bistatic MIMO radar with unknown mutual coupling based on three-way compressive sensing

The problem of angle estimation for bistatic multiple-input multiple-output radar in the present of unknown mutual coupling (MC) is investigated, and a three-way compressive sensing (TWCS) estimation algorithm is developed. To exploit the inherent multi-dimensional structure of received data, a trilinear tensor model is firstly formulated. Then the de-coupling operation is followed. Thereafter, the high-order singular value decomposition is applied to compress the high dimensional tensor to a much smaller one. The estimation of the compressed direction matrices are linked to the compressed trilinear model, and finally two over-complete dictionaries are constructed for angle estimation. Also, Cramer-Rao bounds for angle and MC estimation are derived. The proposed TWCS algorithm is effective from the perspective of estimation accuracy as well as the computational complexity, and it can achieve automatically paired angle estimation. Simulation results show that the proposed method has much better estimation accuracy than the existing algorithms in the low signal-to-noise ratio scenario, and its estimation performance is very close to the parallel factor analysis (PARAFAC) algorithm at the high SNR regions. © 2017 Beijing Institute of Aerospace Information.

Adaptive block greedy algorithms for receiving multi-narrowband signal in compressive sensing radar reconnaissance receiver

This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications.

Face hallucination via compressive sensing

Face hallucination or super-resolution is an inverse problem which is underdetermined,and the compressive sensing(CS)theory provides an effective way of seeking inverse problem solutions.In this paper,a novel compressive sensing based face hallucination method is presented,which is comprised of three steps:dictionary learning、sparse coding and solving maximum a posteriori(MAP)formulation.In the first step,the K-SVD dictionary learning algorithm is adopted to obtain a dictionary which can sparsely represent high resolution(HR)face image patches.In the second step,we seek the sparsest representation for each low-resolution(LR)face image paches input using the learned dictionary,super resolution image blocks are obtained from the sparsest coefficients and dictionaries,which then are assembled into super-resolution(SR)image.Finally,MAP formulation is introduced to satisfy the consistency restrictive condition and obtain the higher quality HR images.The experimental results demonstrate that our approach can achieve better super-resolution faces compared with other state-of-the-art method.

Digital broadcast channel estimation with compressive sensing

In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the European Telecommunication Standards Institute（ETSI） digital radio mondiale （DRM） standard, the subspace pursuit （SP） algorithm is employed for delay spread and attenuation estimation of each path in the case where the channel profile is identified and the multipath number is known. The stop condition for SP is that the sparsity of the estimation equals the multipath number. For the case where the multipath number is unknown, the orthogonal matching pursuit （OMP） algorithm is employed for channel estimation, while the stop condition is that the estimation achieves the noise variance. Simulation results show that with the same number of pilots, CS algorithms outperform the traditional cubic-spline-interpolation-based least squares （LS） channel estimation. SP is also demonstrated to be better than OMP when the multipath number is known as a priori.

A Novel UWB Signal Sampling Method for Localization based on Compressive Sensing

Ultra-wide-band (UWB) signals are suitable for localization, since their high time resolution can provide precise time of arrival (TOA) estimation. However, one major challenge in UWB signal processing is the requirement of high sampling rate which leads to complicated signal processing and expensive hardware. In this paper, we present a novel UWB signal sampling method called UWB signal sampling via temporal sparsity (USSTS). Its sampling rate is much lower than Nyquist rate. Moreover, it is implemented in one step and no extra processing unit is needed. Simulation results show that USSTS can not recover the signal precisely, but for the use in localization, the accuracy of TOA estimation is the same as that in traditional methods. Therefore, USSTS gives a novel and effective solution for the use of UWB signals in localization.

Novel imaging methods of stepped frequency radar based on compressed sensing

The theory of compressed sensing （CS） provides a new chance to reduce the data acquisition time and improve the data usage factor of the stepped frequency radar system. In light of the sparsity of radar target reflectivity, two imaging methods based on CS, termed the CS-based 2D joint imaging algorithm and the CS-based 2D decoupled imaging algorithm, are proposed. These methods incorporate the coherent mixing operation into the sparse dictionary, and take random measurements in both range and azimuth directions to get high resolution radar images, thus can remarkably reduce the data rate and simplify the hardware design of the radar system while maintaining imaging quality. Ex- periments from both simulated data and measured data in the anechoic chamber show that the proposed imaging methods can get more focused images than the traditional fast Fourier trans- form method. Wherein the joint algorithm has stronger robustness and can provide clearer inverse synthetic aperture radar images, while the decoupled algorithm is computationally more efficient but has slightly degraded imaging quality, which can be improved by increasing measurements or using a robuster recovery algorithm nevertheless.

Root imaging from ground penetrating radar data by CPSO-OMP compressed sensing

As the amount of data produced by ground penetrating radar （GPR） for roots is large, the transmission and the storage of data consumes great resources. To alleviate this problem, we propose here a root imaging algorithm using chaotic particle swarm optimal （CPSO） compressed sensing based on GPR data according to the sparsity of root space. Radar data are decomposed, observed, measured and represented in sparse manner, so roots image can be reconstructed with limited data. Firstly, radar signal measurement and sparse representation are implemented, and the solution space is established by wavelet basis and Gauss random matrix; secondly, the matching function is considered as the fitness function, and the best fitness value is found by a PSO algorithm; then, a chaotic search was used to obtain the global optimal operator; finally, the root image is reconstructed by the optimal operators. A-scan data, B-scan data, and complex data from American GSSI GPR is used, respectively, in the experimental test. For B-scan data, the computation time was reduced 60 % and PSNR was improved 5.539 dB; for actual root data imaging, the reconstruction PSNR was 26.300 dB, and total computation time was only 67.210 s. The CPSO-OMP algorithm overcomes the problem of local optimum trapping and comprehensively enhances the precision during reconstruction.

Joint 2D DOA and Doppler frequency estimation for L-shaped array using compressive sensing

A joint two-dimensional(2D)direction-of-arrival(DOA)and radial Doppler frequency estimation method for the L-shaped array is proposed in this paper based on the compressive sensing(CS)framework.Revised from the conventional CS-based methods where the joint spatial-temporal parameters are characterized in one large scale matrix,three smaller scale matrices with independent azimuth,elevation and Doppler frequency are introduced adopting a separable observation model.Afterwards,the estimation is achieved by L1-norm minimization and the Bayesian CS algorithm.In addition,under the L-shaped array topology,the azimuth and elevation are separated yet coupled to the same radial Doppler frequency.Hence,the pair matching problem is solved with the aid of the radial Doppler frequency.Finally,numerical simulations corroborate the feasibility and validity of the proposed algorithm.

Low sidelobe robust imaging in random frequency-hopping wideband radar based on compressed sensing

High resolution range imaging with correlation processing suffers from high sidelobe pedestal in random frequency-hopping wideband radar. After the factors which affect the sidelobe pedestal being analyzed, a compressed sensing based algorithm for high resolution range imaging and a new minimized ll-norm criterion for motion compensation are proposed. The random hopping of the transmitted carrier frequency is converted to restricted isometry property of the observing matrix. Then practical problems of imaging model solution and signal parameter design are resolved. Due to the particularity of the proposed algorithm, two new indicators of range profile, i.e., average signal to sidelobe ratio and local similarity, are defined. The chamber measured data are adopted to testify the validity of the proposed algorithm, and simulations are performed to analyze the precision of velocity measurement as well as the performance of motion compensation. The simulation results show that the proposed algorithm has such advantages as high precision velocity measurement, low sidelobe and short period imaging, which ensure robust imaging for moving targets when signal-to-noise ratio is above 10 dB.

Compressive sensing based multiuser detector for massive MBM MIMO uplink

Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.

Video Coding Based on Compressive Sensing via CoSaMP

Compressive sampling matching pursuit （CoSaMP） algorithm integrates the idea of combining algorithm to ensure running speed and provides rigorous error bounds which provide a good theoretical guarantee to convergence. And compressive sensing （CS） can help us ease the pressure of hardware facility from the requirements of the huge amount in information processing. Therefore, a new video coding framework was proposed, which was based on CS and curvelet transform in this paper. Firstly, this new framework uses curvelet transform and CS to the key frame of test sequence, and then gains recovery frame via CoSaMP to achieve data compress. In the classic CoSaMP method, the halting criterion is that the number of iterations is fixed. Therefore, a new stopping rule is discussed to halting the algorithm in this paper to obtain better performance. According to a large number of experimental results, we ran see that this new framework has better performance and lower RMSE. Through the analysis of the experimental data, it is found that the selection of number of measurements and sparsity level has great influence on the new framework. So how to select the optimal parameters to gain better performance deserves worthy of further study.

NOVEL METHOD OF MOVING TARGET DETECTION FOR DUAL-CHANNEL WAS RADAR BASED ON COMPRESSED SENSING

We propose a ground moving target detection method for dual-channel Wide Area Surveillance(WAS) radar based on Compressed Sensing(CS).Firstly,the method of moving target detection of the WAS radar is studied.In order to reduce the sample data quantity of the radar,the echo data is randomly sampled in the azimuth direction,then,the matched filter is used to perform the range direction focus.We can use the compressive sensing theory to recover the signal in the Doppler domain.At last,the phase difference between the two channels is compensated to suppress the clutter.The result of the simulated data verifies the effectiveness of the proposed method.

Robust signal recovery algorithm for structured perturbation compressive sensing

It is understood that the sparse signal recovery with a standard compressive sensing（CS） strategy requires the measurement matrix known as a priori. The measurement matrix is, however, often perturbed in a practical application.In order to handle such a case, an optimization problem by exploiting the sparsity characteristics of both the perturbations and signals is formulated. An algorithm named as the sparse perturbation signal recovery algorithm（SPSRA） is then proposed to solve the formulated optimization problem. The analytical results show that our SPSRA can simultaneously recover the signal and perturbation vectors by an alternative iteration way, while the convergence of the SPSRA is also analytically given and guaranteed. Moreover, the support patterns of the sparse signal and structured perturbation shown are the same and can be exploited to improve the estimation accuracy and reduce the computation complexity of the algorithm. The numerical simulation results verify the effectiveness of analytical ones.

Compressive Sensing Approaches for Lithographic Source and Mask Joint Optimization

Source and mask joint optimization(SMO)is a widely used computational lithography method for state-of-the-art optical lithography process to improve the yield of semiconductor wafers.Nowadays,computational efficiency has become one of the most challenging issues for the development of pixelated SMO techniques.Recently,compressive sensing(CS)theory has be explored in the area of computational inverse problems.This paper proposes a CS approach to improve the computational efficiency of pixel-based SMO algorithms.To our best knowledge,this paper is the first to develop fast SMO algorithms based on the CS framework.The SMO workflow can be separated into two stages,i.e.,source optimization(SO)and mask optimization(MO).The SO and MO are formulated as the linear CS and nonlinear CS reconstruction problems,respectively.Based on the sparsity representation of the source and mask patterns on the predefined bases,the SO and MO procedures are implemented by sparse image reconstruction algorithms.A set of simulations are presented to verify the proposed CS-SMO methods.The proposed CS-SMO algorithms are shown to outperform the traditional gradient-based SMO algorithm in terms of both computational efficiency and lithography imaging performance.

Degradation algorithm of compressive sensing

The compressive sensing （CS） theory allows people to obtain signal in the frequency much lower than the requested one of sampling theorem. Because the theory is based on the assumption of that the location of sparse values is unknown, it has many constraints in practical applications. In fact, in many cases such as image processing, the location of sparse values is knowable, and CS can degrade to a linear process. In order to take full advantage of the visual information of images, this paper proposes the concept of dimensionality reduction transform matrix and then se- lects sparse values by constructing an accuracy control matrix, so on this basis, a degradation algorithm is designed that the signal can be obtained by the measurements as many as sparse values and reconstructed through a linear process. In comparison with similar methods, the degradation algorithm is effective in reducing the number of sensors and improving operational efficiency. The algorithm is also used to achieve the CS process with the same amount of data as joint photographic exports group （JPEG） compression and acquires the same display effect.

THE HIGH RESOLUTION MIMO RADAR SYSTEM BASED ON MINIMIZING THE STATISTICAL COHERENCE OF COMPRESSED SENSING MATRIX

Compressed Sensing (CS) theory is a great breakthrough of the traditional Nyquist sampling theory. It can accomplish compressive sampling and signal recovery based on the sparsity of interested signal, the randomness of measurement matrix and nonlinear optimization method of signal recovery. Firstly, the CS principle is reviewed. Then the ambiguity function of Multiple-Input Multiple-Output (MIMO) radar is deduced. After that, combined with CS theory, the ambiguity function of MIMO radar is analyzed and simulated in detail. At last, the resolutions of coherent and non-coherent MIMO radars on the CS theory are discussed. Simulation results show that the coherent MIMO radar has better resolution performance than the non-coherent. But the coherent ambiguity function has higher side lobes, which caused a deterioration in radar target detection performances. The stochastic embattling method of sparse array based on minimizing the statistical coherence of sensing matrix is proposed. And simulation results show that it could effectively suppress side lobes of the ambiguity function and improve the capability of weak target detection.

Estimation of Non-WSSUS Channel for OFDM Systems in High Speed Railway Environment Using Compressive Sensing

Non Wide Sense Stationary Uncorrelated Scattering (Non-WSSUS) is one of characteristics for high-speed railway wireless channels. In this paper, estimation of Non-WSSUS Channel for OFDM Systems is considered by using Compressive Sensing (CS) method. Given sufficiently wide transmission bandwidth, wireless channels encountered here tend to exhibit a sparse multipath structure. Then a sparse Non-WSSUS channel estimation approach is proposed based on the delay-Doppler-spread function representation of the channel. This approach includes two steps. First, the delay-Doppler-spread function is estimated by the Compressive Sensing (CS) method utilizing the delay-Doppler basis. Then, the channel is tracked by a reduced order Kalman filter in the sparse delay-Doppler domain, and then estimated sequentially. Simulation results under LTE-R standard demonstrate that the proposed algorithm significantly improves the performance of channel estimation, comparing with the conventional Least Square (LS) and regular CS methods.

Compressive Wideband Spectrum Sensing Based on Random Matrix Theory

Spectrum sensing in a wideband regime for cognitive radio network(CRN) faces considerably technical challenge due to the constraints on analog-to-digital converters(ADCs).To solve this problem,an eigenvalue-based compressive wideband spectrum sensing(ECWSS) scheme using random matrix theory(RMT) was proposed in this paper.The ECWSS directly utilized the compressive measurements based on compressive sampling(CS) theory to perform wideband spectrum sensing without requiring signal recovery,which could greatly reduce computational complexity and data acquisition burden.In the ECWSS,to alleviate the communication overhead of secondary user(SU),the sensors around SU carried out compressive sampling at the sub-Nyquist rate instead of SU.Furthermore,the exact probability density function of extreme eigenvalues was used to set the threshold.Theoretical analyses and simulation results show that compared with the existing eigenvalue-based sensing schemes,the ECWSS has much lower computational complexity and cost with no significant detection performance degradation.

Block Compressed Sensing Image Reconstruction Based on SL0 Algorithm

By applying smoothed l0norm（SL0）algorithm,a block compressive sensing（BCS）algorithm called BCS-SL0 is proposed,which deploys SL0 and smoothing filter for image reconstruction.Furthermore,BCS-ReSL0 algorithm is developed to use regularized SL0（ReSL0）in a reconstruction process to deal with noisy situations.The study shows that the proposed BCS-SL0 takes less execution time than the classical BCS with smoothed projected Landweber（BCS-SPL）algorithm in low measurement ratio,while achieving comparable reconstruction quality,and improving the blocking artifacts especially.The experiment results also verify that the reconstruction performance of BCS-ReSL0 is better than that of the BCSSPL in terms of noise tolerance at low measurement ratio.

COMPRESSED SPEECH SIGNAL SENSING BASED ON THE STRUCTURED BLOCK SPARSITY WITH PARTIAL KNOWLEDGE OF SUPPORT

Structural and statistical characteristics of signals can improve the performance of Compressed Sensing (CS). Two kinds of features of Discrete Cosine Transform (DCT) coefficients of voiced speech signals are discussed in this paper. The first one is the block sparsity of DCT coefficients of voiced speech formulated from two different aspects which are the distribution of the DCT coefficients of voiced speech and the comparison of reconstruction performance between the mixed program and Basis Pursuit (BP). The block sparsity of DCT coefficients of voiced speech means that some algorithms of block-sparse CS can be used to improve the recovery performance of speech signals. It is proved by the simulation results of the mixed program which is an improved version of the mixed program. The second one is the well known large DCT coefficients of voiced speech focus on low frequency. In line with this feature, a special Gaussian and Partial Identity Joint (GPIJ) matrix is constructed as the sensing matrix for voiced speech signals. Simulation results show that the GPIJ matrix outperforms the classical Gaussian matrix for speech signals of male and female adults.