基于MMAS的MIMO-OFDM系统上行多用户检测

发布时间：2018-02-25 00:25

本文关键词： 多输入多输出正交频分复用系统多用户检测最大最小蚂蚁系统信息素　出处：《重庆邮电大学学报(自然科学版)》2015年06期 　论文类型：期刊论文

【摘要】：在多输入多输出-正交频分复用(multiple input multiple output-orthogonal frequency division multiplexing,MIMO-OFDM)系统上行多用户检测(multi-user detection,MUD)中,针对基本蚁群算法(ant colony optimization,ACO)在搜索过程中易出现过早停滞及收敛于局部最优解等问题,提出一种基于最大最小蚁群系统(max-min ant system,MMAS)的MUD新算法。该算法在蚁群每次循环结束后,仅处于最优路径上的单只蚂蚁释放信息素;同时,通过限制每条路径上信息素的取值范围,避免路径间信息素的差值过大,从而使蚂蚁在每次循环时尽可能地选择不同的路径,提高算法的搜索能力。仿真结果表明,MMAS算法能够有效降低蚁群陷入局部最优解的概率,进而提高了检测性能;同时,随用户数的增加,该算法的计算复杂度却远低于最大似然(maximum likelihood,ML)检测算法,因此,该算法能够在检测性能与计算复杂度之间取得较好的折中。
[Abstract]:In multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) uplink multiuser detection multi-user detection (mud), the basic ant colony algorithm, ant colony optimization (ACOs), is prone to premature stagnation and convergence to the local optimal solution in the search process. This paper presents a new MUD algorithm based on max-min ant system MMAS. this algorithm releases pheromone only to a single ant on the optimal path after each cycle of the ant colony ends, and limits the value range of pheromone in each path. The difference of pheromone between paths is avoided so that ants can choose different paths as much as possible in each cycle and improve the search ability of the algorithm. The simulation results show that the MMAS algorithm can effectively reduce the probability of ant colony falling into the local optimal solution. At the same time, with the increase of the number of users, the computational complexity of the algorithm is much lower than that of the maximum likelihood like like MLM algorithm. Therefore, the algorithm can achieve a better compromise between detection performance and computational complexity.
【作者单位】：重庆邮电大学移动通信技术重点实验室;
【基金】：国家科技重大专项(2014ZX03001009-003)~~
【分类号】：TN919.3

【参考文献】