اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCanonical Dual Method for Resource Allocation and Adaptive Modulation in Uplink SC-FDMA Systems
110
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we study resource allocation and adaptive modulation in SC-FDMA which is adopted as the multiple access scheme for the uplink in the 3GPP-LTE standard. A sum-utility maximization (SUmax), and a joint adaptive modulation and sum-cost minimization (JAMSCmin) problems are considered. Unlike OFDMA, in addition to the restriction of allocating a sub-channel to one user at most, the multiple sub-channels allocated to a user in SC-FDMA should be consecutive as well. This renders the resource allocation problem prohibitively difficult and the standard optimization tools (e.g., Lagrange dual approach widely used for OFDMA, etc.) can not help towards its optimal solution. We propose a novel optimization framework for the solution of these problems that is inspired from the recently developed canonical duality theory. We first formulate the optimization problems as binary-integer programming problems and then transform these binary-integer programming problems into continuous space canonical dual problems that are concave maximization problems. Based on the solution of the continuous space dual problems, we derive resource allocation (joint with adaptive modulation for JAMSCmin) algorithms for both the problems which have polynomial complexities. We provide conditions under which the proposed algorithms are optimal. We also propose an adaptive modulation scheme for SUmax problem. We compare the proposed algorithms with the existing algorithms in the literature to assess their performance.
قيم البحث
اقرأ أيضاً
Non-orthogonal multiple access (NOMA) is envisioned to be one of the most beneficial technologies for next generation wireless networks due to its enhanced performance compared to other conventional radio access techniques. Although the principle of
NOMA allows multiple users to use the same frequency resource, due to decoding complication, information of users in practical systems cannot be decoded successfully if many of them use the same channel. Consequently, assigned spectrum of a system needs to be split into multiple subchannels in order to multiplex that among many users. Uplink resource allocation for such systems is more complicated compared to the downlink ones due to the individual users power constraints and discrete nature of subchannel assignment. In this paper, we propose an uplink subchannel and power allocation scheme for such systems. Due to the NP-hard and non-convex nature of the problem, the complete solution, that optimizes both subchannel assignment and power allocation jointly, is intractable. Consequently, we solve the problem in two steps. First, based on the assumption that the maximal power level of a user is subdivided equally among its allocated subchannels, we apply many-to-many matching model to solve the subchannel-user mapping problem. Then, in order to enhance the performance of the system further, we apply iterative water-filling and geometric programming two power allocation techniques to allocate power in each allocated subchannel-user slot optimally. Extensive simulation has been conducted to verify the effectiveness of the proposed scheme. The results demonstrate that the proposed scheme always outperforms all existing works in this context under all possible scenarios.
The mobile edge computing framework offers the opportunity to reduce the energy that devices must expend to complete computational tasks. The extent of that energy reduction depends on the nature of the tasks, and on the choice of the multiple access
scheme. In this paper, we first address the uplink communication resource allocation for offloading systems that exploit the full capabilities of the multiple access channel (FullMA). For indivisible tasks we provide a closed-form optimal solution of the energy minimization problem when a given set of users with different latency constraints are offloading, and a tailored greedy search algorithm for finding a good set of offloading users. For divisible tasks we develop a low-complexity algorithm to find a stationary solution. To highlight the impact of the choice of multiple access scheme, we also consider the TDMA scheme, which, in general, cannot exploit the full capabilities of the channel, and we develop low-complexity optimal resource allocation algorithms for indivisible and divisible tasks under that scheme. The energy reduction facilitated by FullMA is illustrated in our numerical experiments. Further, those results show that the proposed algorithms outperform existing algorithms in terms of energy consumption and computational cost.
Millimeter wave (mmWave) communication systems using adaptive-resolution analog-to-digital converters (RADCs) have recently drawn considerable interests from the research community as benefit of their high energy efficiency and low implementation cos
t. In this paper, we focus on the mmWave uplink using RADCs and investigate the joint user scheduling and resource allocation problem. Specifically, we seek to maximize the system throughput of the scheduled users by jointly optimizing their transmit power level and hybrid combiners as well as the number of quantization bits, subject to practical constraints. By relying on fractional programming (FP) techniques, we first covert this problem into a form amenable to optimization and exploit the specific structures in its solutions with the aid of the so-called Ky Fan n-norm. Then, the resultant optimization problem is solved using a penalty block successive concave approximation (P-BSCA) algorithm. Our numerical results reveal that the proposed algorithm substantially enhances the throughput of the scheduled users compared to the state-of-theart benchmark schemes and provides more flexible and efficient resource allocation control.
We investigate the joint uplink-downlink design for time-division-duplexing (TDD) and frequency-division-duplexing (FDD) multi-user systems aided by an intelligent reflecting surface (IRS). We formulate and solve a multi-objective optimization proble
m to maximize uplink and downlink rates as a weighted-sum problem (WSP) that captures the trade-off between achievable uplink and downlink rates. We propose a resource allocation design that optimizes the WSP by jointly optimizing the beamforming vectors, power control and IRS phase shifts where the same IRS configuration is used for assisting uplink and downlink transmissions. In TDD, the proposed IRS design reduces the overhead associated with IRS configuration and the need for quiet periods while updating the IRS. In addition, a joint IRS design is critical for supporting concurrent uplink and downlink transmissions in FDD. We investigate the effect of different user-weighting strategies and different parameters on the performance of the joint IRS design and the resultant uplink-downlink trade-off regions. In all FDD scenarios and some TDD scenarios, the joint design significantly outperforms the heuristic of using the IRS configuration optimized for uplink (respectively, downlink) to assist the downlink (respectively, uplink) transmissions and substantially bridges the gap to the upper bound of allowing different IRS configurations in uplink and downlink.
In this work, we investigate hybrid analog-digital beamforming (HBF) architectures for uplink cell-free (CF) millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems. {We first propose two HBF schemes, namely, decentralized HBF
(D-HBF) and semi-centralized HBF (SC-HBF). In the former, both the digital and analog beamformers are generated independently at each AP based on the local channel state information (CSI). In contrast, in the latter, only the digital beamformer is obtained locally at the AP, whereas the analog beamforming matrix is generated at the central processing unit (CPU) based on the global CSI received from all APs. We show that the analog beamformers generated in these two HBF schemes provide approximately the same achievable rates despite the lower complexity of D-HBF and its lack of CSI requirement.} Furthermore, to reduce the power consumption, we propose a novel adaptive radio frequency (RF) chain-activation (ARFA) scheme, which dynamically activates/deactivates RF chains and their connected analog-to-digital converters (ADCs) and phase shifters (PSs) at the APs based on the CSI. For the activation of RF chains, low-complexity algorithms are proposed, which can achieve significant improvement in energy efficiency (EE) with only a marginal loss in the total achievable rate.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
