Simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) is a promising technology to achieve full-space coverage. This paper investigates the resource allocation problem in a STAR-RIS-assisted multi-carrier communication network. To maximize the system sum-rate, a joint optimization problem for orthogonal multiple access (OMA) is first formulated, which is a mixed-integer non-linear programming problem. To solve this challenging problem, we first propose a channel assignment scheme utilizing matching theory and then invoke the alternating optimization-based method to optimize the resource allocation policy and beamforming vectors iteratively. Furthermore, the sum-rate maximization problem for non-orthogonal multiple access (NOMA) is investigated. To efficiently solve it, we first propose a location-based matching algorithm to determine the sub-channel assignment, where a transmitted user and a reflected user are grouped on a sub-channel. Then, a three-step approach is proposed, where the decoding orders, beamforming-coefficient vectors, and power allocation are optimized by employing semidefinite programming, convex upper bound approximation, and geometry programming, respectively. Numerical results unveil that: 1) For OMA, a general design that includes same-side user-pairing for channel assignment is preferable, while for NOMA, the proposed transmission-and-reflection scheme can achieve near-optimal performance. 2) The STAR-RIS-aided NOMA network significantly outperforms the networks employing conventional RISs and OMA.
翻译:同时传输和反映可重新配置的智能表面(STAR-RIS)是一个很有希望的技术,可以实现全空间覆盖。本文调查了STAR-RIS辅助多载通信网络的资源分配问题。为了最大限度地提高系统总和率,我们首先为正心多存访问(OMA)设计了一个基于位置的匹配算法,这是一个混合整数的非线性编程问题。为了解决这个具有挑战性的问题,我们首先建议了一个频道分配方案,利用匹配理论,然后采用基于优化的交替优化法优化资源分配政策和波形向量。此外,还调查了Star-RIS-RIS 辅助多端访问网络(NOMA)的总和最大最大最大最大最大最大量的最大化问题。我们首先提出一个基于位置的匹配算法,以确定分流用户和反映的用户在子通道上的组合。然后,我们提出一个三步方法,在解码命令、波形节制矢量矢量矢量矢量矢量矢量矢量矢量和权力分配方面,通过使用半定式编程的近度编程、正弦式网络(NO-MA)的升级性平面性编程,同时为Sloevalimal-imal-imal-imal-imal-al-al-al-al-al-al-al-la-la-la-la-la-la-la-la-la-la-la- sal- sal- sal-la-la- sal-la-la-la- sal- sal- sal- sal-laine-sma-laine-laine-laine-laine- sal-laine-laine-laine-s-s-laine-laine-laine-s-s-s-al-s-la-la-s-la-la-sma-la-la-la-la-la-la-al-al-s-la-la-la-la-s-al-al-al-al-al-laine-s-al-s-s-s-s-s-s-s-s-s-s-s-s-s-sma-al-sma-lair-S-S-s-s-s-la-la-la-la-