作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 移动互联与通信技术 • 上一篇    下一篇

一种低复杂度稀疏信道估计算法

范馨月,苏艳涛,周非   

  1. (重庆邮电大学 通信与信息工程学院,重庆 400065)
  • 收稿日期:2015-12-11 出版日期:2016-11-15 发布日期:2016-11-15
  • 作者简介:范馨月(1979—),女,副教授,主研方向为认知无线电、通信信号处理;苏艳涛,硕士研究生;周非,教授、博士。
  • 基金资助:
    国家自然科学基金(61471077, 61301126);重庆市基础与前沿研究计划一般项目(cstc2013jcyjA40034,cstc2013jcyjA40041);重庆市教委科学技术研究项目(KJ1400413)。

A Low-complexity Sparse Channel Estimation Algorithm

FAN Xinyue,SU Yantao,ZHOU Fei   

  1. (School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
  • Received:2015-12-11 Online:2016-11-15 Published:2016-11-15

摘要: 传统基于压缩感知的信道估计方法存在计算复杂度较高、较难应用于实际的问题。为此,将广义的正交匹配追踪(GOMP)算法应用到信道估计中,通过一次迭代选取多个原子,降低算法的计算复杂度,考虑无线信道的能量分布特征,提出一种基于分级回归追踪的GOMP算法。该算法采取分级的方法选择原子,利用回归追踪的方法去除非匹配原子,从而保证原子的快速准确选择。实验结果表明,该算法在保证信道估计精度的同时,可有效地降低计算复杂度,具有较好的鲁棒性。

关键词: 信道估计, 压缩感知, 计算复杂度, 导频, 匹配原子

Abstract: Traditional Compressed Sensing(CS)based channel estimation methods are difficult to implement due to their high computational complexity.To solve this problem,Generalized Orthogonal Matching Pursuit(GOMP)algorithm is used for channel estimation,which reduces computational complexity by selecting multiple indices in each iteration.Considering the power distribution of wireless channel,a classifying-back-tracing based Generalized Orthogonal Matching Pursuit(Cbt-GOMP) algorithm is proposed.This algorithm utilizes classification to select atoms and takes advantage of back-tracing to remove non-matching atoms,which guarantee a fast and accurate atom selecting.Simulation results show that this algorithm can not only guarantee channel estimation accuracy,but also reduce computational complexity effectively.Additionally,this method also has good robustness.

Key words: channel estimation, Compressed Sensing(CS), computational complexity, pilot, matching atom

中图分类号: