计算机工程与应用2011，Vol.47Issue(15)：97-100,4.DOI:10.3778/j.issn.1002-8331.2011.15.027
多符号差分酉空时系统下K-best的排序方法
K-best sort method in multiple symbol differential unitary space-time systems
摘要
Abstract
The K-best algorithm(also known as the M algorithm) is well appreciated not only for its lower complexity,but also for its fixed complexity and latency, so it is used to solve the problem of high complexity for Multiple Symbol Differential Detection(MSDD).However, at present, the K-best algorithm used in the MSDD reduces the complexity by reducing the branches of extensible nodes mostly,and the method of sorting on each layer is almost empty. To solve this problem,this article researches two sorting methods based on dynamic K-best algorithm, Batcher's sort merge sort and K cycles sort. The simulation analysis shows that Batcher merge sort method can reduce 70％ of the compare & swap(c&s) operations compared to the traditional bubble sort method, but also has the similar performance,and only the 0.25 dB difference at high SNR.K cycles sort scheme not only reduces about 90％ of complexity compared to the bubble sort method,but also nearly saves 85％ c&s compared to the Bateher's sorting method,while its performance is the best at high SNR.关键词
多符号差分检测/K-best算法/排序Key words
Multiple Symbol Differential Deteetion(MSDD)/K-best algorithm/sort分类
信息技术与安全科学引用本文复制引用
金小萍,应樱果,金宁..多符号差分酉空时系统下K-best的排序方法[J].计算机工程与应用,2011,47(15):97-100,4.基金项目
浙江省自然科学基金(the Natural Science Foundation of Zhejiang Province of China under Grant No.Y107650,No.Y1090935). （the Natural Science Foundation of Zhejiang Province of China under Grant No.Y107650,No.Y1090935）
