期刊文献+

无线通信中的最优资源分配―复杂性分析与算法设计 被引量:2

Optimal resource allocation for wireless communications:Complexity analysis and algorithm design
原文传递
导出
摘要 最优资源分配问题是无线通信系统设计中的基本问题之一.最优地分配功率、传输波形和频谱等资源能够极大地提高整个通信系统的传输性能.目前,相对于通信技术在现实生活中的蓬勃发展,通信系统优化的数学理论和方法显得相对滞后,在某些方面已经成为影响其发展和应用的关键因素.无线通信中的最优资源分配问题常常可建模为带有特殊结构的非凸非线性约束优化问题.一方面,这些优化问题常常具有高度的非线性性,一般情况下难于求解;另一方面,它们又有自身的特殊结构,如隐含的凸性和可分结构等.本文着重考虑多用户干扰信道中物理层资源最优分配问题的复杂性刻画,以及如何利用问题的特殊结构设计有效且满足分布式应用等实际要求的计算方法. Resource allocation is a fundamental problem in the design of wireless communication systems. The mutual interference among users, which is a major factor of limiting the performance of communication systems, can be efficiently mitigated by carefully allocating wireless resources such as transmission power, transmission waveforms, and frequency bands. Current mathematical theories and methods for the design of communication systems lag behind the rapid development of communication technologies, and sometimes influence their devel- opments and applications. Most of the resource allocation problems arising from wireless communications boil down to non-convex nonlinear constrained optimization problems with special structures. On one hand, these op- timization problems are often non-convex and highly nonlinear, and thus are difficult to solve; on the other hand, these problems have their own special structures such as (hidden) convexity and separability. This paper focuses on the optimal physical layer resource allocation problems for the multi-user interference channel, especially on characterizing the computational complexity of these problems, and designing efficient algorithms (satisfying some practical requirements like distributed implementation) for these problems by the use of their special structures.
作者 刘亚锋
出处 《中国科学:数学》 CSCD 北大核心 2013年第10期953-964,共12页 Scientia Sinica:Mathematica
基金 国家自然科学基金(批准号:10831006和11301516) 国家杰出青年科学基金(批准号:11125107)资助项目
关键词 最优资源分配 复杂性分析 算法设计 波束成形设计 optimal resource allocation, complexity analysis, algorithm design, beamforming design
  • 相关文献

参考文献28

  • 1刘亚锋.无线通信中的最优资源分配-复杂性分析与算法设计.博士学位论文.北京:中国科学院数学与系统科学研究院,2012.
  • 2Liu Y F, Dai Y H, Luo Z Q. Coordinated beamforming for MISO interference channel: Complexity analysis and efficient algorithms. IEEE Trans Signal Process, 2011, 59:1142-1157.
  • 3Liu Y F, Dai Y H, Luo Z Q. On the complexity of optimal coordinated downlink beamforming. In: Proceedings of the 35th International Conference on Acoustics, Speech, and Signal Processing. Washington: IEEE Signal Processing Society, 2010, 3274-3277.
  • 4Liu Y F, Dai Y H, Luo Z Q. On the complexity of leakage interference minimization for interference alignment. In: Proceedings of the 12th IEEE International Workshop on Signal Processing Advances in Wireless Communications. Washington: IEEE Signal Processing Society, 2011, 471-475.
  • 5Liu Y F, Dai Y H, Luo Z Q. Max-min fairness linear transceiver design for a multi-user MIMO interference channel. IEEE Trans Signal Process, 2013, 61:2413-2423.
  • 6Liu Y F, Hong M, Dai Y H. Max-min fairness linear transceiver design problem for a multi-user SIMO interference channel is polynomial time solvable. IEEE Signal Process Lett, 2013, 20:27-30.
  • 7Liu Y F, Dai Y H, Luo Z Q. Max-min fairness linear transceiver design for a multi-user MIMO interference channel. In: Proceedings of the IEEE International Conference on Communications. Washington: IEEE Communications Society, 2011, 1-5.
  • 8Liu Y F, Dai Y H, Luo Z Q. Joint power and admission control via linear programming deflation. IEEE Trans Signal Process, 2013, 61:1327 1338.
  • 9Liu Y F. An efficient distributed joint power and admission control algorithm. In: Proceedings of the 31th Chinese Control Conference. Washington: IEEE, 2012, 5508-5512.
  • 10Liu Y F, Dai Y H. Joint power and admission control via p norm minimization deflation. In: Proceedings of the 38th International Conference on Acoustics, Speech, and Signal Processing. Washington: IEEE Trans Signal Process, inpress, 2013.

同被引文献2

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部