期刊文献+

基于重加权近似消息传递算法的稀疏信道估计

Reweighted approximate message passing for compressive channel sensing
下载PDF
导出
摘要 基于近似消息传递(AMP)算法,提出了一种重加权近似消息传递(Rw AMP)算法用于稀疏信道估计,该算法增加了重加权过程与衰减机制。在信号重构时加入权重更新过程,待重构信号中较大的元素几乎不变,较小元素迅速降低为零,从而提高正确重构概率。其次,当稀疏信道估计的观测矩阵为Toeplitz矩阵时,为了提高AMP类算法收敛性,文中加入衰减机制。仿真结果表明,在相同复杂度的条件下,Rw AMP算法的信号重构性能优于基追踪(BP)算法和AMP算法。 In this paper, a new version of approximate message passing with reweighting and damping mechanisms (RwAMP) is designed for compressive Channel sensing (CCS) problem. By the reweighting mechanism, large signal elements will be changed slowly or even unchanged during the iterations, and small signal elements will be diminished to zero quickly. Secondly, unconvergence of AMP is observed under the scenario of Toeplitz measurement matrix in CCS, so damping technique is adopted to improve the algorithm stability. The simulation results show that, on signal reconstruction performance, RwAMP outperforms basis pursuit (BP) with much lower complexity, and is much more superior to AMP with equivalent complexity.
作者 周洁 高镇
出处 《信息技术》 2015年第12期158-161,165,共5页 Information Technology
关键词 压缩信道感知 近似消息传递 重加权 衰减机制 compressive channel sensing approximate message passing reweighting dampingmechanism
  • 相关文献

参考文献10

  • 1Donoho D L. Compressed sensing[J]. IEEE Trans. on Information Theory,2006, 52(4) : 1289 - 1306.
  • 2Vuokko L, Kolmonen V M,Salo J, et al. Vainikainen, Measurementof large- scale cluster power characteristics for geometric channel models [ J ]. IEEE Trans. Antennas Propagat, 2007, 55 ( 11 ) : 3361 - 3365.
  • 3Haupt J, Sayeed A M, Nowak R. Compressed Channel Sensing: a New Approach to Estimating Sparse Multipath Channels [ J ]. Pro- ceedings of the IEEE,2010, 98(6) : 1058 -1076.
  • 4Donoho D L, Maliki A, Montanari A. Message-passing algorithms for compressed sensing[J2. Prec. Nat. Acad. Sei,2009, 106(45): 18914 - 18919.
  • 5Donoho D L, Maleki A, Montanari A. How to design message passing algorithms for compressed sensing [ EB/OL]. 2011. http: //www. ece. rice. edu/maml5/bpist, pdf.
  • 6Frank R K, Brendan J K, Hans-Andrea L. Factor graphs and the sum-product algorithm I J]. IEEE Trans. Info. Theory,2001, 47 (2) : 498 -519.
  • 7Golub G H,Van Loan C F. Matrix Computation(3rd ed) [ M]. Balti- more:The John Hopkins Univ. Press, 1996.
  • 8Boyd S, Vandenberghc L. Convex Optimization [ M ]. Cambridge : U. K. Cambridge University Press, 2004.
  • 9Cand~s E J, Wakin M B, Boyd S. Enhancing sparsity by reweighted #1 minimization [ J ]. Fourier Anal. Appl. ,2008,14 : 877 - 905.
  • 10Donoho D L. [ EB/OL]. 2009. http ://sparselab. stanford, edu/.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部