A Low-Complexity Placement Design of Pinching-Antenna Systems

Pinching-antenna systems have recently been proposed as a new candidate for flexible-antenna systems, not only inheriting the reconfiguration capability but also offering a unique feature: establishing line-of-sight links to mitigate large-scale path loss. However, sophisticated optimization of the placement of pinching antennas has very high complexity, which is challenging for practical implementation. This paper proposes a low-complexity placement design, providing the closed-form expression of the placement of pinching antennas, to maximize the sum rate of multiple downlink users. Orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) are both investigated when the pinching-antenna system is only equipped with a single antenna and only the OMA case is studied when there are multiple antennas equipped by the pinching-antenna system. Simulation results indicate pinching-antenna systems can outperform conventional fixed-antenna systems and are more suitable for large service areas.

Power-Efficient Optimization for Coexisting Semantic and Bit-Based Users in NOMA Networks

Semantic communication focuses on transmitting the meaning of data, aiming for efficient, relevant communication, while non-orthogonal multiple access (NOMA) enhances spectral efficiency by allowing multiple users to share the same spectrum. Integrating semantic users into a NOMA network with bit-based users improves both transmission and spectrum efficiency. However, the performance metric for semantic communication differs significantly from that of traditional communication, posing challenges in simultaneously meeting individual user demands and minimizing transmission power, especially in scenarios with coexisting semantic and bit-based users. Furthermore, the different hardware architectures of semantic and bit-based users complicate the implementation of successive interference cancellation (SIC). To address these challenges, in this paper, we propose a clustered framework to mitigate the complexity of SIC and two multiple access (MA) schemes, e.g., pure cluster-based NOMA (P-CNOMA) and hybrid cluster-based NOMA (H-CNOMA), to minimize the total transmission power. The P-CNOMA scheme can achieve the minimum transmission power, but may not satisfy the high quality of service (QoS) requirement. In contrast, H-CNOMA addresses these issues with a slight increase in power and a reduced semantic rate. These two schemes complement each other, enabling an adaptive MA selection mechanism that adapts to specific network conditions and user requirements.

Deep Reinforcement Learning Based Optimization for IRS Based UAV-NOMA Downlink Networks

This paper investigates the application of deep deterministic policy gradient (DDPG) to intelligent reflecting surface (IRS) based unmanned aerial vehicles (UAV) assisted non-orthogonal multiple access (NOMA) downlink networks. The deployment of the UAV equipped with an IRS is important, as the UAV increases the flexibility of the IRS significantly, especially for the case of users who have no line of sight (LoS) path to the base station (BS). Therefore, the aim of this letter is to maximize the sum rate by jointly optimizing the power allocation of the BS, the phase shifting of the IRS and the horizontal position of the UAV. Because the formulated problem is not convex, the DDPG algorithm is utilized to solve it. The computer simulation results are provided to show the superior performance of the proposed DDPG based algorithm.

A Reinforcement Learning Approach for an IRS-assisted NOMA Network

This letter investigates a sum rate maximizationproblem in an intelligent reflective surface (IRS) assisted non-orthogonal multiple access (NOMA) downlink network. Specif-ically, the sum rate of all the users is maximized by jointlyoptimizing the beams at the base station and the phase shiftat the IRS. The deep reinforcement learning (DRL), which hasachieved massive successes, is applied to solve this sum ratemaximization problem. In particular, an algorithm based on thedeep deterministic policy gradient (DDPG) is proposed. Both therandom channel case and the fixed channel case are studied inthis letter. The simulation result illustrates that the DDPG basedalgorithm has the competitive performance on both case.