检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高飞[1] 彭云柯[1] 薛艳明[1] GAO Fei PENG Yun-ke XUE Yan-ming(School for Information and Electronics, Beijing Institute of Technology, Beijing 100081, China)
机构地区:[1]北京理工大学信息与电子学院,北京100081
出 处:《北京理工大学学报》2016年第9期956-959,共4页Transactions of Beijing Institute of Technology
基 金:国家自然科学基金资助项目(61101131)
摘 要:研究在正交频分复用(OFDM)系统的稀疏信道估计问题.由于在许多通信系统中信道具有稀疏性,因此可以把信道估计问题转化为稀疏信号的恢复问题,应用压缩感知理论求解,把现有的恢复算法——广义正交匹配追踪算法(GOMP)运用到信道估计中,并对它加以改进.仿真结果表明,与广义正交匹配追踪算法(GOMP)相比,正交匹配追踪算法(OMP)运行时间少,计算复杂度低,但是估计的最小均方误差略差.为了进一步提高该算法的性能,提出了改进的广义正交匹配追踪算法,性能得到了较大的提高.The sparse channel estimation in orthogonal frequency division multiplexing (OFDM) systems was studied to solve the channel sparsity problem in many communication systems. The sparse channel estimation problem was formulated as the reconstruction problem of sparse signals. Based on compressive sensing theory, generalized orthogonal matching pursuit (GOMP) was applied to the channel estimation, and an improved GOMP algorithm was proposed. Simulation results demonstrate that, compared with OMP, though GOMP brings in some sort mean square error (MSE), hut it shows lesser running time and lower computational complexity. And the effect of improved GOMP algorithm is better for the performance improvement of GOMP.
分 类 号:TN911.23[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145