摘要
Abstract
In combination of CS theory, the compressing sampling matching pursuit algorithm for Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing(MIMO_OFDM)system channel estimation requires the signal spar-sity as a priori information, while in actual situation the sparsity is difficult to obtain, for this question it proposes a signal sparsity adaptive Compressive Modifying Sampling Matching Pursuit algorithm(CoMSaMP). The algorithm adopts the atomic weak selection criteria with theoretical support as a pre-selection scheme, and sets the first clipping threshold to reduce the algorithm extra iteration, then reduces the computational complexity, the improve of crop mode on channel esti-mation ensures the improvement of the reconstruction accuracy, and ultimately realizes adaptive recovery on MIMO-OFDM sparse channel estimation . Simulation results show that, compared with the original algorithm, under the same SNR con-ditions, the CoMSaMP algorithm has better performance on channel estimation, improves the spectral efficiency, reduces the complexity. When the sparsity level is high, the proposed algorithm has the better performance than the CoSaMP algo-rithm on anti-interference ability.关键词
压缩感知/正交频分复用/稀疏信道估计/压缩采样匹配追踪Key words
compressed sensing/Orthogonal Frequency Division Multiplexing(OFDM)/sparse channel estimation/Com-pressive Sampling Matching Pursuit(CoSaMP)分类
信息技术与安全科学
