在经典多输入多输出(MIMO)干扰信道干扰对齐算法中,单纯最大化用户期望信号势必对其他用户形成干扰,从而限制整体信道容量的提升.从多对干扰链路构成一个博弈群体的角度出发,提出了一种基于严格势博弈的干扰对齐算法;构建了基于博弈论的干扰对齐算法数学模型,通过构造有界势函数证明该博弈为有界严格势博弈,能通过有限次迭代收敛到ε纳什均衡点;讨论了代价因子对算法性能的影响.实验结果表明,相对于经典的min-INL和max-SINR 2种干扰对齐算法,新算法具备更优的性能,可显著提高复杂MIMO干扰信道中的多用户信道容量. In classical MIMO interference channel interference alignment algorithm, simply maximizing the user’s desired signal is bound to interfere with other users, thus limiting the overall channel capacity improvement.From the point of view that many pairs of interference links form a game group , An interference alignment algorithm based on rigorous potential game is proposed. A mathematical model of interference alignment algorithm based on game theory is constructed. By constructing a bound potential function, the game is proved to be a rigorous rigorous game with finite potential and can converge to ε Nash equilibrium point.The influence of the cost factor on the performance of the algorithm is discussed.The experimental results show that the new algorithm has better performance than the classical min-INL and max-SINR interference alignment algorithms and can significantly improve the complexity of the MIMO interference channel In the multi-user channel capacity.