Simple and Efficient Nonparametric Method for Estimating the Number of Signals Without Eigendecomposition

Inspired by the computational simplicity and numerical stability of QR decomposition, a nonparametric method for estimating the number of signals without eigendecomposition (MENSE) is proposed for the coherent narrowband signals impinging on a uniform linear array (ULA). By exploiting the array geometry and its shift invariance property to decorrelate the coherency of signals through subarray averaging, the number of signals is revealed in the rank of the QR upper-trapezoidal factor of the autoproduct of a combined Hankel matrix formed from the cross correlations between some sensor data. Since the infection of additive noise is defused, signal detection capability is improved. A new detection criterion is then formulated in terms of the row elements of the QR upper-triangular factor when finite array data are available, and the number of signals is determined as a value of the running index for which this ratio criterion is maximized, where the QR decomposition with column pivoting is also used to improve detection performance. The statistical analysis clarifies that the MENSE detection criterion is asymptotically consistent. Furthermore, the proposed MENSE algorithm is robust against the array uncertainties including sensor gain and phase errors and mutual coupling and against the deviations from the spatial homogeneity of noise model. The effectiveness of the MENSE is verified through numerical examples, and the simulation results show that the MENSE is superior in detecting closely spaced signals with a small number of snapshots and/or at relatively low signal-to-noise ratio (SNR)     

Adaptive joint detection and decoding in flat-fading channels viamixture Kalman filtering

A novel adaptive Bayesian receiver for signal detection and decoding in fading channels with known channel statistics is developed; it is based on the sequential Monte Carlo methodology that has emerged in the field of statistics. The basic idea is to treat the transmitted signals as “missing data” and to sequentially impute multiple samples of them based on the observed signals. The imputed signal sequences, together with their importance weights, provide a way to approximate the Bayesian estimate of the transmitted signals and the channel states. Adaptive receiver algorithms for both uncoded and convolutionally coded systems are developed. The proposed techniques can easily handle the non-Gaussian ambient channel noise. It is shown through simulations that the proposed sequential Monte Carlo receivers achieve near-bound performance in fading channels for both uncoded and coded systems, without the use of any training/pilot symbols or decision feedback. Moreover, the proposed receiver structure exhibits massive parallelism and is ideally suited for high-speed parallel implementation using the very large scale integration (VLSI) systolic array technology     

Detection and estimation in sensor arrays using weighted subspacefitting

The problem of signal parameter estimation of narrowband emitter signals impinging on an array of sensors is addressed. A multidimensional estimation procedure that applies to arbitrary array structures and signal correlation is proposed. The method is based on the recently introduced weighted subspace fitting (WSF) criterion and includes schemes for both detecting the number of sources and estimating the signal parameters. A Gauss-Newton-type method is presented for solving the multidimensional WSF and maximum-likelihood optimization problems. The global and local properties of the search procedure are investigated through computer simulations. Most methods require knowledge of the number of coherent/noncoherent signals present. A scheme for consistently estimating this is proposed based on an asymptotic analysis of the WSF cost function. The performance of the detection scheme is also investigated through simulations     

基于Bessel先验快速稀疏贝叶斯学习的互质阵列DOA估计

为提高低采样点条件下互质阵列DOA估计精度,该文提出基于Bessel先验快速稀疏贝叶斯学习算法。该方法针对互质阵列输出的多采样点复数数据,首先构建了基于Bessel先验的多量测分层模型;其次推导了模型所涉超参数的对数似然函数,根据最大似然估计准则得到了超参数的迭代公式;最后提出了快速实现方案,提高了运算效率。仿真结果表明,该方法不依赖先验信息,在低采样点条件下具有更高的DOA估计精度和分辨率,能够对相干信号进行高精度DOA估计,并具有较高的运算效率。此外,该文探究了虚拟阵列扩展与互质阵列测向自由度扩展间的关联,为后续阵列误差条件下互质阵列DOA研究估计提供参考。     

Signal waveform estimation in the presence of uncertainties about the steering vector

We consider the problem of signal waveform estimation using an array of sensors where there exist uncertainties about the steering vector of interest. This problem occurs in many situations, including arrays undergoing deformations, uncalibrated arrays, scattering around the source, etc. In this paper, we assume that some statistical knowledge about the variations of the steering vector is available. Within this framework, two approaches are proposed, depending on whether the signal is assumed to be deterministic or random. In the former case, the maximum likelihood (ML) estimator is derived. It is shown that it amounts to a beamforming-like processing of the observations, and an iterative algorithm is presented to obtain the ML weight vector. For random signals, a Bayesian approach is advocated, and we successively derive an (approximate) minimum mean-square error estimator and maximum a posteriori estimators. Numerical examples are provided to illustrate the performances of the estimators.     

分集通道相关时MIMO雷达的检测算法

多输入多输出(MIMO)雷达利用波形分集或空间分集提高雷达性能,目标回波散射系数是全相关或者独立完全取决于阵列系统配置。然而,在有些情况下,雷达阵列系统配置导致散射系数部分相关,从而使MIMO雷达的检测性能受到影响。针对上述问题,文中研究了基于尼曼-皮尔逊准则下分集通道相关时MIMO雷达检测算法,推导检测概率与虚警概率的近似解析表达式,分析了分集通道相关性对MIMO雷达检测的影响。仿真结果验证了该算法的有效性。     

A suboptimal receiver for joint spatial-temporal filtering andmultiuser detection in mobile radio communications

This paper proposes a suboptimal receiver for joint spatial-temporal filtering and multiuser detection in mobile radio communications using single carrier signaling. The proposed receiver is a reasonable approximation of the maximum likelihood (ML) based optimal receiver described in the present paper. A cascaded connection of an adaptive array antenna and an ML multiuser sequence estimator is the basis of the proposed receiver. The major advantages of the proposed receiver over conventional adaptive array antennas are: (1) delayed path components of desired signals can be effectively combined; (2) interference signals exceeding the degree of freedom; and (3) those having the same incident angle as that of desired path components can both be suppressed. The proposed receiver does not require prohibitively large computational complexity. Results of computer simulations presented in this paper show that the proposed receiver exhibits excellent performance even in severe multipath fading environments     

共形阵列非圆信号波达方向估计算法

受共形载体变曲率结构的影响,各天线单元指向不尽相同,使得共形天线阵列呈现极化多样性。因此,共形天线阵列的建模过程中需考虑不同阵元的极化响应特性。基于柱面共形天线阵列的快拍数据模型,利用非圆信号的特性对阵列输出进行扩展,基于秩亏理论和子空间原理实现信号波达方向（DOA）估计,所提方法估计精度高,不需要参数配对。存在相干信源时,提出对扩展后的虚拟阵列进行划分,对划分出的子阵进行虚拟的空间平滑,实现解相干的预处理操作。仿真结果表明该方法能有效应用于柱面共形阵列非圆信号DOA估计,并提高了空间分辨率。      

Convolutive blind source separation by minimizing mutual information between segments of signals

A method to perform convolutive blind source separation of super-Gaussian sources by minimizing the mutual information between segments of output signals is presented. The proposed approach is essentially an implementation of an idea previously proposed by Pham. The formulation of mutual information in the proposed criterion makes use of a nonparametric estimator of Renyi's /spl alpha/-entropy, which becomes Shannon's entropy in the limit as /spl alpha/ approaches 1. Since /spl alpha/ can be any number greater than 0, this produces a family of criteria having an infinite number of members. Interestingly, it appears that Shannon's entropy cannot be used for convolutive source separation with this type of estimator. In fact, only one value of /spl alpha/ appears to be appropriate, namely /spl alpha/=2, which corresponds to Renyi's quadratic entropy. Four experiments are included to show the efficacy of the proposed criterion.     

Quasi maximum likelihood estimator of polynomial phase signals for compressed sensed data

Several papers in the literature cover parameter estimation of frequency modulated (FM) signals under reduced number of signal samples with respect to the Nyquist/Shannon criterion, i.e., within the compressive sensing (CS) framework. However, scope of these papers is mainly limited to sinusoids or sum of sinusoids. In this paper, the CS framework is extended to parameter estimation of higher order polynomial phase signals (PPSs) using the quasi-maximum likelihood (QML) estimator and robust short-time Fourier transform (STFT). The considered signal is assumed to be non-uniformly sampled PPS with smaller number of samples with respect to the Nyquist/Shannon criterion. However, the proposed technique can also be generalized to uniformly sampled signals with missing or unreliable samples.     

Design of partially adaptive array beamformers based on informationtheoretic criteria

In this paper, two basic problems in designing partially adaptive array beamformers based on the structure of generalized sidelobe canceller (GSC) are considered. The first problem is to decide the proper dimension of the required adaptive weight vector. Using the information of the array output power, we develop the detection formulas for the information theoretic criteria AIC and MDL to decide the proper dimension of the adaptive weight vector. If the input noise power is unknown a priori, efficient methods are proposed for estimating the input noise power in both cases, with and without the desired signal, to make the detection formulas still feasible. The second problem is to find the most appropriate channel signals for weight adaptation for efficiently canceling interference. An efficient method based on the maximum power reduction criterion is presented for selecting the most desired channel signals from the output of the signal blocking matrix. Theoretical analysis concerning the performance of the proposed methods is made. Computer simulations showing the effectiveness of the proposed methods are also provided     

Detection performance of the reduced-rank linear predictor ROCKET

This paper assesses the frequency detection capabilities of a new signal-dependent reduced-rank linear predictor applied to autoregressive spectrum estimation. The new technique is called reduced-order correlation kernel estimation technique (ROCKET). Its detection performance is examined by comparison to a full-rank autoregressive (FR-AR) estimator and two reduced-rank principal component autoregressive (PC-AR) estimators based on both the standard signal-independent version and a modified signal-dependent method. The performance of the new autoregressive estimator is also compared as a function of rank to the popular pseudo-spectrum estimator MUSIC. The performance metrics examined are the probability of detection (P/sub D/) and the false alarm rate (FAR) of detecting the spatial frequencies of plane waves impinging on a uniform line array in additive white Gaussian noise. These metrics are studied as a function of subspace rank, sample support, and signal-to-noise ratio (SNR). Simulations show that the signal-dependent reduced-rank estimators significantly outperform both the signal-independent version of PC-AR and the FR-AR estimator for low sample support and low SNR environments. One notable characteristic of ROCKET that highlights its distinct subspace selection is its performance as a function of subspace rank. It is observed that for equal powered signals, its peak performance is nearly invariant to signal rank and that at almost any subspace rank ROCKET meets or exceeds FR-AR performance. This provides an extra degree of robustness when the signal rank is unknown.     

A Bayesian Approach for Disturbance Detection and Classification and Its Application to State Estimation in Run-to-Run Control

With growing demand for effective management of abnormal situations in process industry, disturbance detection and classification has drawn considerable interest from researchers in both industry and academia. In this paper, a disturbance detection and classification method is developed using Bayesian statistics. The theoretical derivation of the proposed method as well as its practical implementation are provided. With the introduction of preand post-change windows, detection and classification are achieved simultaneously in the proposed method through matching the posterior probability pattern to predefined patterns. An overlapping window mechanism is incorporated into the proposed method to minimize detection and classification delay. A simulation example is given to illustrate the robustness and effectiveness of the proposed disturbance detection method. One application of the proposed Bayesian disturbance detection and classification algorithm is a Bayesian enhanced exponentially weighted moving average (B-EWMA) state estimator which improves state estimation in the run-to-run control of semiconductor manufacturing processes. The superior performance of B-EWMA compared to the conventional EWMA is demonstrated using an industrial example     

一类基于非线性PCA准则的复数信号盲分离算法

在阵列信号处理过程中，经常遇到复数信号盲分离问题。例如，卷积混合型的源信号的盲分离；声纳信号盲分离。本文提出了一类基于非线性准则的复数信号盲分离算法。将非线性函数引入学习过程，由算法自动调节学习速率。计算机仿真实验验证了算法的有效性，文中给出了验证结果。     

Approximate maximum likelihood estimators for array processing inmultiplicative noise environments

We consider the problem of localizing a source by means of a sensor array when the received signal is corrupted by multiplicative noise. This scenario is encountered, for example, in communications, owing to the presence of local scatterers in the vicinity of the mobile or due to wavefronts that propagate through random inhomogeneous media. Since the exact maximum likelihood (ML) estimator is computationally intensive, two approximate solutions are proposed, originating from the analysis of the high and low signal to-noise ratio (SNR) cases, respectively. First, starting with the no additive noise case, a very simple approximate ML (AML₁) estimator is derived. The performance of the AML₁ estimator in the presence of additive noise is studied, and a theoretical expression for its asymptotic variance is derived. Its performance is shown to be close to the Cramer-Rao bound (CRB) for moderate to high SNR. Next, the low SNR case is considered, and the corresponding AML₂ solution is derived. It is shown that the approximate ML criterion can be concentrated with respect to both the multiplicative and additive noise powers, leaving out a two-dimensional (2-D) minimization problem instead of a four-dimensional (4-D) problem required by the exact ML. Numerical results illustrate the performance of the estimators and confirm the validity of the theoretical analysis     

Localization of multiple sources with moving arrays

We consider the problem of localizing multiple narrowband stationary signals using an arbitrary time-varying array such as an array mounted on a moving platform. We assume a Gaussian stochastic model for the received signals and employ the generalized least squares (GLS) estimator to get an asymptotically efficient estimation of the model parameters. In case the signals are a priori known to be uncorrelated, the estimator allows the exploitation of this prior knowledge to its benefit. For the important case of a translational motion of a rigid array, a computationally efficient spatial-smoothing method is presented. Simulation results confirming the theoretical results are included