多符号差分酉空时系统的低复杂度M算法设计  

Reduced complexity M algorithm design for multiple symbol differential unitary space-time systems

作　　者：金小萍[1] 应樱果[1] 金宁[1] 

机构地区：[1]中国计量学院信息工程学院,浙江杭州310018

出　　处：《浙江大学学报（理学版）》2011年第1期50-54,共5页Journal of Zhejiang University（Science Edition）

基　　金：浙江省自然科学基金资助项目(Y107650)

摘　　要：为了解决多符号差分检测(MSDD)高计算复杂度的问题,已经提出了一系列低复杂度次优的检测算法,其中,M算法因其具有固定的复杂度和时延被广泛关注.当前,M算法在多符号差分检测中的运用大多假设每层的保留分支数M值是相同的,而这种方法在复杂度的角度来看并不是最佳的方法,鉴于此本文提出了一种动态M算法,即每层保留分支数设为不同的值,通过仿真分析得出该方法与恒定M值的方法比较不仅使扩展和更新的分支数减少,而且在高信噪比时其性能更优越.另外目前对M算法的研究主要集中在通过减少节点扩展分支数来降低复杂度,而对每层选取最佳M条路径的排序方法的研究几乎是空白,因此基于多符号差分检测系统对一种低复杂度的排序方法进行了研究.分析表明这种方法相比传统冒泡排序方法可以节约75.39%的比较交换次数.该方法的运用使得M算法更有利于在实际当中的运用.To solve the problem of high complexity for multiple symbol differential detection（MSDD）,a series of low complexity and sub-superior detect algorithms have been proposed so far,in which the M algorithm is well appreciated for its fixed complexity and latency.However the retained branches for each stage is assumed the same when the M algorithm is applied in the MSDD,but this method is not the best way in the view of complexity.In this paper,we propose a dynamic M algorithm in which the retained branches of each stage can be set to different value.The simulation analysis shows that the proposed algorithm not only reduce the number of branches from expanded and updated,but also has a better performance than constant M method in high SNR.In addition,the research on M algorithm focus on reducing the extended branches from the nodes to decrease the complexity,but the research on sort method of selecting M best paths is almost blank,so a low complexity sort algorithm is studied based on MSDD system.Analysis show that this sort architecture can save about 75.39% of the compare swap operations compared with the traditional bubble sort method.The proposed algorithm makes the M algorithm better apply in practice.

关 键 词：多符号差分检测 动态M算法 复杂度 排序 

分 类 号：TN914[电子电信—通信与信息系统]