期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
基于凸优化的大规模MU-MIMO-OFDM系统峰值平均功率比抑制方法
1
作者 华磊 王亚军 刘爽 《江苏科技大学学报(自然科学版)》 CAS 北大核心 2023年第5期58-64,86,共8页
为了提高大规模多用户-多输入多输出-正交频分复用系统运行效率以及降低系统硬件花费,将凸优化方法引入MU-MIMO-OFDM系统的下行链路中,从而降低发射信号的峰值平均功率比.首先,将多用户预编码、OFDM调制、降低发射信号PAPR及发射信号功... 为了提高大规模多用户-多输入多输出-正交频分复用系统运行效率以及降低系统硬件花费,将凸优化方法引入MU-MIMO-OFDM系统的下行链路中,从而降低发射信号的峰值平均功率比.首先,将多用户预编码、OFDM调制、降低发射信号PAPR及发射信号功率约束建立成数学模型.然后,设计线性交替方向乘子法(linear alternating direction multiplier method,LADMM)求解凸优化问题.仿真结果表明,该方法只需较少的计算复杂度就可在大规模MU-MIMO-OFDM系统中获得很好的降低发射信号峰均比效果,同时具有较低的符号错误率. 展开更多
关键词 多输入多输出 正交频分复用 峰值平均功率比 线性交替方向乘子法 凸优化
下载PDF
Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints
2
作者 Jinxin Wang Fan Zhang +2 位作者 Zhonglin Xie Zaiwen Wen Gong Zhang 《Journal of Communications and Information Networks》 CSCD 2021年第3期237-250,共14页
In this paper,we study the joint bandwidth allocation and path selection problem,which is an extension of the well-known network utility maximization(NUM)problem,via solving a multi-objective minimization problem unde... In this paper,we study the joint bandwidth allocation and path selection problem,which is an extension of the well-known network utility maximization(NUM)problem,via solving a multi-objective minimization problem under path cardinality constraints.Specifically,such a problem formulation captures various types of objectives including proportional fairness,average delay,as well as load balancing.In addition,in order to handle the"unsplittable flows",path cardinality constraints are added,making the resulting optimization problem quite challenging to solve due to intrinsic nonsmoothness and nonconvexity.Almost all existing works deal with such a problem using relaxation techniques to transform it into a convex optimization problem.However,we provide a novel solution framework based on the linearized alternating direction method of multipliers(LADMM)to split the original problem with coupling terms into several subproblems.We then derive that these subproblems,albeit nonconvex nonsmooth,are actually simple to solve and easy to implement,which can be of independent interest.Under some mild assumptions,we prove that any limiting point of the generated sequence of the proposed algorithm is a stationary point.Numerical simulations are performed to demonstrate the advantages of our proposed algorithm compared with various baselines. 展开更多
关键词 bandwidth allocation unsplittable flows cardinality constraints network utility maximization ladmm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部