اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPower and subcarrier allocation in multicarrier NOMA-FD systems
133
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we study the problem of power and channel allocation for multicarrier non-orthogonal multiple access (NOMA) full duplex (FD) systems. In such a system there are multiple interfering users transmitting over the same channel and the allocation task is a non-convex and extremely challenging problem. The objective of our work is to propose a solution that is close to the theoretic optimum but is of limited complexity. Following a block coordinate descent approach, we propose two algorithms based on the decomposition of the original allocation problem in lower-complexity sub-problems, which can be solved in the Lagrangian dual domain with a great reduction of the computational load. Numerical results show the effectiveness of approach we propose, which outperforms other schemes designed to address NOMA-FD allocation and attains performance similar to the optimal solution with much lower complexity.
قيم البحث
اقرأ أيضاً
In this paper we study the problem of power and channel allocation with the objective of maximizing the system sum-rate for multicarrier non-orthogonal multiple access (NOMA) full duplex (FD) systems. Such an allocation problem is non-convex and, thu
s, with the goal of designing a low complexity solution, we propose a scheme based on the minimization of the weighted mean square error, which achieves performance reasonably close to the optimum and allows to clearly outperforms a conventional orthogonal multiple access approach. Numerical results assess the effectiveness of our algorithm.
In this paper, power allocation is examined for the coexistence of a radar and a communication system that employ multicarrier waveforms. We propose two designs for the considered spectrum sharing problem by maximizing the output signal-to-interferen
ce-plus-noise ratio (SINR) at the radar receiver while maintaining certain communication throughput and power constraints. The first is a joint design where the subchannel powers of both the radar and communication systems are jointly optimized. Since the resulting problem is highly nonconvex, we introduce a reformulation by combining the power variables of both systems into a single stacked variable, which allows us to bypass a conventional computationally intensive alternating optimization procedure. The resulting problem is then solved via a quadratic transform method along with a sequential convex programming (SCP) technique. The second is a unilateral design which optimizes the radar transmission power with fixed communication power. The unilateral design is suitable for cases where the communication system pre-exists while the radar occasionally joins the channel as a secondary user. The problem is solved by a Taylor expansion based iterative SCP procedure. Numerical results are presented to demonstrate the effectiveness of the proposed joint and unilateral designs in comparison with a subcarrier allocation based method.
Secure communication is a promising technology for wireless networks because it ensures secure transmission of information. In this paper, we investigate the joint subcarrier (SC) assignment and power allocation problem for non-orthogonal multiple ac
cess (NOMA) amplify-and-forward two-way relay wireless networks, in the presence of eavesdroppers. By exploiting cooperative jamming (CJ) to enhance the security of the communication link, we aim to maximize the achievable secrecy energy efficiency by jointly designing the SC assignment, user pair scheduling and power allocation. Assuming the perfect knowledge of the channel state information (CSI) at the relay station, we propose a low-complexity subcarrier assignment scheme (SCAS-1), which is equivalent to many-to-many matching games, and then SCAS-2 is formulated as a secrecy energy efficiency maximization problem. The secure power allocation problem is modeled as a convex geometric programming problem, and then solved by interior point methods. Simulation results demonstrate that the effectiveness of the proposed SSPA algorithms under scenarios of using and not using CJ, respectively.
This paper investigates the application of non-orthogonal multiple access in millimeter-Wave communications (mmWave-NOMA). Particularly, we consider downlink transmission with a hybrid beamforming structure. A user grouping algorithm is first propose
d according to the channel correlations of the users. Whereafter, a joint hybrid beamforming and power allocation problem is formulated to maximize the achievable sum rate, subject to a minimum rate constraint for each user. To solve this non-convex problem with high-dimensional variables, we first obtain the solution of power allocation under arbitrary fixed hybrid beamforming, which is divided into intra-group power allocation and inter-group power allocation. Then, given arbitrary fixed analog beamforming, we utilize the approximate zero-forcing method to design the digital beamforming to minimize the inter-group interference. Finally, the analog beamforming problem with the constant-modulus constraint is solved with a proposed boundary-compressed particle swarm optimization algorithm. Simulation results show that the proposed joint approach, including user grouping, hybrid beamforming and power allocation, outperforms the state-of-the-art schemes and the conventional mmWave orthogonal multiple access system in terms of achievable sum rate and energy efficiency.
The combination of non-orthogonal multiple access (NOMA) and intelligent reflecting surface (IRS) is an efficient solution to significantly enhance the energy efficiency of the wireless communication system. In this paper, we focus on a downlink mult
i-cluster NOMA network, where each cluster is supported by one IRS. We aim to minimize the transmit power by jointly optimizing the beamforming, the power allocation and the phase shift of each IRS. The formulated problem is non-convex and challenging to solve due to the coupled variables, i.e., the beamforming vector, the power allocation coefficient and the phase shift matrix. To address this non-convex problem, we propose an alternating optimization based algorithm. Specifically, we divide the primal problem into the two subproblems for beamforming optimization and phase shifting feasiblity, where the two subproblems are solved iteratively. Moreover, to guarantee the feasibility of the beamforming optimization problem, an iterative algorithm is proposed to search the feasible initial points. To reduce the complexity, we also propose a simplified algorithm based on partial exhaustive search for this system model. Simulation results demonstrate that the proposed alternating algorithm can yield a better performance gain than the partial exhaustive search algorithm, OMA-IRS, and NOMA with random IRS phase shift.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
