The problem of underdetermined blind source separation of adjacent satellite interference is proposed in this paper. Density Clustering algorithm(DC-algorithm) presented in this article is different from traditional m...The problem of underdetermined blind source separation of adjacent satellite interference is proposed in this paper. Density Clustering algorithm(DC-algorithm) presented in this article is different from traditional methods. Sparseness representation has been applied in underdetermined blind signal source separation. However, some difficulties have not been considered, such as the number of sources is unknown or the mixed matrix is ill-conditioned. In order to find out the number of the mixed signals, Short Time Fourier Transform(STFT) is employed to segment received mixtures. Then, we formulate the blind source signal as cluster problem. Furthermore, we construct Cost Function Pair and Decision Coordinate System by using density clustering. At the end of this paper, we discuss the performance of the proposed method and verify the novel method based on several simulations. We verify the proposed method on numerical experiments with real signal transmission, which demonstrates the validity of the proposed method.展开更多
This paper addresses the problem of Blind Source Separation (BSS) and presents a new BSS algorithm with a Signal-Adaptive Activation (SAA) function (SAA-BSS). By taking the sum of absolute values of the normalized kur...This paper addresses the problem of Blind Source Separation (BSS) and presents a new BSS algorithm with a Signal-Adaptive Activation (SAA) function (SAA-BSS). By taking the sum of absolute values of the normalized kurtoses as a contrast function, the obtained signal-adaptive activation function automatically satisfies the local stability and robustness conditions. The SAA-BSS exploits the natural gradient learning on the Stiefel manifold, and it is an equivariant algorithm with a moderate computational load. Computer simulations show that the SAA-BSS can perform blind separation of mixed sub-Gaussian and super-Gaussian signals and it works more efficiently than the existing algorithms in convergence speed and robustness against outliers.展开更多
基金supported by a grant from the national High Technology Research and development Program of China (863 Program) (No.2012AA01A502)National Natural Science Foundation of China (No.61179006)Science and Technology Support Program of Sichuan Province(No.2014GZX0004)
文摘The problem of underdetermined blind source separation of adjacent satellite interference is proposed in this paper. Density Clustering algorithm(DC-algorithm) presented in this article is different from traditional methods. Sparseness representation has been applied in underdetermined blind signal source separation. However, some difficulties have not been considered, such as the number of sources is unknown or the mixed matrix is ill-conditioned. In order to find out the number of the mixed signals, Short Time Fourier Transform(STFT) is employed to segment received mixtures. Then, we formulate the blind source signal as cluster problem. Furthermore, we construct Cost Function Pair and Decision Coordinate System by using density clustering. At the end of this paper, we discuss the performance of the proposed method and verify the novel method based on several simulations. We verify the proposed method on numerical experiments with real signal transmission, which demonstrates the validity of the proposed method.
基金Supported by the major program of the National Natural Science Foundation of China (No.60496311)the Chinese Postdoctoral Science Foundation (No.2004035061)the Foundation of Intel China Research Center.
文摘This paper addresses the problem of Blind Source Separation (BSS) and presents a new BSS algorithm with a Signal-Adaptive Activation (SAA) function (SAA-BSS). By taking the sum of absolute values of the normalized kurtoses as a contrast function, the obtained signal-adaptive activation function automatically satisfies the local stability and robustness conditions. The SAA-BSS exploits the natural gradient learning on the Stiefel manifold, and it is an equivariant algorithm with a moderate computational load. Computer simulations show that the SAA-BSS can perform blind separation of mixed sub-Gaussian and super-Gaussian signals and it works more efficiently than the existing algorithms in convergence speed and robustness against outliers.
