Different from traditional reflection-only reconfigurable intelligent surfaces (RISs), simultaneously transmitting and reflecting RISs (STAR-RISs) represent a novel technology, which extends the half-space coverage to full-space coverage by simultaneously transmitting and reflecting incident signals. STAR-RISs provide new degrees-of-freedom (DoF) for manipulating signal propagation. Motivated by the above, a novel STAR-RIS assisted non-orthogonal multiple access (NOMA) (STAR-RIS-NOMA) system is proposed in this paper. Our objective is to maximize the achievable sum rate by jointly optimizing the decoding order, power allocation coefficients, active beamforming, and transmission and reflection beamforming. However, the formulated problem is non-convex with intricately coupled variables. To tackle this challenge, a suboptimal two-layer iterative algorithm is proposed. Specifically, in the inner-layer iteration, for a given decoding order, the power allocation coefficients, active beamforming, transmission and reflection beamforming are optimized alternatingly. For the outer-layer iteration, the decoding order of NOMA users in each cluster is updated with the solutions obtained from the inner-layer iteration. Moreover, an efficient decoding order determination scheme is proposed based on the equivalent-combined channel gains. Simulation results are provided to demonstrate that the proposed STAR-RIS-NOMA system, aided by our proposed algorithm, outperforms conventional RIS-NOMA and RIS assisted orthogonal multiple access (RIS-OMA) systems.
翻译:与传统的反射可重新配置智能表面(RIS)不同,同时传输和反映RIS(STAR-RIS)是一种新型技术,它通过同时传输和反映事件信号,将半空覆盖扩大到整个空间覆盖,同时传输和反映事件信号。STAR-RIS为调控信号传播提供了新的自由度(DoF) 。根据上述情况,本文件提议了一个新型的STAR-RIS辅助非垂直多存取系统(NOMA) (STAR-RIS-NOMA) (NOMA) 。我们的目标是通过联合优化解码顺序、电源分配系数、主动波形成形、传输和反映成形,将半空空间覆盖扩大到整个空间覆盖。然而,所拟订的问题是非冷却度度(DoF), 为了应对这一挑战,提出了一个亚光度的双层迭代迭接算算法。具体来说,为了给一个解码的分解顺序,(STAR-RIS-NORA) 、 主动对调制、传输和反映式反射速速速速率,正在优化对等等式调整。对于每一个的系统来说,一个由IMMA IMAL-S-LA 更新的计算,一个SLA-S-LA-SIMAL-S-imLA-S-S-S-S-deal-S-S-S-S-S-S-S-S-S-S-S-S-A-S-A-A-S-A-A-S-S-S-S-S-A-S-A-A-A-A-A-A-A-A-S-S-S-S-S-A-A-A-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-A-A-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-A-A-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-A-A-A-S-S-A