一种基于门限的排序算法及其在OFDM中的应用

A Sorting Algorithm Based on Threshold and Its Application in OFDM

摘要: 随着科技的飞速发展，排序算法不再仅限于计算机领域，越来越来多优异的排序算法开始应用于无线通信领域。OFDM需要选择信道条件好的子载波进行数据传输。传统方法是利用冒泡排序、插入排序等算法提取出最好的n个信道，其缺点是复杂度高。本文提出一种基于门限的排序算法，通过自适应门限的方式设定好一个门限，取出比门限大的元素。所提方法能显著降低复杂度。通过对不同的数据样本进行仿真比较，证明所提方法能较好地接近理想排序。特别在用于OFDM子载波选择时，信道容量性能非常接近。

Abstract: With the rapid development of technology, sort algorithm is not limited in computer areas any longer. More and more outstanding sort algorithm begins to be applied in wireless communications. OFDM needs to select good subcarrier channel conditions for data transmission. Traditional sort methods, including bubble sort and insertion sort, aim to find n best channels. Its disadvantage is that the complexity is high. This paper proposed a sorting algorithm based on threshold which sets a threshold by means of adaptive threshold and get elements that are better than the threshold. The proposed method can significantly reduce the complexity. The simulation results based on different data sample can prove that the proposed method can be better close to the ideal sort. Especially when used in OFDM sub- carrier selection, channel capacity performance is very close.