基于欠定盲源分离的同步跳频信号网台分选

针对同步跳频(FH)网台分选问题,该文提出一种基于时频域单源点检测的欠定盲源分离(UBSS)分选算法.该算法首先对观测信号时频变换,利用自适应阈值去噪算法消除时频矩阵背景噪声,增加算法抗噪性能,然后根据信号绝对方位差算法进行单源点检测,有效保证单源点的充分稀疏性,并通过改进的模糊值聚类算法完成混合矩阵和2维波达方向估计,降低噪声和样本集分布差异对聚类结果的影响,提高估计精度.最后采用变步长的稀疏自适应子空间追踪(SASP)算法对源信号进行重构恢复.仿真实验表明,该算法在低信噪比(SNR)条件下,跳频信号波达方向估计和恢复精度较高,能够有效完成同步跳频信号的盲分离.     

未知阵列流形条件下波达方向—多普勒频率盲估计方法

本文研究阵列信号高分辩波达方向－多普勒频率二维估计问题，在未精确已知阵列流形条件下，利用到达波信号的多普勒频率，提出了一种波达方向－多普勒频率盲估计的新方法，理论分析和计算机仿真结果表明此方法在实际阵列存在增益和相位误差时益有效，而且现有二维估计算法相比，其运算量较小。     

未知阵列流形条件下波达方向一多普勒频率盲估计方法

本文研究阵列信号高分辨波达方向-多普勒频率二维估计问题,在未精确已知阵列流形条件下,利用到达波信号的多普勒频率,提出了一种波达方向-多普勒频率盲估计的新方法。理论分析和计算机仿真结果表明此方法在实际阵列存在增益和相位误差时亦有效,而且与现有二维估计算法相比,其运算量较小。     

基于MUSIC和LCMV的自适应波束形成系统

提出了在基于来波方向估计和自适应波束成形的相控阵天线系统中,用多重信号分类(MUSIC)算法实现来波方向估计,并使用线性约束最小方差(LCMV)的自适应算法控制天线的主瓣方向,实现对期望信号的跟踪,同时实现对干扰信号的零陷处理。仿真结果表明,MUSIC算法可以有效识别相控阵天线接收端的信号的入射方向,LCMV算法可以实现对有用信号的自适应跟踪和对干扰信号的抑制。     

多径信道中基于盲波束成形的CDMA多用户检测和伪码估计

在分析阵列天线接收的多径CDMA信号的基础上,发掘阵列信号子空间与扩频用户伪码序列的关系,对传统的子空间波束成形器结构做了改进,提出一种新的基于盲波束成形的伪随机码序列盲估计算法。算法采用复独立分量分析法迭代,得到盲波束成形器系数,能在波达方向未知的情况下,估计各个用户的扩频序列。本文同时提出一种基于盲波束形成的异步多径CDMA信号多用户检测算法,可以在未知各个用户扩频码和波达方向的先验知识条件下,完成多径异步CDMA信号的多用户检测。算法由于同时利用了扩频增益和阵列天线分集增益,相比于单天线多用户检测算法性能有所提高。理论分析和仿真结果验证了算法的可行性。      

基于正交投影变换的弱信号波达方向估计

提出了一种基于强信号阵列流形矩阵的正交投影变换的弱信号波达方向估计算法,该算法通过构造已知强信号阵列流形矩阵的正交投影矩阵,对阵列接收的数据矢量进行预变换,抑制强信号对弱信号波达方向估计的影响。文中算法只需对数据矢量进行正交投影变换,复杂度低,运算量小。将MUSIC算法、JJM算法和文中算法进行了比较,结果表明文中算法在存在多个强信号条件下能够有效估计多个弱信号的波达方向。     

小波变换在智能天线波束形成技术中应用

智能天线是当前研究热点之一,首先介绍了波束形成的基本原理,按照盲算法和非盲算法将现有的波束形成算法进行分类并比较了算法的性能;其次,比较了基于小波变换和基于小波包的自适应波束形成算法,分析了基于小波变换的多分辨信号波达方向和基于小波神经网络的波束形成算法;最后,针对小波变换可在选择最优基方面和结合盲自适应算法进行联合分析方面进行了展望。     

阵列方向矩阵Moore-Penrose逆的波达方向估计

针对弱信号且源数未知情况下的波达方向估计问题,传统方法是先估计源数目再进行波达方向估计,但源数目估计的误差会造成波达方向估计精度下降。本文提出一种阵列方向矩阵的Moore-Penrose逆和MUSIC（MUltiple SIgnal Classification）算法的联合波达方向估计方法,充分利用Moore-Penrose逆的盲源数波达方向估计和MUSIC算法的高精度的优势。该方法无需预先估计源数目就可进行波达方向估计。通过仿真实验并与传统方法比较,表明本文提出的方法具有更高的精度,特别是在低信噪比情况下,具有更强的鲁棒性。      

多小区大规模阵列天线系统盲解码算法

针对多小区大规模阵列天线系统中干扰小区的导频复用造成的导频污染和解码性能下降问题,提出了基于ICA（独立分量分析）盲解码算法。所提盲解码算法,利用ICA法对接收多小区用户信号进行分离解码,不需要发射导频序列,避免了导频污染,提高了解码性能。所提盲解码算法在解码过程中同时估计各个用户波达方向,利用波达方向信息克服ICA方法分离顺序的不确定性,识别期望用户的信号。理论分析和仿真结果表明,所提盲解码方法比广泛应用的MMSE解码算法和最近提出的基于特征值的盲解码方法具有更好的性能。     

基于欠定盲源分离的同步跳频信号网台分选

针对同步跳频(FH)网台分选问题,该文提出一种基于时频域单源点检测的欠定盲源分离(UBSS)分选算法.该算法首先对观测信号时频变换,利用自适应阈值去噪算法消除时频矩阵背景噪声,增加算法抗噪性能,然后根据信号绝对方位差算法进行单源点检测,有效保证单源点的充分稀疏性,并通过改进的模糊值聚类算法完成混合矩阵和2维波达方向估计...     

Equivariant adaptive selective transmission

In this paper, we consider the problem of selective transmission-the dual of the blind source separation task-in which a set of independent source signals are adaptively premixed prior to a nondispersive physical mixing process so that each source can be independently monitored in the far field. Following similar procedures for information-theoretic blind source separation, we derive a stochastic gradient algorithm for iteratively estimating the premixing matrix in the selective transmission problem, and through a simple modification, we obtain a second algorithm whose performance is equivariant with respect to the channel's mixing characteristics. The local stability conditions for the algorithms about any selective transmission solution are shown to be the same as those for similar source separation algorithms. Practical implementation issues are discussed, including the estimation of the combined system matrix and the reordering and scaling of the received signals within the algorithm. Mean square error-based selective transmission algorithms are also derived for performance comparison purposes. Simulations indicate the useful behavior of the premixing algorithms for selective transmission     

带源个数估计的BPSK信号盲分离算法

目前盲分离研究已有算法众多,但有关数字信号或有限字符集的盲分离研究尚不多见,而带源个数估计的此类盲分离算法更鲜有涉及。针对这类问题,该文提出了一种新颖的BPSK数字信号的盲分离算法,首先由接收到的观测信号的特征,在无噪和有噪情况下分别给出了估计源信号的数目算法;然后再利用观测信号之间的关系估计出混叠矩阵,并在算法中给出了证明。通过估计的混叠矩阵即可恢复得到分离信号,此时得到的分离信号与源信号或者顺序发生了交换,或者产生了符号之间的差别,但并不影响盲分离。最后的仿真结果显示了该文提出的算法在估计混叠矩阵以及最后恢复源信号上都是非常成功,也表明了此算法的可行性和优异性能。     

Robust spatial time-frequency distribution matrix estimation with application to direction-of-arrival estimation

We consider the problem of estimating spatial time-frequency distribution (STFD) matrices in the presence of impulsive noise. STFD matrices are widely used in sensor array processing for direction-of-arrival estimation and blind source separation of non-stationary sources. Conventional methods fail when the noise is non-Gaussian or impulsive. We propose robust techniques for STFD estimation which are based on pre-processing, robust position based estimation and robust covariance based estimation. The proposed methods are compared in terms of direction-of-arrival estimation performance.     

Equivariant adaptive source separation

Source separation consists of recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation that implements an adaptive version of equivariant estimation and is henceforth called equivariant adaptive separation via independence (EASI). The EASI algorithms are based on the idea of serial updating. This specific form of matrix updates systematically yields algorithms with a simple structure for both real and complex mixtures. Most importantly, the performance of an EASI algorithm does not depend on the mixing matrix. In particular, convergence rates, stability conditions, and interference rejection levels depend only on the (normalized) distributions of the source signals. Closed-form expressions of these quantities are given via an asymptotic performance analysis. The theme of equivariance is stressed throughout the paper. The source separation problem has an underlying multiplicative structure. The parameter space forms a (matrix) multiplicative group. We explore the (favorable) consequences of this fact on implementation, performance, and optimization of EASI algorithms     

有噪复杂度寻踪的新算法

复杂度寻踪是投影寻踪向时间序列数据,即具有时间结构信号的扩展。该方法是和具有时间依赖特性的源信号的盲分离和独立成分分析紧密联系的。在源信号是具有时间依赖特性和存在高斯噪声的情况下,现有的有噪复杂度寻踪算法没有给出自回归系数的估计方法,影响了算法的实际应用,提出了有噪复杂度寻踪的新算法,该算法给出了自回归系数的估计方法。对自然图像和人工信号的仿真表明了提出算法的有效性,和现有的盲源分离算法相比较,提出算法具有好的信号分离性能。      

Matrix-Group Algorithm via Improved Whitening Process for Extracting Statistically Independent Sources From Array Signals

This paper addresses the problem of blind separation of multiple independent sources from observed array output signals. The main contributions in this paper include an improved whitening scheme for estimation of signal subspace, a novel biquadratic contrast function for extraction of independent sources, and an efficient alterative method for joint implementation of a set of approximate diagonalization-structural matrices. Specifically, an improved whitening scheme is first developed by estimating the signal subspace jointly from a set of diagonalization-structural matrices based on the proposed cyclic maximizer of an interesting cost function. Moreover, the globally asymptotical convergence of the proposed cyclic maximizer is analyzed and proved. Next, a novel biquadratic contrast function is proposed for extracting one single independent component from a slice matrix group of any order cumulant of the array signals in the presence of temporally white noise. A fast fixed-point algorithm that is a cyclic minimizer is constructed for searching a minimum point of the proposed contrast function. The globally asymptotical convergence of the proposed fixed-point algorithm is analyzed. Then, multiple independent components are obtained by using repeatedly the proposed fixed-point algorithm for extracting one single independent component, and the orthogonality among them is achieved by the well-known QR factorization. The performance of the proposed algorithms is illustrated by simulation results and is compared with three related blind source separation algorithms     

MIMO Instantaneous Blind Identification Based on Second-Order Temporal Structure

Blind identification is a crucial subtask in signal processing problems such as blind signal separation (BSS) and direction-of-arrival (DOA) estimation. This paper presents a procedure for multiple-input multiple-output instantaneous blind identification based on second-order temporal properties of the signals, such as coloredness and nonstationarity. The procedure consists of two stages. First, based on assumptions on the second-order temporal structure (SOTS) of the source and noise signals, and using subspace techniques, the problem is reformulated in a particular way such that each column of the unknown mixing matrix satisfies a system of multivariate homogeneous polynomial equations. Then, this nonlinear system of equations is solved by means of a so-called homotopy method, which provides a general tool for solving (possibly nonexact) systems of nonlinear equations by smoothly deforming the known solutions of a simple start system into the desired solutions of the target system. Our blind identification procedure allows to estimate the mixing matrix for scenarios with more sources than sensors without resorting to sparsity assumptions, something that is often believed to be impossible when using only second-order statistics. In addition, since our algorithm does not require any assumption on the mixing matrix, also mixing matrices that are rank-deficient or even have identical columns can be identified. Finally, we give examples and performance results for speech source signals.      

Simple, Robust, and Memory-Efficient FastICA Algorithms Using the Huber M-Estimator Cost Function

The goal of blind source separation is to separate multiple signals from linear mixtures without extensive knowledge about the statistical properties of the unknown signals. The design of separation criteria that achieve accurate and robust source estimates within a simple adaptive algorithm is an important part of this task. The purpose of this paper is threefold: (1) We introduce the Huber M-estimator cost function as a contrast function for use within prewhitened blind source separation algorithms such as the well-known and popular FastICA algorithm of Hyvärinen and Oja. The resulting algorithm obtained from this cost is particularly simple to implement. We establish key properties regarding the local stability of the algorithm for general non-Gaussian source distributions, and its separating capabilities are shown through analysis to be largely insensitive to the cost function’s single threshold parameter. (2) We illustrate the use of the Huber M-estimator cost as a criterion within the winning algorithm entry for the blind source separation portion of the first Machine Learning for Signal Processing Workshop Data Analysis Competition, describing the key features of the algorithm design for successful separation of large-scale and ill-conditioned signal mixtures with reduced data set requirements. (3) We show how the FastICA algorithm can be implemented without significant additional memory resources by careful use of sequential processing strategies.     

未知源信号峭度正负性的盲分离

大多数的盲分离算法假设源信号峭度的正负性是己知的，并据此选择相应的非线性函数近似评价函数(score function)。针对源信号峭度的正负性未知的情况，本文提出了一个评价函数的参数估计方法，本算法能有效地分离混合在一起的超高斯信号和亚高斯信号，仿真结果验证了算法的有效性。     

基于偏度和时序结构的声音信号盲抽取算法研究

信号盲抽取是盲信号处理领域的热点研究方向,它仅抽取感兴趣的信号,能有效减小运算量,解决盲分离中信号顺序不确定性的难题,因而在生物医学信号分析（如EEG、MEG、fMRI等）、语音和图像识别领域得到广泛应用。针对传统的基于时序结构的盲抽取算法存在较弱的抗噪性和对时延估计误差比较敏感的不足,论文提出了将偏度和时序结构相结合的信号盲抽取算法。该算法首先利用偏度的非对称性来度量分离信号的非高斯性,以减弱噪声,同时减小了传统的利用峭度度量非高斯性方法的运算量;其次利用基音周期作为声音信号的最佳时延估计,以实现对感兴趣信号的盲抽取,将两者结合后使得算法对时延估计误差不敏感,且对噪声更具鲁棒性。仿真实验部分选取了标准TIMIT语料库中一男、两女分别单独朗读同一语句的语音信号,盲抽取的实验结果表明:本文算法与文献3中算法相比具有较好的分离效果且抽取速度快,与文献4中算法相比分离效果相当但大大地提高了抽取速度,从而验证了本文算法的有效性。