检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:沈子钰 褚杭柯 唐川雁 SHEN Zi-yu;CHU Hang-ke;TANG Chuan-yan(School of Communication Engineering, Hangzhou Dianzi University, Hangzhou Zhejiang 310018, China)
机构地区:[1]杭州电子科技大学通信工程学院,浙江杭州310018
出 处:《通信技术》2018年第5期1026-1029,共4页Communications Technology
摘 要:压缩感知理论可应用到脉冲超宽带通信中,以降低采样速率。超宽带信号常常采用多径分集字典来稀疏表示,使得压缩采样匹配追踪(CoSaMP)、广义正交匹配追踪(GOMP)等经典的重构算法经常出现原子误选的情况,导致信号重构误差增大。因此,在GOMP的基础上,提出了一种新的重构算法。该算法在每次迭代中可选取多个原子以加快迭代收敛速度,并且通过限制被选中原子之间的序号差来避免原子误选。仿真实验表明,该算法不仅可以保证重构精度,而且具有更低的计算复杂度。Compressive sensing theory may be applied to Ultra-Wideband Impulse Radio communications, so as to reduce the sampling rate. Ultra-wideband signals are usually sparsely represented by multipath diversity dictionaries, and this makes the classical reconstruction algorithms such as ComsaMP, GOMP (Generalized Orthogonal Matching Pursuit) and other classic reconfiguration algorithms often suffer from incorrect selection of atoms, leading to the increase of signal-reconstruction error. Therefore, based on GOMP, a new reconstruction algorithm is proposed. This algorithm may select multiple atoms in each iteration and thus speed up the convergence of iterations, and avoid atom misselection by limiting the sequence number difference of between the selected atoms. Simulation experiments indicate that this algorithm could guarantee the accuracy of reconstruction and has fairly low computational complexity.
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3