基于MCS-SBL算法的配电网故障定位方法

配电网拓扑结构复杂,传统方法往往需要大量测点信息且难以实现快速有效的故障定位,本文提出基于少量测点信息的故障定位方法。首先,利用等效原理建立一个欠定的故障节点电压方程;其次,利用多重测量向量模型的贝叶斯压缩感知算法求解方程,根据重构稀疏电流矩阵的非零元素位置求解故障区域,实现故障定位;最后,在IEEE33节点配电系统上进行仿真实验,结果表明,所提方法仅需要少量测点的故障前后正序电压分量便可有效定位故障,计算速度较快,并且基本不受故障类型、过渡电阻的影响,同时适用于单故障和多重故障的场景,具有较强的抗噪能力。

Airborne sparse flight array SAR 3D imaging based on compressed sensing in frequency domain

In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used for sparse flight sampling of airborne array SAR, in order to obtain high cross-track resolution in as few times of flights as possible. Under each flight, the imaging algorithm of back projection(BP) and the data extraction method based on modified uniformly redundant arrays(MURAs) are utilized to obtain complex 3D image pairs. To solve the side-lobe noise in images, the interferometry between each image pair is implemented, and compressed sensing(CS) reconstruction is adopted in the frequency domain. Furthermore, to restore the geometrical relationship between each flight, the phase information corresponding to negative MURA is compensated on each single-pass image reconstructed by CS. Finally,by coherent accumulation of each complex image, the high resolution in cross-track direction is obtained. Simulations and experiments in X-band verify the availability.

变化信道稀疏度的CSI反馈方法

在大规模多输入多输出(multiple input multiple output,MIMO)系统中,压缩感知(compressed sensing,CS)技术常用于具有稀疏特性的信道状态信息(channel state information,CSI)反馈。针对CS重构时信道稀疏度通常未知的问题,基于深度展开技术提出了一种变化信道稀疏度的CSI反馈方法(a CSI-feedback method for varying channel sparsity,AVCS)。AVCS将信道稀疏度作为训练参数,学习得到通用的网络架构。随着天线数量增大导致信道(矩阵)维度激增,学习网络所得的相互抑制矩阵会呈现二次增长问题,AVCS利用相互抑制矩阵托普利兹(Toeplitz)特性设计了降维卷积网络,解决CSI反馈时的计算复杂度问题。仿真结果表明,所提方法提高了在大规模MIMO系统下CSI重构的适用性,减少了反馈开销且对信道稀疏度具有鲁棒性。

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.

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.

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.

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.

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.

A CLASS OF DETERMINISTIC CONSTRUCTION OF BINARY COMPRESSED SENSING MATRICES

Compressed Sensing (CS) is an emerging technology in the field of signal processing, which can recover a sparse signal by taking very few samples and solving a linear programming problem. In this paper, we study the application of Low-Density Parity-Check (LDPC) Codes in CS. Firstly, we find a sufficient condition for a binary matrix to satisfy the Restricted Isometric Property (RIP). Then, by employing the LDPC codes based on Berlekamp-Justesen (B-J) codes, we construct two classes of binary structured matrices and show that these matrices satisfy RIP. Thus, the proposed matrices could be used as sensing matrices for CS. Finally, simulation results show that the performance of the proposed matrices can be comparable with the widely used random sensing matrices.

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.

AN ADAPTIVE MEASUREMENT SCHEME BASED ON COMPRESSED SENSING FOR WIDEBAND SPECTRUM DETECTION IN COGNITIVE WSN

An Adaptive Measurement Scheme (AMS) is investigated with Compressed Sensing (CS) theory in Cognitive Wireless Sensor Network (C-WSN). Local sensing information is collected via energy detection with Analog-to-Information Converter (AIC) at massive cognitive sensors, and sparse representation is considered with the exploration of spatial temporal correlation structure of detected signals. Adaptive measurement matrix is designed in AMS, which is based on maximum energy subset selection. Energy subset is calculated with sparse transformation of sensing information, and maximum energy subset is selected as the row vector of adaptive measurement matrix. In addition, the measurement matrix is constructed by orthogonalization of those selected row vectors, which also satisfies the Restricted Isometry Property (RIP) in CS theory. Orthogonal Matching Pursuit (OMP) reconstruction algorithm is implemented at sink node to recover original information. Simulation results are performed with the comparison of Random Measurement Scheme (RMS). It is revealed that, signal reconstruction effect based on AMS is superior to conventional RMS Gaussian measurement. Moreover, AMS has better detection performance than RMS at lower compression rate region, and it is suitable for large-scale C-WSN wideband spectrum sensing.

Reconstruction and transmission of astronomical image based on compressed sensing

In the process of image transmission, the famous JPEG and JPEG-2000 compression methods need more transmission time as it is difficult for them to compress the image with a low compression rate. Recently the compressed sensing（CS） theory was proposed, which has earned great concern as it can compress an image with a low compression rate, meanwhile the original image can be perfectly reconstructed from only a few compressed data. The CS theory is used to transmit the high resolution astronomical image and build the simulation environment where there is communication between the satellite and the Earth. Number experimental results show that the CS theory can effectively reduce the image transmission and reconstruction time. Even with a very low compression rate, it still can recover a higher quality astronomical image than JPEG and JPEG-2000 compression methods.

Construction of deterministic sensing matrix and its application to DOA estimation

Compressive sensing（CS） has emerged as a novel sampling framework which enables sparse signal acquisition and reconstruction with fewer measurements below the Nyquist rate.An important issue for CS is the construction of measurement matrix or sensing matrix.A new deterministic sensing matrix,named as OOC-B,is proposed by exploiting optical orthogonal codes（OOCs）,Bernoulli matrix and Singer structure,which has the entries of 0,＋1 and-1 before normalization.We have proven that the designed deterministic matrix is asymptotically optimal.In addition,the proposed deterministic sensing matrix is applied to direction of arrival（DOA） estimation of narrowband signals by CS arrays（CSA）processing and CS recovery.Theoretical analysis and simulation results show that the proposed sensing matrix has good performance for DOA estimation.It is very effective for simplifying hardware structure and decreasing computational complexity in DOA estimation by CSA processing.Besides,lower root mean square error（RMSE） and bias are obtained in DOA estimation by CS recovery.

Imaging algorithm of multi-ship motion target based on compressed sensing

An imaging algorithm based on compressed sensing（CS） for the multi-ship motion target is presented. In order to reduce the quantity of data transmission in searching the ships on a large sea area, both range and azimuth of the moving ship targets are converted into sparse representation under certain signal basis. The signal reconstruction algorithm based on CS at a distant calculation station, and the Keystone and fractional Fourier transform（FRFT） algorithm are used to compensate range migration and obtain Doppler frequency. When the sea ships satisfy the sparsity, the algorithm can obtain higher resolution in both range and azimuth than the conventional imaging algorithm. Some simulations are performed to verify the reliability and stability.

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.

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.