基于簇的块稀疏压缩感知的60GHz信道估计

基于压缩感知设计适用于60 GHz毫米波通信系统的信道估计方案,深入研究了正交匹配追踪(OMP)算法和正则正交匹配追踪(Regularized OMP)算法的60 GHz信道估计性能;在此基础上,充分发掘60 GHz无线多径信道所呈现出的分簇特性,提出一种新颖的基于簇分级的稀疏压缩感知重构算法。新算法在有效减少重构迭代次数的前提下,亦能显著降低信道估计误差。综合对比分析了基于簇分块稀疏压缩感知重构算法和现有压缩感知算法在60 GHz信道估计应用中的重构性能,仿真结果表明,压缩感知算法可有效应用于60 GHz系统信道估计,而新设计的基于簇分级的稀疏压缩感知算法则在估计精度和实现复杂度方面具更优越性能。     

基于快速贝叶斯匹配追踪的激光大气信道估计

信道估计是指接收机获知信道状态信息的方法和过程。信道估计的准确度决定了接收机的工作性能,所以均衡之前,必须先进行信道估计。目前,激光光学传输信道估计成为多输入多输出正交频分复用的自由空间光通信系统的关键技术。传统的压缩感知方法作为一种信道估计的有效方法,具有恢复和重构原始信号的能力,但在计算复杂度上付出了一定的代价。快速贝叶斯匹配追踪算法克服了现有方法重构精度低和复杂度高缺点。通过先验模型选择和近似的最小均方误差的参数向量的估计,快速贝叶斯匹配追踪算法提供了估计信道冲激响应的一种有效方式。仿真结果表明,与传统的基于压缩感知的方法相比,该方法能显著提高系统的性能。     

可重构智能表面辅助通信系统时变级联信道估计

针对可重构智能表面（RIS）辅助通信系统时变级联信道的估计中需解决的级联信道稀疏表示、时变信道参数跟踪和信号重构等关键问题,提出了一种结合Khatri-Rao积的分层贝叶斯卡尔曼滤波（KR-HBKF）算法。该算法首先利用信道的稀疏特性,通过Khatri-Rao积和克罗内克积变换得到RIS级联信道的稀疏表示,将RIS级联信道估计问题转化为低维度的稀疏信号恢复问题。然后,根据RIS级联信道的状态演化模型,在HBKF算法的预测模型中引入了时间相关性参数,应用改进的HBKF解决时变信道参数跟踪和信号重构问题,完成时变级联信道的估计。KR-HBKF算法综合利用了信道的稀疏性和时间相关性,能以较小的导频开销获得更好的估计精度。仿真结果表明,与传统压缩感知算法相比,所提算法具有约5dB的估计性能提升,且在不同的时变信道条件下具有更好的鲁棒性。     

基于压缩感知的MIMO-OFDM系统自适应信道估计

针对超密集组网中导频复用将产生导频干扰,严重影响移动用户下行链路信道估计准确性的问题,提出了一种使用短导频的幂函数稀疏度自适应匹配追踪(Power Sparsity Adaptive Matching Pursuit,PSAMP)算法.该算法由稀疏度预估计和追踪重构两部分构成.首先通过幂函数试探得到一个略小于真实稀疏度的预估值,再通过压缩采样匹配追踪重构信号,改善估计结果;若不能成功重构,则逐渐增加信号原子数量.仿真结果表明,相较于传统自适应压缩感知重建算法,所提的P SAMP算法在高信噪比区域具有更好的信道估计性能.     

一种改进的重构算法在信道估计中的应用

研究了在多天线正交频分复用系统信道估计问题。特别利用了宽带MIMO-OFDM系统的时域稀疏特性,来研究这个系统中的基于导频符号的信道估计技术。本文将压缩感知理论应用在稀疏信道估计中,对现有的重构算法进行改进,在不需要预先知道信道的稀疏度信息就利用分次迭代,逐步逼近的方法可以精确重构信号。仿真结果表明,本文提出的信道估计方法性能更加良好。     

OFDM稀疏信道估计中基于树状随机搜索导频设计新方法

压缩感知（CS,Compressed Sensing）是一种以低速率对稀疏信号进行采样后在接收端重建信号的技术,基于CS的稀疏信道估计具有更小的导频开销且具有更好的信道估计性能。针对基于CS的OFDM稀疏信道估计中的导频设计问题,提出一种基于树状随机搜索算法（TSS,Tree-based Stochastic Search Algorithm）的导频位置设计新方法,该方法结合了树的结构,以分支的方式进行随机搜索从而避免陷入局部最优问题。仿真结果表明,与传统的导频设计方法相比,使用TSS算法获得的导频图案用于信道估计中能够获得更优的信道估计性能,而且TSS算法的复杂度更低。      

基于贝叶斯压缩感知理论的超宽带通信信道估计

超宽带是一种新颖的高速无线通信技术。其过高的带宽给采样带来了困难,压缩感知理论提供了一种可行的低速采样方法。针对目前的压缩感知超宽带信道估计方法必须假设信道稀疏度已知,论文提出了基于贝叶斯压缩感知理论的超宽带信道估计方法。将超宽带信道估计转化为压缩感知理论中的重构问题,并使用贝叶斯压缩感知方法进行重构,得到信道估计值及其误差范围,最终实现信息解调。贝叶斯压缩感知理论将稀疏贝叶斯学习理论引入到压缩感知中,给需要重构向量中的每个值设置受超参数控制的后验概率密度函数,在超参数的更新过程中,零值所对应的超参数将趋向于无穷大,与之对应的后验概率将趋向于零,通过这种方法剔除非重要多径,自适应地找出信道向量中的重要多径,并使用回归算法进行重构。实验结果表明在信道稀疏度未知的情况下,该方法能够对原信道进行有效的重构。     

基于压缩感知的OFDM宽带短波信道估计方法研究

为了提高OFDM宽带短波信道估计的精确性,针对短波信道固有的低稀疏性,在将压缩感知理论应用于OFDM宽带短波信道估计的基础上进行OFDM短波信道的稀疏建模,接着提出需要解决的问题,进而提出采用正交匹配追踪(OMP)算法进行短波信道的重构。通过仿真实验证实,与传统信道估计算法中的最小二乘(LS)算法比较,可以达到在使用更少导频的情况下提供更好的短波信道估计性能的效果,从而提高短波系统的频带利用率。     

非理想载波同步下OFDM快衰落信道的稀疏与感知

针对稀疏导频 OFDM 系统,提出非理想载波同步 OFDM 快衰落信道稀疏表示与感知方法。首先提出了一种稀疏化信道核向量的广义信道冲激响应矩阵稀疏化表示方法;推导了稀疏导频快衰落信道估计压缩感知模型;利用OMP算法重构稀疏化信道核向量与广义信道冲激响应矩阵,从而完成非理想载波同步下的 OFDM 快衰落信道估计。仿真结果表明,该算法能有效降低非理想载波同步的稀疏导频 OFDM 系统的误码率。     

一种低开销的LTE上行链路信道估计算法

压缩感知理论作为信号处理方向较为前沿的研究方向,可以采用少数目的采样值以高概率来获得原始稀疏信号。同时,移动无线通信衰落信道恰恰具有稀疏特性。然而,传统的信道估计并没有根据信道的这一稀疏特性来得出算法。在研究多径信道稀疏特性的基础上,分析了将压缩感知理论运用于LTE上行链路进行信道估计的可行性,并建立了一种基于压缩感知技术实现系统信道估计的模型,提出了一种结合正交匹配追踪算法来估计信道时域响应的低开销LTE上行链路信道估计算法。此外,通过系统仿真进行了估计的均方误差性能分析,与目前广为使用的信道估计算法相比,所提出的低开销信道估计算法在保证估计精度的同时减少了导频开销,增强了系统性能。     

稀疏多径信道环境中MIMO-OFDM系统的IQ不平衡和信道联合估计

该文针对稀疏多径信道环境中的MIMO-OFDM系统所存在的IQ不平衡问题,提出了一种IQ不平衡参数和信道的联合估计方法.推导了联合估计的时域模型,提出了基于l1-l2优化模型和平行坐标下降算法的联合估计算法.仿真结果表明,所提方法与传统的频域最小二乘算法和匹配追踪算法相比,显著提高了系统性能.     

DOA estimation in unknown colored noise using covariance differencing and sparse signal recovery

A direction-of-arrival （DOA） estimation algorithm is presented based on covariance differencing and sparse signal recovery, in which the desired signal is embedded in noise with unknown covariance. The key point of the algorithm is to eliminate the noise component by forming the difference of original and transformed covariance matrix, as well as cast the DOA estimation considered as a sparse signal recovery problem. Concerning accuracy and complexity of estimation, the authors take a vectorization operation on difference matrix, and further enforce sparsity by reweighted l1-norm penalty. We utilize data-validation to select the regularization parameter properly. Meanwhile, a kind of symmetric grid division and refinement strategy is introduced to make the proposed algorithm effective and also to mitigate the effects of limiting estimates to a grid of spatial locations. Compared with the covariance-differencing-based multiple signal classification （MUSIC） method, the proposed is of salient features, including increased resolution, improved robustness to colored noise, distinguishing the false peaks easily, but with no requiring of prior knowledge of the number of sources.     

一种自适应全局最小平均p-范数算法

本文给出了适应于α-稳定噪声环境中自适应滤波和系统辨识的全局最小平均p-范数算法,其是总体最小二乘方法在脉冲噪声中的推广.本文还定义了全局l_p模误差和推导了点到直线的l_p距离,并在此基础上导出了全局最小平均p-范数算法.对所给算法进行了仿真实验研究,结果显示其性能优于著名的LMP算法.     

An adaptive two phase blind image deconvolution algorithm for an iterative regularization model

This paper proposes a blind image deconvolution method which consists of two sequential phases, i.e., blur kernel estimation and image restoration. In the first phase, we adopt the L₀-norm of image gradients and total variation (TV) to regularize the latent image and blur kernel, respectively. Then we design an alternating optimization algorithm which jointly incorporates the estimation of intermediately restored image, blur kernel and regularization parameters into account. In the second phase, we propose to take the mixture of L₀-norm of image gradients and TV to regularize the latent image, and design an efficient non-blind deconvolution algorithm to achieve the restored image. Experimental results on both a benchmark image dataset and real-world blurred images show that the proposed method can effectively restore image details while suppress noise and ringing artifacts, the result is of high quality which is competitive with some state of the art methods.     

Sparse least mean p-power algorithms for channel estimation in the presence of impulsive noise

The least mean p-power (LMP) is one of the most popular adaptive filtering algorithms. With a proper p value, the LMP can outperform the traditional least mean square \((p=2)\), especially under the impulsive noise environments. In sparse channel estimation, the unknown channel may have a sparse impulsive (or frequency) response. In this paper, our goal is to develop new LMP algorithms that can adapt to the underlying sparsity and achieve better performance in impulsive noise environments. Particularly, the correntropy induced metric (CIM) as an excellent approximator of the \(l_0\)-norm can be used as a sparsity penalty term. The proposed sparsity-aware LMP algorithms include the \(l_1\)-norm, reweighted \(l_1\)-norm and CIM penalized LMP algorithms, which are denoted as ZALMP, RZALMP and CIMLMP respectively. The mean and mean square convergence of these algorithms are analysed. Simulation results show that the proposed new algorithms perform well in sparse channel estimation under impulsive noise environments. In particular, the CIMLMP with suitable kernel width will outperform other algorithms significantly due to the superiority of the CIM approximator for the \(l_0\)-norm.     

A novel compressed sensing ultra‐wideband channel estimation method based on non‐convex optimization

Due to the low power spectral density and complicated transfer propagation of ultra‐wideband (UWB) signal, it is important to estimate UWB channel accurately. But it is difficult to sample UWB signals directly due to their wider band width. However, compressed sensing (CS) theory provides a feasible way through lower sampling speed. Common CS‐UWB channel estimation methods adopt convex optimization, non‐sparse or non‐restricted form. In order to strengthen the restriction on sparsity of the reconstructed channel vector, a non‐convex optimization method is proposed in this paper to estimate UWB channel. Proposed method sets the objective function as a non‐convex optimization model using l_p–norm. This model is combined as a convex function to approximate the objective function and reconstruct the UWB channel vector iteratively. Because l_p–norm is closer to l₀–norm than l₁ and l₂–norm, its restriction on sparsity of objective vector is stricter. The simulation results show that this method can enhance reconstruction performance compared with existing CS‐UWB channel estimation methods. Copyright © 2013 John Wiley & Sons, Ltd.     

Separate/joint optimization of error feedback and realization for roundoff noise minimization in a class of 2-D state-space digital filters

Techniques for the separate/joint optimization of error-feedback and realization are developed to minimize the roundoff noise subject to l ₂-norm dynamic-range scaling constraints for a class of 2-D state-space digital filters. In the joint optimization, the problem at hand is converted into an unconstrained optimization problem by using linear-algebraic techniques. The unconstrained problem obtained is then solved by applying an efficient quasi-Newton algorithm. A numerical example is presented to illustrate the utility of the proposed techniques.     

Optimal-correlation-based reconstruction for distributed compressed video sensing

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low-complexity video coding. However, how to design an efficient joint reconstruction by leveraging more realistic signal models is still an open challenge. In this paper, we present a novel optimal-correlation-based reconstruction method for compressively sampled videos from multiple measurement vectors. In our method, the sparsity is mainly exploited through inter-signal correlations rather than the traditional frequency transform, wherein the optimization is not only over the signal space to satisfy data consistency but also over all possible linear correlation models to achieve minimum-l₁-norm correlation noise. Additionally, a two-phase Bregman iterative based algorithm is outlined for solving the optimization problem. Simulation results show that our proposal can achieve an improved reconstruction performance in comparison to the conventional approaches, and especially, offer a 0.7–9.9 dB gain in the average PSNR for DCVS.     

Bi-l0-l2-norm regularization for blind motion deblurring

In blind motion deblurring, leading methods today tend towards highly non-convex approximations of the l₀-norm, especially in the image regularization term. In this paper, we propose a simple, effective and fast approach for the estimation of the motion blur-kernel, through a bi-l₀-l₂-norm regularization imposed on both the intermediate sharp image and the blur-kernel. Compared with existing methods, the proposed regularization is shown to be more effective and robust, leading to a more accurate motion blur-kernel and a better final restored image. A fast numerical scheme is deployed for alternatingly computing the sharp image and the blur-kernel, by coupling the operator splitting and augmented Lagrangian methods. Experimental results on both a benchmark image dataset and real-world motion blurred images show that the proposed approach is highly competitive with state-of-the-art methods in both deblurring effectiveness and computational efficiency.     

Improved smoothed LO reconstruction algorithm for ISI sparse channel estimation

In this paper, the problem of inter symbol interference （ISI） sparse channel estimation in wireless communication with the application of compressed sensing is investigated. However, smoothed L0 norm algorithm （SL0） has ＇notched effect＇ due to the negative iterative gradient direction. Moreover, the property of continuous function in SL0 is not steep enough, which results in inaccurate estimations and low convergence. Afterwards, we propose the Lagrange multipliers as well as Newton method to optimize SL0 algorithm in order to obtain a more rapid and efficient signal reconstruction algorithm, improved smoothed L0 （ISL0）. ISI channel estimation will have a direct effect on the performance of ISI equalizer at the receiver. So, we design a pre-filter model which with no considerable loss of optimality and do analyses of the equalization methods of the sparse multi-path channel. Real-time simulation results clearly show that the ISL0 algorithm can estimate the ISI sparse channel much better in both signal noise ratio （SNR） and compression levels. In the same channel conditions, ISL0 algorithm has been greatly improved when compared with the SL0 algorithm and other compressed-sensing algorithms.