Jamming suppression is traditionally achieved through the use of spatial filters based on array signal processing theory.In order to achieve better jamming suppression performance,many studies have applied blind sourc...Jamming suppression is traditionally achieved through the use of spatial filters based on array signal processing theory.In order to achieve better jamming suppression performance,many studies have applied blind source separation(BSS)to jamming suppression.BSS can achieve the separation and extraction of the individual source signals from the mixed signal received by the array.This paper proposes a perspective to recognize BSS as spatial band-pass filters(SBPFs)for jamming suppression applications.The theoretical derivation indicates that the processing of mixed signals by BSS can be perceived as the application of a set of SBPFs that gate the source signals at various angles.Simulations are performed using radar jamming suppression as an example.The simulation results suggest that BSS and SBPFs produce approximately the same effects.Simulation results are consistent with theoretical derivation results.展开更多
Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not ...Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.展开更多
In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms accordin...In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms according to the correlation between received signals and hyper planes, which are composed by column vectors of the mixing matrix, and uses these atoms to recover source signals. Simulation results demonstrate that the PP algorithm has low complexity and higher accuracy as compared with basic pursuit(BP), orthogonal matching pursuit(OMP), and adaptive sparsity matching pursuit(ASMP) algorithms.展开更多
When the distribution of the sources cannot be estimated accurately, the ICA algorithms failed to separate the mixtures blindly. The generalized Gaussian model （GGM） is presented in ICA algorithm since it can model ...When the distribution of the sources cannot be estimated accurately, the ICA algorithms failed to separate the mixtures blindly. The generalized Gaussian model （GGM） is presented in ICA algorithm since it can model non- Ganssian statistical structure of different source signals easily. By inferring only one parameter, a wide class of statistical distributions can be characterized. By using maximum likelihood （ML） approach and natural gradient descent, the learning rules of blind source separation （BSS） based on GGM are presented. The experiment of the ship-radiated noise demonstrates that the GGM can model the distributions of the ship-radiated noise and sea noise efficiently, and the learning rules based on GGM gives more successful separation results after comparing it with several conventional methods such as high order cumnlants and Gaussian mixture density function.展开更多
A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, ...A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation （BSS） for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm.展开更多
An on-line blind source separation （BSS） algorithm is presented in this paper under the assumption that sources are temporarily correlated signals. By using only some of the observed samples in a recursive calculati...An on-line blind source separation （BSS） algorithm is presented in this paper under the assumption that sources are temporarily correlated signals. By using only some of the observed samples in a recursive calculation, the whitening matrix and the rotation matrix could be approximately obtained through the measurement of only one cost function. SimNations show goad performance of the algorithm.展开更多
This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time...This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.展开更多
Separation and recognition of radar signals is the key function of modern radar reconnaissance,which is of great sig-nificance for electronic countermeasures and anti-countermea-sures.In order to improve the ability o...Separation and recognition of radar signals is the key function of modern radar reconnaissance,which is of great sig-nificance for electronic countermeasures and anti-countermea-sures.In order to improve the ability of separating mixed signals in complex electromagnetic environment,a blind source separa-tion algorithm based on degree of cyclostationarity(DCS)crite-rion is constructed in this paper.Firstly,the DCS criterion is con-structed by using the cyclic spectrum theory.Then the algo-rithm flow of blind source separation is designed based on DCS criterion.At the same time,Givens matrix is constructed to make the blind source separation algorithm suitable for multiple sig-nals with different cyclostationary frequencies.The feasibility of this method is further proved.The theoretical and simulation results show that the algorithm can effectively separate and re-cognize common multi-radar signals.展开更多
By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. ...By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. Then, the mixing matrix, hopping frequencies, hopping instants and the hooping rate can be estimated by the K-means clustering algorithm. With the estimated mixing matrix, the directions of arrival（DOA） of source signals can be obtained. Then, the FH signals are sorted and the FH pattern is obtained. Finally, the shortest path algorithm is adopted to recover the time domain signals. Simulation results show that the correlation coefficient between the estimated FH signal and the source signal is above 0.9 when the signal-to-noise ratio（SNR） is higher than 0 d B and hopping parameters of multiple FH signals in the synchronous orthogonal FH network can be accurately estimated and sorted under the underdetermined conditions.展开更多
基金supported by the National Natural Science Foundation of China(6237104662201048)the Natural Science Foundation of Chongqing,China(cstc2020jcyj-msxmX0260).
文摘Jamming suppression is traditionally achieved through the use of spatial filters based on array signal processing theory.In order to achieve better jamming suppression performance,many studies have applied blind source separation(BSS)to jamming suppression.BSS can achieve the separation and extraction of the individual source signals from the mixed signal received by the array.This paper proposes a perspective to recognize BSS as spatial band-pass filters(SBPFs)for jamming suppression applications.The theoretical derivation indicates that the processing of mixed signals by BSS can be perceived as the application of a set of SBPFs that gate the source signals at various angles.Simulations are performed using radar jamming suppression as an example.The simulation results suggest that BSS and SBPFs produce approximately the same effects.Simulation results are consistent with theoretical derivation results.
基金the National Natural Science Foundation of China (60672061)
文摘Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.
基金supported by the National Natural Science Foundation of China(61201134)the 111 Project(B08038)
文摘In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms according to the correlation between received signals and hyper planes, which are composed by column vectors of the mixing matrix, and uses these atoms to recover source signals. Simulation results demonstrate that the PP algorithm has low complexity and higher accuracy as compared with basic pursuit(BP), orthogonal matching pursuit(OMP), and adaptive sparsity matching pursuit(ASMP) algorithms.
文摘When the distribution of the sources cannot be estimated accurately, the ICA algorithms failed to separate the mixtures blindly. The generalized Gaussian model （GGM） is presented in ICA algorithm since it can model non- Ganssian statistical structure of different source signals easily. By inferring only one parameter, a wide class of statistical distributions can be characterized. By using maximum likelihood （ML） approach and natural gradient descent, the learning rules of blind source separation （BSS） based on GGM are presented. The experiment of the ship-radiated noise demonstrates that the GGM can model the distributions of the ship-radiated noise and sea noise efficiently, and the learning rules based on GGM gives more successful separation results after comparing it with several conventional methods such as high order cumnlants and Gaussian mixture density function.
基金supported partly by the Key Program of National Natural Science Foundation of China (U0635001U0835003)+3 种基金the National Natural Science Foundation of China (60505005 60674033 60774094)the Natural Science Fundof Guangdong Province (05006508).
文摘A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation （BSS） for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm.
基金This project was supported by the National 863 project (2001AA422420 -02)
文摘An on-line blind source separation （BSS） algorithm is presented in this paper under the assumption that sources are temporarily correlated signals. By using only some of the observed samples in a recursive calculation, the whitening matrix and the rotation matrix could be approximately obtained through the measurement of only one cost function. SimNations show goad performance of the algorithm.
基金supported by the National Natural Science Foundation of China(61072120)
文摘This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.
基金supported by the National Natural Science Foundation of China(61502522).
文摘Separation and recognition of radar signals is the key function of modern radar reconnaissance,which is of great sig-nificance for electronic countermeasures and anti-countermea-sures.In order to improve the ability of separating mixed signals in complex electromagnetic environment,a blind source separa-tion algorithm based on degree of cyclostationarity(DCS)crite-rion is constructed in this paper.Firstly,the DCS criterion is con-structed by using the cyclic spectrum theory.Then the algo-rithm flow of blind source separation is designed based on DCS criterion.At the same time,Givens matrix is constructed to make the blind source separation algorithm suitable for multiple sig-nals with different cyclostationary frequencies.The feasibility of this method is further proved.The theoretical and simulation results show that the algorithm can effectively separate and re-cognize common multi-radar signals.
基金supported by the National Natural Science Foundation of China(6120113461201135)+2 种基金the 111 Project(B08038)the Fundamental Research Funds for the Central Universities(72124669)the Open Research Fund of the Academy of Application(2014CXJJ-TX06)
文摘By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. Then, the mixing matrix, hopping frequencies, hopping instants and the hooping rate can be estimated by the K-means clustering algorithm. With the estimated mixing matrix, the directions of arrival（DOA） of source signals can be obtained. Then, the FH signals are sorted and the FH pattern is obtained. Finally, the shortest path algorithm is adopted to recover the time domain signals. Simulation results show that the correlation coefficient between the estimated FH signal and the source signal is above 0.9 when the signal-to-noise ratio（SNR） is higher than 0 d B and hopping parameters of multiple FH signals in the synchronous orthogonal FH network can be accurately estimated and sorted under the underdetermined conditions.
