期刊
IEEE COMMUNICATIONS LETTERS
卷 15, 期 8, 页码 845-847出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2011.061611.110963
关键词
Cognitive radio; convex optimization; OFDM; resource allocation
资金
- National Science Foundation of China [61021062]
- Jiangsu Science Foundation [BK2008018, SBK201140016]
- Fundamental Research Funds for the Central Universities [1095021029]
A fast algorithm is proposed to tackle the optimal power allocation problem for orthogonal frequency division multiplexing (OFDM)-based cognitive radio networks, where the key is to replace the Newton step with O(N-3) complexity in the barrier method by a procedure with approximate linear complexity developed based on the structure of the optimization problem. Simulation results validate that our method can always work out the optimal solution, with complexity even lower than heuristic methods that can only produce suboptimal solutions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据