中文摘要：

在蜂窝网络中,多基站间协作传输能够显著提升用户的频谱效率,但巨大的反馈开销使得该方式难以实现.文章提出了一种分布式动态小区成簇算法,该算法消除了对中央处理单元收集完整信道状态信息的依赖。并且在计算优先权函数时将矩阵乘法运算简化为标量求和运算,省略了基于信号功率与噪声干扰比值求信道容量的计算步骤,降低了运算复杂度.实验结果表明,该算法的各小区速率性能之和,明显优于静态分簇算法并且十分接近集中式贪婪分簇算法,具有较低的复杂度和信道估计开销.协作簇大小为3时,算法能够在速率性能与算法复杂度间取得最佳的效果.

英文摘要：

In cellular networks, collaboration between multiple base station transmissions can significantly improve user efficiency, but significant feedback overhead makes it difficult to achieve. Distributed and dynamic community clusters are presented in .this algorithm, which eliminates dependence on complete central processing unit collecting channel state information, and matrix multiplication in calculating the priority function is simplified to scalars sum has been omitted based on signal power and noise ratio find the channel capacity calculation steps, reduces the complexity of the operation. Experimental results show that the cell rates the performance of the algorithm, and is superior to the static clustering algorithms and very close to the centralized greedy clustering algorithm with low complexity channel estimation and overhead. When the collaborative cluster size is 3, we should rate the performance of the algorithm and algorithm complexity to achieve the best results.