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

# 一种基于门限的排序算法及其在OFDM中的应用A Sorting Algorithm Based on Threshold and Its Application in OFDM

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.

[1] Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2009) Introduction to algorithms. 3rd Edition, The MIT Press, Cam- bridge, 71-112.

[2] Frances, G. (2005) An in-place sorting with o(nlogn) com- parisons and o(n) moves. Journal of the ACM (JACM), 52, 515-537.

[3] Chien, M.V. and Oruc, A.Y. (1994) Adaptive binary sorting schemes and associated interconnection networks. IEEE Trans- actions on Parallel and Distributed System, 5, 561-572.

[4] Jang, J. and Lee, K.B. (2003) Transmit power adaptation for multiuser OFDM systems. IEEE Journal on Selected Areas in Communications, 21, 171-178.

[5] Bolckei, H., Gesbert, D. and Paulraj, A.J. (2002) On the capacity of OFDM-based spatial multiplexing systems. IEEE Trans- actions on Communications, 50, 225-234.

[6] 万庆涛 (2011) 中继OFDMA系统容量公平资源分配算法研究. 计算机工程与应用, 47, 221-230.

Top