维普期刊资源整合服务平台（V6.5）

维普中文期刊产品整合服务

共被期刊论文引用了1次 您的检索式：您选中1篇文献正在查看引证文献汇总

选中清除导出查看参考文献查看引证文献引用追踪共1页首页上一页第1页下一页末页 /1 跳转

		题名	作者	年代	出处	被引量
	1	Forced-convergence decoding for LDPC-coded modulation显示文摘Low-density parity-check(LDPC)-coded modulation has attracted much attention for its outstanding performance in a bandwidth-limited channel.However,it involves relatively high decoding complexity.Owing to different convergence behaviors of variable nodes,the nodes detected early can be deleted from the Tanner graph,which reduces the size of the parity-check matrix iteration by iteration and thus the decoding complexity.In this paper,we propose a new decoding algorithm for LDPC-coded modulation with reduced complexity.In addition,by deleting the converged bits from the modulation constellation and updating the bit metrics of the demapper with the reduced constellation,more accurate estimation of the bits can be achieved.Simulation results show that,compared with conventional decoding schemes,the proposed method not only greatly reduces the overall decoding complexity for LDPC-coded modulation but also significantly improves decoding performance.	DAI LiYun YANG HongWen FAN JianXiao RAO WenYuan	2013	Science China(Information Sciences)2013，56，1：	0

返回顶部每页显示：

共1页首页上一页第1页下一页末页 /1 跳转

goolge学术搜索-维普

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1　渝公网安备 50019002500403号　违法和不良信息举报中心

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费