检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《电子与信息学报》2008年第8期1832-1835,共4页Journal of Electronics & Information Technology
基 金:国防重点实验室基金项目(51473030105JB3201)资助课题
摘 要:针对16QAM信号的对数似然比计算,该文提出一种新颖的折线逼近简化算法,采用分段的折线逼近16QAM信号的对数似然比曲线,进而使用简单的线性运算替代原标准LLR算法中复杂的非线性运算,仿真结果表明,该算法可以理想地逼近标准LLR算法的计算结果,在BITCM系统中应用不会带来系统的性能折损。In this paper, a novel simplified algorithm with broken line analysis is proposed for the log-likelihood ratio calculation of 16QAM signals. In this novel algorithm several line segments are introduced to approach the LLR curves of 16QAM signals, which results that the complicated nonlinear computations in the optimum algorithm are replaced with simple linear one. The simulation show that the algorithm in this paper can be a perfect approach to the optimum LLR algorithm in calculation results; and the performance will not degrade when it is applied in BITCM systems.
关 键 词:16QAM 对数似然比算法 折线逼近 BITCM
分 类 号:TN919[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249