检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国计量学院信息工程学院,浙江杭州310018
出 处:《中国计量学院学报》2015年第3期280-284,共5页Journal of China Jiliang University
摘 要:为了解决空间调制系统(SM)下,M算法搜索过程中搜索节点数难以确定及算法复杂度偏大的问题,提出一种搜索节点数自适应于累积度量值的检测算法(IM-ML).传统的M-ML算法在树形结构中进行搜索时每层保留的节点数为一个固定值,而我们提出的算法在每层搜索保留K个节点的前提下,保留度量值大于K个节点的有限个节点.仿真结果表明,改进后的M-ML检测算法在K值较小的情况下就能取得传统MML算的性能,同时降低了算法复杂度.To solve the problem of being hard to fix the node number in the search process and the high complexity of M-algorithm under spatial modulation, an improved M-ML algorithm(IM-ML) with node number searching adapted to accumulated metrics was presented. Compared with the traditional M-algorithm in which the number of retained nodes at each level of the tree structure was a fixed value, the IM-ML algorithm retained the finite number of nodes where the accumulated metrics was greater than K nodes under the premise that the K nodes had been kept at each level of the tree structure. Simulation results showed that the IM-ML algorithm could obtain a near-optimum bit error rate performance compared with the traditional M- ML algorithm and its complexity reduced.
分 类 号:TN914[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.134