检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京航空航天大学大学电子信息工程学院,江苏南京210016
出 处:《信息化研究》2011年第5期27-29,33,共4页INFORMATIZATION RESEARCH
摘 要:针对CMMB标准中的LDPC码进行了译码算法的研究,提出最小的改进算法,同时给出归一化最小和算法的定点仿真。定点仿真结果表明,输入8位量化,中间变量分别9位和10位量化,可获得与浮点相差很小的误码率性能。In this paper, we research the decoding algorithms of the LDPC code in CMMB and propose an im- proved algorithm based on the Min-Sum algorithm. The simulation results indicate that the performance of the improved Min-Sum is much better than the MS algorithm and has a little degradation compared with the NMS algorithm in the case of relatively high SNR. And the improved algorithm is easier to be implemented. Moreover, the fixed-point simulation of the normalized rain-sum algorithm is also studied. The result shows that the BER performance only has a slight decline with the input 8 bit quantized and inner variable respectively 9 bit and 10 bit quantized. 6 bit quantization of the input and 8 bit quantization of the inner variable is also acceptable when the memory is sensitive.
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249