Binary generalized orthogonal matching pursuit

Binary generalized orthogonal matching pursuit
复制标题

DOI:
10.1007/s13160-023-00585-8
复制
发表时间:
2023-04
影响因子:
0.9
通讯作者:
Haifeng Li;Hao Ying;Xiaoli Liu
Haifeng Li;Hao Ying;Xiaoli Liu
中科院分区:
数学4区
文献类型:
--
作者:
Haifeng Li;Hao Ying;Xiaoli Liu

文献摘要

相似文献

在信号处理中,通常是满足k -稀疏二值信号的恢复。为了对k稀疏二值信号进行重构,提出了二值广义正交匹配追踪算法。利用互相干性和受限等距特性(RIP),研究了BgOMP算法的理论性能。基于仿真测试结果,BgOMP算法优于二进制MP (BMP)算法。
In signal processing, it is usually to meet the recovery ofK-sparse binary signal. In order to reconstruct theK-sparse binary signal, the binary generalized orthogonal matching pursuit (BgOMP) algorithm is proposed in this paper. By using mutual coherence and restricted isometry property (RIP), the theoretical performance of the BgOMP algorithm is also investigated. Based on the results of simulation tests, BgOMP is better than the binary MP (BMP) algorithm.