Blind identification and DOA estimation for array sources in presence of scattering

A novel identification method for point source,coherently distributed（CD） source and incoherently distributed（ICD） source is proposed.The differences among the point source,CD source and ICD source are studied.According to the different characters of covariance matrix and general steering vector of the array received source,a second order blind identification method is used to separate the sources,the mixing matrix could be obtained.From the mixing matrix,the type of the source is identified by using an amplitude criterion.And the direction of arrival for the array received source is estimated by using the matching pursuit algorithm from the vectors of the mixing matrix.Computer simulations validate the efficiency of the method.

A Modal Identification Algorithm Combining Blind Source Separation and State Space Realization

A modal identification algorithm is developed, combining techniques from Second Order Blind Source Separation (SOBSS) and State Space Realization (SSR) theory. In this hybrid algorithm, a set of correlation matrices is generated using time-shifted, analytic data and assembled into several Hankel matrices. Dissimilar left and right matrices are found, which diagonalize the set of nonhermetian Hankel matrices. The complex-valued modal matrix is obtained from this decomposition. The modal responses, modal auto-correlation functions and discrete-time plant matrix (in state space modal form) are subsequently identified. System eigenvalues are computed from the plant matrix to obtain the natural frequencies and modal fractions of critical damping. Joint Approximate Diagonalization (JAD) of the Hankel matrices enables the under determined (more modes than sensors) problem to be effectively treated without restrictions on the number of sensors required. Because the analytic signal is used, the redundant complex conjugate pairs are eliminated, reducing the system order (number of modes) to be identified half. This enables smaller Hankel matrix sizes and reduced computational effort. The modal auto-correlation functions provide an expedient means of screening out spurious computational modes or modes corresponding to noise sources, eliminating the need for a consistency diagram. In addition, the reduction in the number of modes enables the modal responses to be identified when there are at least as many sensors as independent (not including conjugate pairs) modes. A further benefit of the algorithm is that identification of dissimilar left and right diagonalizers preclude the need for windowing of the analytic data. The effectiveness of the new modal identification method is demonstrated using vibration data from a 6 DOF simulation, 4-story building simulation and the Heritage court tower building.

SUBSPACE METHOD FOR BLIND IDENTIFICATION OF CDMA TIME-VARYING CHANNELS

A new blind method is proposed for identification of CDMA Time-Varying (TV)channels in this paper. By representing the TV channel's impulse responses in the delay-Doppler spread domain, the discrete-time canonical model of CDMA-TV systems is developed and a subspace method to identify blindly the Time-Invariant (TI) coordinates is proposed. Unlike existing basis expansion methods, this new algorithm does not require .estimation of the base frequencies, neither need the assumption of linearly varying delays across symbols. The algorithm offers definite explanation of the expansion coordinates. Simulation demonstrates the effectiveness of the algorithm.

Robust Blind Separation for MIMO Systems against Channel Mismatch Using Second-Order Cone Programming

To improve the deteriorated capacity gain and source recovery performance due to channel mismatch problem,this paper reports a research about blind separation method against channel mismatch in multiple-input multiple-output(MIMO) systems.The channel mismatch problem can be described as a channel with bounded fluctuant errors due to channel distortion or channel estimation errors.The problem of blind signal separation/extraction with channel mismatch is formulated as a cost function of blind source separation(BSS) subject to the second-order cone constraint,which can be called as second-order cone programing optimization problem.Then the resulting cost function is solved by approximate negentropy maximization using quasi-Newton iterative methods for blind separation/extraction source signals.Theoretical analysis demonstrates that the proposed algorithm has low computational complexity and improved performance advantages.Simulation results verify that the capacity gain and bit error rate(BER) performance of the proposed blind separation method is superior to those of the existing methods in MIMO systems with channel mismatch problem.

BLIND IDENTIFICATION OF A CLASS OF NONLINEAR SYSTEMS WITH CYCLOSTATIONARY INPUT

This letter deals with blind identification of nonlinear discrete Hammerstein system under the input signal that is cyclostationary. The first-order moment of the specific input as well as the inverse nonlinear mapping of the Hammerstein model are combined to establish a relationship between the system output and the system parameters, which implies an approach to identifying the system blindly. Simulation results demonstrate the effectiveness of this approach to blind identification of a class of nonlinear systems.

Time-shared channel identification for adaptive noise cancellation in breath sound extraction

Noise artifacts are one of the key obstacles in applying continuous monitoring and computer-assisted analysis of lung sounds. Traditional adaptive noise cancellation (ANC) methodologies work reasonably well when signal and noise are stationary and independent. Clinical lung sound auscultation encounters an acoustic environment in which breath sounds are not stationary and often correlate with noise. Consequendy, capability of ANC becomes significantly compromised. This paper introduces a new methodology for extracting authentic lung sounds from noise-corrupted measurements. Unlike traditional noise cancellation methods that rely on either frequency band separation or signal/noise independence to achieve noise reduction, this methodology combines the traditional noise canceling methods with the unique feature of time-split stages in breathing sounds. By employing a multi-sensor system, the method first employs a high-pass filter to eliminate the off-band noise, and then performs time-shared blind identification and noise cancellation with recursion from breathing cycle to cycle. Since no frequency separation or signal/noise independence is required, this method potentially has a robust and reliable capability of noise reduction, complementing the traditional methods.

Distributed Fault Detection for Consensus in Second-Order Discrete-Time Multiagent Systems with Adversary

This paper is concerned with distributed fault detection of second-order discrete-time multi-agent systems with adversary,where the adversary is regarded as a slowly time-varying signal.Firstly,a novel intrusion detection scheme based on the theory of unknown input observability( UIO) is proposed. By constructing a bank of UIO,the states of the malicious agents can be directly estimated. Secondly,the faulty-node-removal algorithm is provided.Simulations are also provided to demonstrate the effectiveness of the theoretical results.

基于盲源分离的工业谐波源负荷分类识别方法

针对传统谐波源辨识方法无法实现工业用户谐波源具体类型的非侵入式识别的问题,该文提出一种基于盲源分离的工业谐波源负荷分类识别方法。该方法仅依据工业用户进线处电压、电流数据即可实现谐波源负荷具体类型的非侵入式识别。首先,从负荷等值阻抗模型入手,建立工业用户多负荷等值阻抗并联电路模型;其次,采用集合经验模态分解与奇异值分解相结合的方法确定构成用户进线处监测点综合等值阻抗信号的源阻抗信号数目;然后,采用快速独立分量分析实现将谐波源负荷等值阻抗信号从综合负荷等值阻抗信号中分离;最后,将分离出谐波源负荷等值阻抗信号频率特征与典型谐波源负荷进行匹配,进而实现分类识别。仿真与实测实验结果均表明,所提方法能够准确识别工业用户所含多种谐波源负荷的具体类型,具有较好的可行性和实用性。

基于编码矩阵估计的极化码参数盲识别算法

针对当前极化码参数识别算法缺少对码字起点的识别以及识别信息位算法计算复杂的问题,提出一种基于编码矩阵估计的极化码参数盲识别算法。所提算法首先将截获的码字矩阵、相应码长下的克罗内克矩阵以及逆向重排矩阵相乘得到编码矩阵估计,然后通过编码矩阵的分布特征识别出码长和码字起点,最后使用训练好的卷积神经网络对极化码信息位以及冻结位进行识别。实验结果表明,所提方法不仅完成了码字起点的识别,而且在未知码字起点的情况下完成了对码长的识别,且码长的识别准确率优于现有算法,误比特率在0.19时,参数为(32,12)的极化码码长识别率仍然可以达到90%以上。

基于复杂度追踪的模态参数识别方法对比研究

复杂度追踪(complexity pursuit, CP)是求解振动信号盲源分离(blind source separation, BSS)问题的一类经典方法。用复杂度追踪估计解混矩阵主要有基于源信号复杂度计算的梯度下降(complexity pursuit-gradient descent, CP-GD)算法和基于时间可预测度的广义特征值分解(temporal predictability-generalized eigenvalue decomposition, TP-GED)算法。当前,这两种算法的关联性与算法性能尚缺乏研究,因此对这两种算法的等价性和计算性能进行了研究。首先,给出CP-GD和TP-GED两种算法的具体理论及算法流程;其次,利用二、三自由度振动系统直观地展示并对比解混向量对应的源信号复杂度及可预测度的变化规律;最后,通过对多工况下多自由度系统的模态参数识别算例,对比研究两种算法的精度及计算量。研究结果表明:在低阻尼比及高信噪比条件下,两种方法得到的解混矩阵是相同的;考虑到计算信号复杂度和梯度下降较为耗时,CP-GD算法计算代价要高于TP-GED算法。

Bi-iterative least squares algorithms for blind channel identification and equalization with second-order statistics

We present an adaptive algorithm for blind identification and equalization of single-input multiple-output （SIMO） FIR channels with second-order statistics. We first reformulate the blind channel identification problem into a low-rank matrix approximation solution based on the QR decomposition of the received data matrix. Then, a fast recursive algorithm is developed based on the bi-iterative least squares （Bi-LS） subspace tracking method. The new algorithm requires only a computational complexity of O（md2） at each iteration, or even as low as O（md） if only equalization is necessary, where m is the dimension of the received data vector （or the row rank of channel matrix） and d is the dimension of the signal subspace （or the column rank of channel matrix）. To overcome the shortcoming of the back substitution, an inverse QR iteration algorithm for subspace tracking and channel equalization is also developed. The inverse QR iteration algorithm is well suited for the parallel implementation in the systolic array. Simulation results are presented to illustrate the effectiveness of the proposed algorithms for the channel identification and equalization.

基于解析二阶盲辨识的结构工作模态分析及真假模态区分

自动获取运行中的模态参数对于大型土木结构的健康状态实时在线监测具有重要意义。针对现有方法模态分辨困难的问题,提出了一种基于解析二阶盲辨识的工作模态分析方法,并相应提出了真假模态区分方法以实现模态参数自动识别。与传统方法不同,该方法无需引入稳定图,可直接从结构振动响应中有效分离出各阶模态响应。通过构造模态特征指标和K均值聚类实现真假模态自动区分,并采用频域参数拟合法估计模态参数。通过8自由度数值算例和混凝土重力拱坝工程实例对该文方法效果进行了验证。结果表明:该方法具有较好的模态自动分离和筛选能力,对固有频率、阻尼比和振型的识别精度均较高,尤其对于密集模态的识别具有显著优势。

基于四阶相关的时分多址调制数据独特码盲识别

针对非合作通信中时分多址(TDMA)信号的独特码(UW)盲识别问题,该文首次提出分布式独特码的盲识别算法。区别于比特层的独特码识别算法,该文分别针对集中式独特码和分布式独特码,提出面向调制数据不同窗口之间相关性的波形层独特码识别算法。算法利用独特码的一致性与相关性,分两步进行,首先通过差分累积消除不同突发信号间频偏与相偏的影响,来纵向对齐各个突发信号的独特码,然后通过多层差分共轭4阶相关算法识别出独特码的位置和长度。仿真分析了不同突发个数、信噪比和有无频偏相偏情况下算法的性能,验证了波形层识别独特码的有效性,针对集中式独特码和分布式独特码,所提算法在信噪比为5 dB时均达到了95%以上的识别率,具有一定的工程应用价值。

基于深层神经网络的信道编码类型盲识别

为了解决当前识别算法只能识别一种或者两种码字类型以及人工提取特征复杂的问题,提出了两种基于深层神经网络模型的信道编码类型识别器,即卷积神经网络(convolutional neural network,CNN)识别器和递归CNN(recursive CNN,RCNN)识别器,用于识别接收数据中不同类型的信道码字。将待识别的软解调序列作为自然语言处理中文本分类问题的句子向量进行处理,输入到预先训练好的深层神经网络识别器中进行识别,并分析了字长度对识别准确率的影响,得出了最合适的字长度。实验结果表明,两种识别器都能够有效识别接收数据中多种类型的信道编码,且在信噪比为3 dB时CNN识别器的识别准确率能够达到99%以上,而RCNN识别器在1 dB时就能够达到99%以上的识别准确率。

结构运营模态参数识别的稀疏分量分析新方法

结合时频掩码技术和模糊C均值聚类,提出一种结构运营模态参数识别新方法。该方法根据结构振动响应的能量信息建立时频掩码,通过时频掩码求解结构模态响应,采用单自由度模态参数识别技术从模态响应中识别模态频率和阻尼比。结构振动响应能量峰值处的时频系数被依次提取,经单源点检测后采用模糊C均值聚类对其聚类,将第一个聚类中心作为模态振型。通过数值案例和框架结构试验验证所提方法的有效性。结果表明,所提方法具有良好的模态参数识别精度和噪声鲁棒性。

基于PRP共轭梯度法求解代价函数的RSC码参数识别算法

Turbo码是一种常用的信道编码方式,正确识别Turbo码首先要正确识别其子递归系统卷积(recursive system convolutional,RSC)码,由于信道噪声与干扰引发误码,这就要求识别算法具有良好的抗误码性能以及识别能力。利用解调软判决序列,通过编码码元约束方程,构建指数形式的代价函数模型,将识别RSC码的生成矩阵问题转化为求解代价函数全域极值的最优化问题,最后在共轭梯度法的基础上,采用新的PRP步长因子来寻找全域极值点。仿真结果表明,所提算法与现有算法相比,收敛速度更快,在低信噪比下也有良好的识别能力。

盲语音去混响研究综述

盲语音去混响作为语音信号处理领域的一个重要研究问题,在通信、人机交互、人工智能、生物医学工程和消费电子等多个领域具有广泛应用。根据声源是否已知,盲语音去混响主要分为两种方法:在声源未知的情况下对接收信号进行盲解卷积,或在已知声源的情况下对声源信号进行盲预补偿。本文在详细梳理该领域发展历程与研究成果的基础上,对这项技术的应用前景、主要研究方法、研究成果以及存在的问题进行了深入分析和论述,为该领域的进一步深入研究打下基础。

BLIND AND COMPLETE MODELING OF LINEAR SYSTEMS USING THIRD ORDER CUMULANTS

This paper presents a novel approach to structure determination of linear systems along with the choice of system orders and parameters. AutoRegressive （AR）, Moving Average （MA） or AutoRegressive-Moving Average （ARMA） model structure can be extracted blindly from the Third Order Cumulants （TOC） of the system output ts, where the unknown system is driven by an unobservable stationary independent identically distributed （i.i.d.） non-Gaussian signal. By means of the system order recursion, whether the system has an AR structure or has AR part of an ARMA structure is firstly investigated. MA features in the TOC domain is then applied as a threshold to decide if the system is an MA model or has MA part of an ARMA model. Numerical simulations illustrate the generality of the proposed blind structure identification methodology that may serve as a guideline for blind, linear system modeling.

A Novel Method for Identifying Recursive Systematic Convolutional Encoders Based on the Cuckoo Search Algorithm

The existing methods for identifying recursive systematic convolutional encoders with high robustness require to test all the candidate generator matrixes in the search space exhaustively.With the increase of the codeword length and constraint length,the search space expands exponentially,and thus it limits the application of these methods in practice.To overcome the limitation,a novel identification method,which gets rid of exhaustive test,is proposed based on the cuckoo search algorithm by using soft-decision data.Firstly,by using soft-decision data,the probability that a parity check equation holds is derived.Thus,solving the parity check equations is converted to maximize the joint probability that parity check equations hold.Secondly,based on the standard cuckoo search algorithm,the established cost function is optimized.According to the final solution of the optimization problem,the generator matrix of recursive systematic convolutional code is estimated.Compared with the existing methods,our proposed method does not need to search for the generator matrix exhaustively and has high robustness.Additionally,it does not require the prior knowledge of the constraint length and is applicable in any modulation type.

Blind Adaptive MMSE Equalization of Underwater Acoustic Channels Based on the Linear Prediction Method

The problem of blind adaptive equalization of underwater single-input multiple-output (SIMO) acoustic channels was analyzed by using the linear prediction method.Minimum mean square error (MMSE) blind equalizers with arbitrary delay were described on a basis of channel identification.Two methods for calculating linear MMSE equalizers were proposed.One was based on full channel identification and realized using RLS adaptive algorithms,and the other was based on the zero-delay MMSE equalizer and realized using LMS and RLS adaptive algorithms,respectively.Performance of the three proposed algorithms and comparison with two existing zero-forcing (ZF) equalization algorithms were investigated by simulations utilizing two underwater acoustic channels.The results show that the proposed algorithms are robust enough to channel order mismatch.They have almost the same performance as the corresponding ZF algorithms under a high signal-to-noise (SNR) ratio and better performance under a low SNR.