首页> 外文OA文献 >Canonical Dual Method for Resource Allocation and Adaptive Modulation in Uplink SC-FDMA Systems
【2h】

Canonical Dual Method for Resource Allocation and Adaptive Modulation in Uplink SC-FDMA Systems

机译:用于资源分配和自适应调制的典型对偶方法   上行链路sC-FDma系统

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we study resource allocation and adaptive modulation inSC-FDMA which is adopted as the multiple access scheme for the uplink in the3GPP-LTE standard. A sum-utility maximization (SUmax), and a joint adaptivemodulation and sum-cost minimization (JAMSCmin) problems are considered. UnlikeOFDMA, in addition to the restriction of allocating a sub-channel to one userat most, the multiple sub-channels allocated to a user in SC-FDMA should beconsecutive as well. This renders the resource allocation problem prohibitivelydifficult and the standard optimization tools (e.g., Lagrange dual approachwidely used for OFDMA, etc.) can not help towards its optimal solution. Wepropose a novel optimization framework for the solution of these problems thatis inspired from the recently developed canonical duality theory. We firstformulate the optimization problems as binary-integer programming problems andthen transform these binary-integer programming problems into continuous spacecanonical dual problems that are concave maximization problems. Based on thesolution of the continuous space dual problems, we derive resource allocation(joint with adaptive modulation for JAMSCmin) algorithms for both the problemswhich have polynomial complexities. We provide conditions under which theproposed algorithms are optimal. We also propose an adaptive modulation schemefor SUmax problem. We compare the proposed algorithms with the existingalgorithms in the literature to assess their performance.
机译:在本文中,我们研究了SC-FDMA中的资源分配和自适应调制,SC-FDMA被用作3GPP-LTE标准中上行链路的多址方案。考虑了总和效用最大化(SUmax),联合自适应调制和总和成本最小化(JAMSCmin)问题。与OFDMA不同,除了最多只能给一个用户分配一个子信道的限制外,在SC-FDMA中分配给一个用户的多个子信道也应该是连续的。这使得资源分配问题变得异常困难,并且标准优化工具(例如,广泛地用于OFDMA的拉格朗日对偶等)无法帮助其实现最佳解决方案。我们提出了一种新颖的优化框架来解决这些问题,该框架受到了最近发展的规范对偶理论的启发。我们首先将优化问题表述为二进制整数规划问题,然后将这些二进制整数规划问题转换为连续的空间规范对偶问题,它们是凹极大化问题。在解决连续空间对偶问题的基础上,针对两个具有多项式复杂性的问题,推导了资源分配(JAMSCmin自适应调制联合算法)。我们提供了最佳算法的条件。我们还针对SUmax问题提出了一种自适应调制方案。我们将提出的算法与文献中的现有算法进行比较,以评估其性能。

著录项

  • 作者

    Ahmad, Ayaz; Assaad, Mohamad;

  • 作者单位
  • 年度 2012
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"English","id":9}
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号