一种新的压缩信道估计凸优化基失配补偿算法

A New Alternating Iteration Recovery Algorithm for Compressed Channel Estimation with Basis Mismatch

  • 摘要: 针对压缩信道估计基失配问题进行研究,基失配本质是无线信道多径时延并不是分布在预先划分好的离散网格点上,而是呈连续分布,目前的压缩信道估计均是基于离散网格点分布假设建立估计模型,实际物理多径时延相对于离散网格点的偏差会带来信道估计性能的下降。针对该问题,提出了一种新的迭代凸优化信道估计算法,该算法交替迭代求解稀疏信道向量和基失配向量,并且每一步迭代过程均为凸优化问题。仿真分析结果表明算法在保证收敛性的同时,取得相比于比较算法更好的性能。

     

    Abstract: This paper tackles the well-known problem of basis mismatch in compressed channel estimation for wireless channels. The basis mismatch problem is caused by the fact that multipath delays exist in the continuous space, not exactly on the discretized grid. Any deviation from the grid points leads to performance degradation in channel estimation. This problem is known as the basis mismatch problem in the compressed channel estimation. In the paper, we propose a new convex optimization based alternating iteration recovery (AIR) algorithm to alternately solve the sparse channel coefficient vector and the basis mismatch vector. The optimization problems in each stage of the iterations are convex. The results show that the proposed AIR algorithm achieves better estimation accuracy compared with the comparative algorithms.

     

/

返回文章
返回