基于贝叶斯压缩感知的子空间拟合离格DOA估计

针对传统的基于稀疏贝叶斯学习（Sparse Bayesian Learning,SBL）的波达方向估计算法对噪声鲁棒性不高的问题,提出了一种基于SBL的子空间拟合离格波达方向(Direction of Arrival,DOA)估计方法。首先对接收数据的协方差矩阵进行特征分解,获得信号的加权子空间,构造等价信号的稀疏表示模型并利用贝叶斯学习算法进行参数求解。同时对于网格划分带来的建模误差问题,采用了离格贝叶斯推导（Sparse Bayesian Inference,SBI）算法进行求解,利用期望最大化算法迭代更新相应的参数。仿真结果表明,相对于传统的DOA方法,该方法具有更好的估计精度。     

雷达高分辨率紧凑感知矩阵追踪算法

针对压缩感知雷达的感知矩阵相干系数随分辨率增加而增大以致不能以大概率对稀疏向量进行完美重构的问题,直接基于原始感知矩阵,提出紧凑感知矩阵追踪(CSMP)算法。该文将CSMP算法应用于十字阵雷达的2维波达方向(DOA)估计并进行了计算机仿真。仿真结果表明与多信号分类(MUSIC)算法,子空间追踪(SP)算法,基追踪(BP)算法和稀疏贝叶斯学习(SBL)算法相比,基于CSMP算法的DOA估计分辨率得到了较大提高。     

基于子空间的块稀疏信号压缩感知重构算法

块稀疏信号是一种典型的具有特殊结构的稀疏信号,在压缩感知问题中,针对块稀疏信号的特点,提出了一种基于子空间的块稀疏信号压缩感知重构算法.该算法每次迭代找到整个信号支撑块的估计,包含正确信号支撑块所在空间的一个子空间,然后计算残差,并在下一次迭代时,通过回溯思想和最小均方准则修正更新上一次找到的信号支撑块,最后直到残差为...     

酉稀疏贝叶斯学习降维MIMO雷达角度估计

针对收发共址多输入多输出（Multiple-Input Multiple-Output,MIMO）雷达的低计算复杂度波达方向（Direction of Arrival,DOA）估计问题,提出一种降维的MIMO雷达高精度DOA新算法。首先采用经过白化的降维矩阵对MIMO雷达脉冲压缩后的接收信号进行降维;然后通过最优信号子空间拟合对无幅度误差阵列流型下的接收信号矩阵进行重构;接下来通过酉变换得到实值增广数据矩阵,并在实值稀疏字典矩阵下对其进行稀疏表示;接着将DOA估计问题转化为行稀疏矩阵的稀疏恢复问题,通过改进的稀疏贝叶斯学习对其进行求解,实现目标DOA的估计。理论分析和仿真实验结果验证了该方法的有效性和实用性。     

基于贝叶斯压缩感知的跳频信号参数估计

针对跳频信号参数估计问题,提出一种基于贝叶斯压缩感知的方法。根据跳频信号的数学模型,将待估计的参数在给定的定义域内离散化构建过完备字典。由此,将参数估计问题转换为压缩感知邻域的稀疏表示问题。考虑到参数估计过程中存在的噪声干扰,采用贝叶斯压缩感知求解稀疏表示系数。根据稀疏表示系数的非零元素分布中解算跳频信号的跳变周期、跳变时刻以及跳频频率的估计值。基于仿真数据对提出方法进行验证实验,其结果表明了方法的有效性。     

四阶累积量稀疏表示的DOA估计方法

针对现有稀疏重构DOA估计算法不能抑制噪声项以及在高斯色噪声背景下不再适用的问题,本文提出了基于四阶累积量稀疏重构的DOA估计方法。首先,利用接收数据的四阶累积量构建了稀疏表示模型,该模型抑制了噪声项;其次对四阶累计量矩阵进行奇异值分解,化简了稀疏表示模型,通过奇异值分解,不仅减小了数据规模,而且进一步抑制了噪声。对于稀疏表示模型的求解,先利用信号子空间与噪声子空间的正交特性选取权值矢量,然后利用加权l1范数法对模型求解实现DOA估计。理论分析和仿真实验表明本文算法在高斯白噪声和色噪声背景下均适用;能够处理非相干和相干信号,且在低信噪比条件下,对相干信号有更高的估计精度;较之同类的稀疏重构算法,本文算法具有较低的算法复杂度和更高的角度分辨力。      

基于混沌压缩感知的稀疏时变信号在线估计

混沌压缩感知是一种利用混沌系统实现非线性测量的压缩感知理论。针对稀疏时变信号的混沌压缩感知,该文提出稀疏时变信号的在线估计架构,构建一种递归最小二乘准则下的稀疏约束目标函数;通过利用迭代加权非线性最小二乘算法求解目标函数最小化问题,实现稀疏时变信号的参数估计。以Henon混沌系统为例仿真分析了频域时变稀疏信号的估计性能,数值模拟证明了该方法的有效性。     

基于迭代近端投影的MIMO雷达多快拍DOA估计

传统基于压缩感知的MIMO雷达DOA估计算法将非凸非平滑稀疏表示问题近似成凸或平滑函数问题进行求解,稀疏表示模型误差的存在导致DOA估计性能不理想。为此,提出了一种基于迭代近端投影的MIMO雷达多快拍DOA估计方法。该方法首先将高维回波数据转换至低维空间以降低空域维度,并对降维后的数据进行奇异值分解(Singular Value Decomposition,SVD),提取信号子空间以降低时域维度,利用近端函数优化模型来表示MIMO雷达多快拍DOA估计中的非凸非平滑稀疏表示问题,然后采用SCAD(Smoothly Clipped Absolute Deviation Penalty)函数获得近端算子以求解该模型。仿真结果表明,该方法在低快拍和低信噪比下相干信源的DOA估计性能优于现有算法。     

基于稀疏贝叶斯学习的时域流信号鲁棒动态压缩感知算法

块效应和未知且时变的噪声强度会降低时域流信号动态稀疏重构的性能,为解决该问题,本文基于重叠正交变换和稀疏贝叶斯学习框架,提出一种对时域流信号进行动态压缩感知的鲁棒稀疏贝叶斯学习重构算法.该算法在消除块效应的同时,能够处理噪声强度未知且时变情形下的动态稀疏重构问题,相比现有的流信号稀疏贝叶斯学习算法具有更强的抗噪鲁棒性.尽管现有的时域流信号压缩感知的有效算法并不多,但实验表明,本文算法的重构信误比和重构成功率均明显高于现有的基于稀疏贝叶斯学习的流信号重构算法和基于L1-同伦的流信号重构算法,且达到相同的重构成功率所需的观测数目少于另两种算法,计算量和运行效率则与稀疏贝叶斯学习算法相近.     

基于压缩感知的空域信号DOA估计

研究了基于压缩感知的空域信号DOA估计问题。针对空域信号DOA算法采样数据量大,在低信噪比情况下估计结果较差的问题,文中提出一种基于奇异值分解的多矢量欠定系统聚焦求解算法(SVD-MFOCUSS)。该算法在一定程度上克服了稀疏重构算法在低信噪比情况下的缺陷,具有较低的运算复杂度。实验仿真验证了该算法性能优于传统的DOA估计算法,且能够对相干信号进行有效的DOA估计。     

基于连续蚁群优化算法的小快拍加权子空间拟合快速算法

该文针对加权子空间拟合(WSF)算法多维非线性优化计算量大,难以工程应用的问题,将连续空间蚁群算法与加权子空间拟合算法相结合,提出了基于蚁群算法的加权子空间拟合(Ant Colony Optimization based Weighted Subspace Fitting,ACO-WSF) 方位估计新方法。该方法利用连续蚁群算法中的信息量高斯核概率分布函数,经过有限次迭代得到加权子空间拟合算法的非线性全局最优解。仿真结果表明,低信噪比、小快拍条件下该方法估计性能与WSF方法基本相同,优于MUSIC方法,而且显著减少了计算量。     

基于张量分解的子空间频率估计及应用

为了提高短时序列的频率估计精度,提出一种基于张量分解的适用于多通道接收数据的子空间高分辨率的频率估计算法。该方法将接收到的多通道采样信号按照一定的形式构建三维数据结构,利用子空间的移不变性,采用张量的高阶奇异值分解直接对数据进行频率估计。仿真表明在低信噪比的情况下,基于张量分解的频率估计算法性能要优于基于矩阵奇异值分解的频率估计算法,将此算法应用于目标轨迹测量中,可以获得高精度的目标轨迹参数。     

基于互相关抽样分解的分布式非圆信号DOA快速估计

在非相干分布式非圆信号波达方向(DOA)估计中,针对利用信号非圆特性后输出矩阵维数扩展带来的较大运算量问题,该文提出一种基于互相关抽样分解的DOA快速估计算法。该算法仅需要从子阵间的扩展互相关矩阵中抽样出少量行元素和列元素,构成两个低维子矩阵,进而通过低秩近似分解便可快速地同时求出左右奇异矢量,即分别对应两个子阵的信号子空间,避免了计算整个互相关矩阵及其奇异值分解运算;最后利用两个子阵信号子空间的旋转不变性通过最小二乘得到DOA估计。仿真分析表明,当行列抽样数大于信源数的两倍时,所提算法与直接基于互相关矩阵奇异值分解的非相干分布式非圆信号DOA估计算法性能相近,但复杂度得到了大幅度降低;而相比于传统的低复杂度非相干分布源DOA估计算法,所提算法利用信号非圆特性具有更高的估计性能。     

Instrumental variable approach to array processing in spatiallycorrelated noise fields

High-performance signal parameter estimation from sensor array data is a problem which has received much attention. A number of so-called eigenvector (EV) techniques such as MUSIC, ESPRIT, WSF, and MODE have been proposed in the literature. The EV techniques for array processing require knowledge of the spatial noise correlation matrix that constitutes a significant drawback. A novel instrumental variable (IV) approach to the sensor array problem is proposed. The IV technique relies on the same basic geometric properties as the EV methods to obtain parameter estimates. However, by exploiting the temporal correlation of the source signals, no knowledge of the spatial noise covariance is required. The asymptotic properties of the IV estimator are examined and an optimal IV method is derived. Computer simulations are presented to study the properties of the IV estimators in samples of practical length. The proposed algorithm is also shown to perform better than MUSIC on a full-scale passive sonar experiment     

用WSF算法实现机扫雷达多维超分辨估计

针对传统扫描体制雷达(机扫雷达)无法分辨半功率波束宽度内存在多目标的问题,基于阵列信号处理的思想,应用加权子空间拟合(WSF)方法实现了机扫雷达超分辨估计.首先分析了机扫雷达幅度调制的导向矢量模型,然后推导了基于此导向矢量的WSF DOA估计方法.仿真结果表明,该方法具有较高的估计精度.     

高斯色噪声背景下的单通道信源数目估计算法

目前信源数目估计算法大都是基于多通道接收模型且对高斯色噪声抑制能力较差,而实际应用中单通道接收模型及色噪声环境非常普遍,因此研究色噪声背景下的单通道信源数目估计算法意义重大。针对现有算法的缺陷提出了一种基于构建信号时间快拍和四阶累积量矩阵的单通道信源数目估计算法。首先通过构建信号时间快拍实现单通道接收信号的升维得到矢量化空间,然后以此组信号空间构造出四阶累积量矩阵,并从理论上验证了该四阶累积量矩阵能有效抑制高斯白噪声及高斯色噪声的影响,最后对该矩阵进行奇异值分解并通过信息论准则估计出信源个数。仿真实验和实际信号实验都表明本文算法能较好地解决单通道信源数目估计问题,且能有效抑制高斯色噪声。      

System identification from noisy measurements by using instrumental variables and subspace fitting

This paper considers the estimation of the parameters of a linear discrete-time system from noise-perturbed input and output measurements. The conditions imposed on the system are fairly general. In particular, the input and output noises are allowed to be auto-correlated and they may be cross-correlated as well. The proposed method makes use of an instrumental variable (IV)-vector to produce a covariance matrix that is pre- and postmultiplied by some prechosen weights. The singular vectors of the so-obtained matrix possess complete information on the system parameters. A weighted subspace fitting (WSF) method is then applied to the aforementioned singular vectors to consistently estimate the parameters of the system. The IV-WSF technique suggested herein is noniterative and easy to implement, and has a small computational burden. The asymptotic distribution of its estimation errors is derived and the result is used to motivate the choice of the weighting matrix in the WSF step and also to predict the estimation accuracy. Numerical examples are included to illustrate the performance achievable by the method.This work has been supported by the Swedish Research Council of Engineering Sciences under contract 93-669 and by the Göran Gustafsson Foundation.     

基于均匀圆阵的宽带相干LFM信号定位方法

本文提出一种基于均匀圆阵的宽带相干LFM信号定位方法。首先，算法根据LFM信号在分数阶傅里叶域的能量聚焦性，对接收信号做分数阶傅里叶变换，实现宽带信号的窄带化处理；其次，利用圆阵的虚拟轴向平移形成的相位差构造空间平滑矩阵，完成相干信号的解相干处理；最后，对空间平滑矩阵进行奇异值分解得到相邻阵元接收数据的相位差，结合相位差反演参数估计算法得到二维角度参数估计的闭式解。仿真实验验证了算法对宽带相干LFM信号定位的有效性。     

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     

Low-Complexity DOA Estimation Based on Constraint Solution Space

The Weighted Subspace Fitting (WSF) algorithm is one of the universal algorithms in Direction-Of-Arrival (DOA) estimation, which is of high accuracy. However, it involves the multi-dimensional nonlinear optimization problem, and the computational complexity is usually high. In this paper, we propose a low-complexity DOA estimation algorithm based on constraint solution space. Firstly, we use ESPRIT algorithm to limit the solution space around the best solution and reduce the computational range. Then, we find the best solution in a smaller solution space constraint by Cramr-Rao Bound (CRB), and seek repeatedly until reaching the global optimal solution of WSF algorithm by using the space of the best solution. By limiting the searching process in smaller solution space, this strategy controls the direction of convergence and reduces computational complexity. The experimental results show that this algorithm needs less iterations when the same DOA accuracy is required, and the computational complexity is apparently reduced.