论文标题

RIS辅助的多源MIMO-OFDM具有线性预编码和迭代检测:分析和优化

RIS-Aided Multiuser MIMO-OFDM with Linear Precoding and Iterative Detection: Analysis and Optimization

论文作者

Yue, Mingyang, Liu, Lei, Yuan, Xiaojun

论文摘要

在本文中,我们考虑了可重构智能表面(RIS)辅助上行链路多源多输入多输出(MIMO)正交频次频施加多路复用(OFDM)系统,其中假定接收器可以进行低复杂性迭代检测。我们的目标是通过共同设计发射器的预码器和RIS的被动光束来最大程度地减少总发射功率。可以从信息理论的角度解决这个问题。但是,这种信息理论方法可能涉及过高的复杂性,因为指定上行链路多源通道的容量区域的速率约束数量在用户数量中是指数的。为了避免这种困难,我们在最大迭代编号和用户的目标位错误率的约束下制定了迭代接收器的设计问题。为了解决这个具有挑战性的问题,我们提出了一个群体连续的干扰取消(SIC)优化方法,在该方法中,用户的信号以小组的方式解码和取消。我们提出了一种启发式用户分组策略,并诉诸交替的优化技术,以迭代地解决了预编码和被动边界的子问题。具体而言,对于预编码的子问题,我们采用分数编程将其转换为凸问题。对于被动边缘的子问题,我们采用连续的凸近似来处理RI的单位模式约束。我们表明,与对应方法相比,所提出的群体方向方法在性能和计算复杂性方面具有显着优势。

In this paper, we consider a reconfigurable intelligence surface (RIS) aided uplink multiuser multi-input multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) system, where the receiver is assumed to conduct low-complexity iterative detection. We aim to minimize the total transmit power by jointly designing the precoder of the transmitter and the passive beamforming of the RIS. This problem can be tackled from the perspective of information theory. But this information-theoretic approach may involve prohibitively high complexity since the number of rate constraints that specify the capacity region of the uplink multiuser channel is exponential in the number of users. To avoid this difficulty, we formulate the design problem of the iterative receiver under the constraints of a maximal iteration number and target bit error rates of users. To tackle this challenging problem, we propose a groupwise successive interference cancellation (SIC) optimization approach, where the signals of users are decoded and cancelled in a group-by-group manner. We present a heuristic user grouping strategy, and resort to the alternating optimization technique to iteratively solve the precoding and passive beamforming sub-problems. Specifically, for the precoding sub-problem, we employ fractional programming to convert it to a convex problem; for the passive beamforming sub-problem, we adopt successive convex approximation to deal with the unit-modulus constraints of the RIS. We show that the proposed groupwise SIC approach has significant advantages in both performance and computational complexity, as compared with the counterpart approaches.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源