betaFeedback

WorksComputer Science

Mutual-Coupling-Aware Joint Precoding and Antenna Positioning for Movable-Antenna MU-MIMO Systems

Abstract

Movable antennas (MAs) improve wireless communications by adapting antenna positions to the propagation environment. However, antenna movement also changes the mutual coupling (MC) among elements of the transmit and receive arrays, which affects the performance of MA-enabled systems. In this paper, we investigate MC-aware joint precoding and antenna positioning for a downlink multiuser multiple-input multiple-output (MU-MIMO) system with MAs at both the base station and users. We establish an MC-aware system model by combining field-response propagation with a circuit-based representation of the transmit and receive arrays. Based on this model, we formulate a weighted sum-rate (WSR) maximization problem that jointly optimizes multi-stream precoders and antenna positions. The problem is challenging because the precoders and positions are coupled through the propagation channels and position-dependent MC matrices. To address this challenge, we reformulate the problem in the antenna-current domain to to efficiently handle the MC matrices and develop a current-domain weighted minimum mean square error (WMMSE) framework for alternating optimization. Furthermore, we handle the nonconvex position updates within the framework by using majorization–minimization (MM) and solve the resulting convex subproblems with a dedicated conic alternating direction method of multipliers (ADMM) algorithm. Simulation results demonstrate that the proposed design improves the WSR over both an MC-aware fixed array and a movable-array design that ignores MC during optimization.

The authors are with the Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Hong Kong SAR. Emails: [email protected], [email protected], [email protected], {eesshong, eejzhang, eekhaled}@ust.hk.

Introduction

Sixth-generation (6G) wireless networks are envisioned to support diverse applications, from immersive communication to intelligent connected systems, with increasingly demanding data rate and connectivity requirements [1, 2, 3]. Multiuser multiple-input multiple-output (MU-MIMO) systems use multiple antennas to serve users simultaneously, with precoding at the base station (BS) and receive processing managing interference [4, 5]. Their performance depends on the propagation channels, but conventional arrays have fixed element positions and cannot adapt them to changing channel conditions. Recently, reconfigurable antenna systems, including movable antennas (MAs) and fluid antenna systems (FASs), have emerged as a means of addressing this limitation by adapting antenna positions to the propagation environment [6, 7, 8, 9]. By introducing antenna position as a design dimension, these systems offer greater flexibility in using the available spatial resources. The antenna positions can be configured alongside other communication parameters to improve system performance under different operating conditions.

In an MA system, antenna movement changes both the propagation channels and the electromagnetic interactions within the arrays. Specifically, movement changes the phases of multipath components and reshapes the channels [6, 10], while also changing the element separations and hence the mutual coupling (MC) within the transmit and receive arrays [11, 12]. MA system design therefore needs to account for both effects of antenna movement. In particular, MC affects the effective channels, the transmit power associated with the antenna currents, and the receive noise covariance [11, 13]. Antenna positions that improve the propagation channels may also change these coupling-dependent quantities, so their overall impact on performance cannot be assessed from propagation alone. In a multiuser system, these effects influence both desired signals and interference, and must therefore be considered when adapting antenna positions and precoding to serve the users. This motivates the joint design of precoding and transmit and receive antenna positions for MA-enabled MU-MIMO systems with MC.

Existing studies relevant to this problem have explored antenna position optimization in MA-enabled MIMO systems and the effects of MC on communication performance. The former examines how position adaptation can improve communication performance, often together with transceiver design. The latter provides models for relating electromagnetic interactions to communication performance and includes recent work on position-dependent MC in movable arrays.

Optimization of MA-enabled MIMO and MU-MIMO systems:

The field-response model provides a framework for describing how antenna movement changes a multipath channel [6, 10]. Based on this model, the authors of [6] investigated point-to-point MIMO capacity by jointly optimizing the transmit and receive MA positions and the transmit covariance matrix. For MIMO-FAS, New et al. [7] studied joint port selection and transceiver design and analyzed the associated information-theoretic performance. In multiuser communication, antenna positioning can improve spatial separation between users as well as their individual channel strengths. Zhu et al. [14] demonstrated this benefit by optimizing antenna positions and receive combining for multiuser transmission.

Joint design of beamforming and antenna positions has since been studied under different multiuser objectives and system configurations. In particular, Feng et al. [15] employed weighted minimum mean square error (WMMSE) and majorization–minimization (MM) methods to optimize beamforming and MA positions for weighted sum-rate (WSR) maximization. For FAS-assisted MU-MIMO, Liao et al. [16] combined matrix fractional programming with parallel position updates and developed a decentralized implementation to reduce computation time. The authors of [17] incorporated transmit and receive antenna movement into a flexible WMMSE beamforming framework, using sparse optimization to select antenna locations. Beyond instantaneous joint design, Zheng et al. [18] considered a two-timescale approach that adapts positions to channel statistics and beamforming to instantaneous channels. The authors of [19] addressed WSR maximization with near-field propagation, while Irshad et al. [20] evaluated MA arrays in wideband multiuser operation, including hardware impairments and their interaction with user loading. These studies demonstrate the versatility of antenna position adaptation, but their optimization models do not explicitly account for position-dependent MC within the arrays.

Mutual coupling in antenna arrays:

MC has long been studied using circuit-based communication models, which describe antenna arrays as multiport networks and connect their electromagnetic behavior to communication performance [13]. For dense holographic arrays, Yuan et al. [21] examined the effects of MC on spatial degrees of freedom and antenna efficiency, while Pizzo and Lozano [22] analyzed coupling and spatial correlation and showed how antenna patterns can be designed to improve information-theoretic performance. In an MA array, coupling is not determined solely by a fixed deployment: it varies with the antenna positions and therefore changes during position optimization. A minimum-spacing constraint can limit coupling and prevent physical overlap, but it does not generally eliminate coupling for arbitrary antenna types and arrangements. Moreover, treating coupling only as an impairment can overlook the performance attainable by accounting for it in array design.

Recent work has begun to investigate this opportunity. The authors of [23] incorporated MC into MA array design and employed a hybrid convex and particle swarm optimization method for sum-rate maximization, while Xu et al. [24] optimized MA positions to enhance array directivity. For planar fluid arrays, Zhang et al. [25] developed a current-domain electromagnetic model incorporating coupling and power constraints. The authors of [26] related circuit-based coupling matrices to field-theoretic kernels for movable and fluid antennas on holographic surfaces. Further studies considered coupling-aware beam synthesis through continuous position refinement [27] and sparse port selection [28]. These array and beam synthesis studies highlight the importance of modeling the relationship between port excitation, antenna currents, and radiation when positions or active ports change.

In our previous work [11], we combined field-response and circuit-based models to study MC-aware capacity maximization in point-to-point MA-MIMO systems. That work showed how antenna movement can jointly reshape the propagation channel and coupling matrices. In a multiuser downlink, Xu et al. [12] considered position-dependent coupling and jointly optimized MA positions and beamforming for sum-rate maximization using greedy search, gradient descent, and fractional programming. The point-to-point formulation in [11] does not involve inter-user interference, whereas the multiuser setting in [12] focuses on beamforming and the positions of the transmit antennas.

These studies show that antenna movement can reshape both propagation channels and array coupling. In a multiuser downlink, the same transmit and receive antenna positions therefore influence desired signals and inter-user interference, as well as coupling-dependent transmit power and receive noise. Jointly accounting for these effects changes the position-design problem beyond propagation-channel adaptation. However, joint optimization of multi-stream precoders and antenna positions at both the BS and users under position-dependent MC remains an open problem.

Contributions

In this paper, we investigate MC-aware WSR maximization in a downlink MA-enabled MU-MIMO system and develop an alternating framework for joint precoding and antenna positioning. Our main contributions are as follows.

  • We establish an MC-aware MU-MIMO model by combining field-response propagation with a circuit-based representation of the transmit and receive arrays. The model captures the coupled effects of movement on propagation channels and array interactions, including the resulting changes in accepted transmit power and receive noise. Based on this model, we formulate a WSR maximization problem that jointly optimizes multi-stream precoders and antenna positions under power, movement region, and minimum-spacing constraints.

  • To address the position-dependent inverse square roots of the coupling matrices in the effective channels, we develop an equivalent current-domain representation using transmit antenna currents and receive port observations. This representation avoids the matrix inverse square roots while retaining MC in the transmit power and receive noise covariance. The WSR remains non-concave and couples the precoders and positions. We therefore establish an equivalent WMMSE formulation and develop an alternating framework for their joint optimization.

  • For fixed antenna positions, the precoders can be updated using WMMSE, but the antenna position subproblems remain nonconvex. We therefore develop adaptive phase graph majorization for the position subproblems. We exploit the channel phase and pairwise MC structures to construct quadratic upper bounds for the objective and transmit power. Combining these bounds with inner approximations of the spacing constraints yields convex subproblems. We develop a conic alternating direction

method of multipliers (ADMM) algorithm that exploits their shared structure and closed-form cone projections to efficiently solve the subproblems. The remainder of this paper is organized as follows. Section II present the system model and problem formulation. Section III introduces the proposed optimization framework. Numerical results are provided in Section IV, and conclusions are drawn in Section V.

System Model and Problem Formulation

As illustrated in Figure 1, we consider a downlink MU-MIMO system consisting of one BS and KK users. The BS is equipped with MM movable antenna elements, while user kk is equipped with NkN_k movable antenna elements. Each element has a fixed orientation and a single feed port, and we use the same index for an element and its associated port. The BS and all users are located in the far-field region of each other. The BS transmits dkd_k independent data streams to user kk, where dk≤min⁡{M,Nk}d_k \le\min\{M,N_k\}. The transmit antennas can move within a prescribed two-dimensional region AT⊂R2\mathcal{A}_{\mathrm{T}} \subset\mathbb{R}^{2}. Let pT,m∈AT\mathbf{p}_{\mathrm{T},m} \in\mathcal{A}_{\mathrm{T}} denote the position of transmit antenna mm, and collect the transmit antenna positions as

Figure 1. MA-enabled MU-MIMO downlink system. In the upper panel, gray and colored traces show the highlighted configurations before and after antenna movement. The movement changes path phases (ϕ→ϕ′\phi\to\phi') and inter-element spacings (r→r′r \to r'), producing channel shaping and MC variation that jointly affect the WSR. The lower panel gives the circuit-based current-domain representation using transmit antenna currents and receive port observation zkz_k. The details of this representation are presented in Section II-B.

PT≜[pT,1,…,pT,M]∈R2×M.(1)\mathbf{P}_{\mathrm{T}} \triangleq[\mathbf{p}_{\mathrm{T},1},\ldots,\mathbf{p}_{\mathrm{T},M}] \in\mathbb{R}^{2 \times M}. \tag*{(1)}

Similarly, the receive antennas of user kk can move within a prescribed two-dimensional region AR,k⊂R2\mathcal{A}_{\mathrm{R},k} \subset\mathbb{R}^{2}. With pR,k,n∈AR,k\mathbf{p}_{\mathrm{R},k,n} \in\mathcal{A}_{\mathrm{R},k} denoting the position of receive antenna nn, the receive antenna positions of user kk are collected as

PR,k≜[pR,k,1,…,pR,k,Nk]∈R2×Nk.(2)\mathbf{P}_{\mathrm{R},k} \triangleq[\mathbf{p}_{\mathrm{R},k,1},\ldots,\mathbf{p}_{\mathrm{R},k,N_k}] \in\mathbb{R}^{2 \times N_k}. \tag*{(2)}

Field-Response Channel Model

We adopt the field-response model to characterize the physical propagation channel [6], [10]. Let LT,kL_{\mathrm{T},k} and LR,kL_{\mathrm{R},k} denote the numbers of transmit and receive propagation paths associated with user kk, respectively. The projections of the departure and arrival directions onto the local antenna movement planes are denoted by νT,k,ℓ∈R2\boldsymbol{\nu}_{\mathrm{T},k,\ell} \in\mathbb{R}^{2}, ℓ=1,…,LT,k\ell= 1,\ldots,L_{\mathrm{T},k}, and νR,k,q∈R2\boldsymbol{\nu}_{\mathrm{R},k,q} \in\mathbb{R}^{2}, q=1,…,LR,kq = 1,\ldots,L_{\mathrm{R},k}, respectively. For a projected departure direction νT∈R2\boldsymbol{\nu}_{\mathrm{T}} \in\mathbb{R}^{2}, the transmit steering vector is

aT(PT,νT)=[ejκνTTpT,1,…,ejκνTTpT,M]T∈CM,(3)\mathbf{a}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}},\boldsymbol{\nu}_{\mathrm{T}}) = \left[ e^{\mathrm{j}\kappa\boldsymbol{\nu}_{\mathrm{T}}^{\mathsf{T}}\mathbf{p}_{\mathrm{T},1}}, \ldots, e^{\mathrm{j}\kappa\boldsymbol{\nu}_{\mathrm{T}}^{\mathsf{T}}\mathbf{p}_{\mathrm{T},M}} \right]^{\mathsf{T}} \in\mathbb{C}^{M}, \tag*{(3)}

where κ=2π/λ\kappa= 2\pi/\lambda is the wavenumber and λ\lambda is the wavelength. Similarly, the receive steering vector of user kk for a projected arrival direction νR∈R2\boldsymbol{\nu}_{\mathrm{R}} \in\mathbb{R}^{2} is

aR,k(PR,k,νR)=[ejκνRTpR,k,1,…,ejκνRTpR,k,Nk]T∈CNk.(4)\mathbf{a}_{\mathrm{R},k}(\mathbf{P}_{\mathrm{R},k},\boldsymbol{\nu}_{\mathrm{R}}) = \left[ e^{\mathrm{j}\kappa\boldsymbol{\nu}_{\mathrm{R}}^{\mathsf{T}}\mathbf{p}_{\mathrm{R},k,1}}, \ldots, e^{\mathrm{j}\kappa\boldsymbol{\nu}_{\mathrm{R}}^{\mathsf{T}}\mathbf{p}_{\mathrm{R},k,N_k}} \right]^{\mathsf{T}} \in\mathbb{C}^{N_k}. \tag*{(4)}

Then, the transmit field-response matrix (FRM) associated with user kk is constructed by stacking the steering vectors of all departure paths as

Gk(PT)=[aT(PT,νT,k,1),…,aT(PT,νT,k,LT,k)]T∈CLT,k×M.(5)\mathbf{G}_k(\mathbf{P}_{\mathrm{T}}) = \left[ \mathbf{a}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}},\boldsymbol{\nu}_{\mathrm{T},k,1}),\ldots, \mathbf{a}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}},\boldsymbol{\nu}_{\mathrm{T},k,L_{\mathrm{T},k}}) \right]^{\mathsf{T}} \in\mathbb{C}^{L_{\mathrm{T},k} \times M}. \tag*{(5)}

Likewise, the receive FRM of user kk is given as

Fk(PR,k)=[aR,k(PR,k,νR,k,1),…,aR,k(PR,k,νR,k,LR,k)]T∈CLR,k×Nk.(6)\mathbf{F}_k(\mathbf{P}_{\mathrm{R},k}) = \left[ \mathbf{a}_{\mathrm{R},k}(\mathbf{P}_{\mathrm{R},k},\boldsymbol{\nu}_{\mathrm{R},k,1}),\ldots, \mathbf{a}_{\mathrm{R},k}(\mathbf{P}_{\mathrm{R},k},\boldsymbol{\nu}_{\mathrm{R},k,L_{\mathrm{R},k}}) \right]^{\mathsf{T}} \in\mathbb{C}^{L_{\mathrm{R},k} \times N_k}. \tag*{(6)}

Let Πk∈CLR,k×LT,k\mathbf{\Pi}_k \in\mathbb{C}^{L_{\mathrm{R},k} \times L_{\mathrm{T},k}} denote the path-response matrix of user kk, whose (q,ℓ)(q,\ell)-th entry characterizes the complex gain from departure path ℓ\ell to arrival path qq. The propagation channel between the BS and user kk is then given by

H~k(PT,PR,k)=Fk(PR,k)HΠkGk(PT)∈CNk×M.(7)\widetilde{\mathbf{H}}_k(\mathbf{P}_{\mathrm{T}},\mathbf{P}_{\mathrm{R},k}) = \mathbf{F}_k(\mathbf{P}_{\mathrm{R},k})^{\mathsf{H}} \mathbf{\Pi}_k \mathbf{G}_k(\mathbf{P}_{\mathrm{T}}) \in\mathbb{C}^{N_k \times M}. \tag*{(7)}

Circuit-Based Communication Model

In addition to modifying the propagation phases, antenna movement changes the MC among elements within each array. Due to these interactions, the current at one antenna port contributes to the voltages at other ports, so the antenna elements must be modeled jointly. To capture this behavior, we adopt a circuit-based model that represents each antenna array as a multiport network described by its port voltages and currents [13]. In this representation, the signal sources are connected to the transmit antenna ports through a matching network, and the source voltages produce currents at these ports. These currents generate electromagnetic waves that propagate through the environment and induce voltages at the receive antenna ports. The receive matching network then transforms these induced voltages into the output signals observed by the receivers.

Specifically, the interactions within the arrays can be characterized by the transmit MC matrix CT(PT)∈CM×M\mathbf{C}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}}) \in\mathbb{C}^{M \times M} and the receive MC matrix CR,k(PR,k)∈CNk×Nk\mathbf{C}_{\mathrm{R},k}(\mathbf{P}_{\mathrm{R},k}) \in\mathbb{C}^{N_k \times N_k}. These matrices represent the normalized mutual radiation resistance of the arrays, with off-diagonal entries describing the mutual interactions between distinct elements. Their entries are modeled as

[CT(PT)]m,n=cT(∥pT,m−pT,n∥2),(8)[\mathbf{C}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}})]_{m,n} = c_{\mathrm{T}}(\|\mathbf{p}_{\mathrm{T},m}-\mathbf{p}_{\mathrm{T},n}\|_2), \tag*{(8)}
[CR,k(PR,k)]m,n=cR,k(∥pR,k,m−pR,k,n∥2),(9)[\mathbf{C}_{\mathrm{R},k}(\mathbf{P}_{\mathrm{R},k})]_{m,n} = c_{\mathrm{R},k}(\|\mathbf{p}_{\mathrm{R},k,m}-\mathbf{p}_{\mathrm{R},k,n}\|_2), \tag*{(9)}

where cT(⋅)c_{\mathrm{T}}(\cdot) and cR,k(⋅)c_{\mathrm{R},k}(\cdot) are the coupling kernels that map the distance between two elements to the corresponding coupling coefficient. Their functional forms depend on the antenna type and radiation pattern. In this paper, we consider isotropic antenna elements1, for which the coupling kernels are given by [22]

cT(r)=cR,k(r)=sinc⁡(κr),sinc⁡(x)≜sin⁡xx.(10)c_{\mathrm{T}}(r)=c_{\mathrm{R},k}(r)=\operatorname{sinc}(\kappa r), \qquad \operatorname{sinc}(x)\triangleq\frac{\sin x}{x}. \tag*{(10)}

Given the above coupling kernel (10), the MC matrices CT(PT)\mathbf{C}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}}) and CR,k(PR,k)\mathbf{C}_{\mathrm{R},k}(\mathbf{P}_{\mathrm{R},k}) are real symmetric and positive definite whenever the antenna positions are pairwise distinct.

The above transmit MC matrix CT\mathbf{C}_{\mathrm{T}} describes the radiated power associated with a given antenna current vector through the normalized radiation resistance of the array. The antenna conductors also dissipate power through ohmic loss. With an identical normalized loss resistance ρT≥0\rho_{\mathrm{T}} \ge0 at each transmit element, the normalized total resistance matrix of the transmit array includes both contributions and is given by [22]

RT(PT)≜CT(PT)+ρTIM,ρT≥0.(11)\mathbf{R}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}}) \triangleq \mathbf{C}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}})+\rho_{\mathrm{T}}\mathbf{I}_M, \qquad\rho_{\mathrm{T}}\ge0. \tag*{(11)}

Here, ρT=0\rho_{\mathrm{T}}=0 corresponds to the absence of ohmic loss, and RT≻0\mathbf{R}_{\mathrm{T}}\succ0 for all ρT≥0\rho_{\mathrm{T}}\ge0. We omit the position arguments below for notational brevity.

Let sk∈Cdk\mathbf{s}_k\in\mathbb{C}^{d_k} denote the data symbol vector intended for user kk. We assume independent Gaussian data streams, with sk∼CN(0,Idk)\mathbf{s}_k\sim\mathcal{CN}(\mathbf{0},\mathbf{I}_{d_k}) and E[sksjH]=0\mathbb{E}[\mathbf{s}_k\mathbf{s}_j^{\mathrm{H}}]=0 for j≠kj\ne k. The BS applies the precoding matrix Wk∈CM×dk\mathbf{W}_k\in\mathbb{C}^{M\times d_k} to form the source signal as

x=∑j=1KWjsj.(12)\mathbf{x}=\sum_{j=1}^{K}\mathbf{W}_j\mathbf{s}_j. \tag*{(12)}

In the circuit model, this precoded transmit signal corresponds to the normalized baseband representation of the source voltages. The source signals are applied to the transmit array through a lossless matching network, which is assumed to maintain perfect power matching as the antenna positions change. Under the matching model and normalization adopted in [11], the normalized transmit antenna current is given by

iT=RT−1/2x.(13)\mathbf{i}_{\mathrm{T}}=\mathbf{R}_{\mathrm{T}}^{-1/2}\mathbf{x}. \tag*{(13)}

Therefore, the average power accepted by the transmit array is given as [13]

Pacc=E[iTHRTiT]=E[xHx]=∑k=1K∥Wk∥F2.(14)P_{\mathrm{acc}}=\mathbb{E}\left[\mathbf{i}_{\mathrm{T}}^{\mathrm{H}}\mathbf{R}_{\mathrm{T}}\mathbf{i}_{\mathrm{T}}\right]=\mathbb{E}\left[\mathbf{x}^{\mathrm{H}}\mathbf{x}\right]=\sum_{k=1}^{K}\lVert\mathbf{W}_k\rVert_{\mathrm{F}}^2. \tag*{(14)}

To describe propagation from the transmitter to the receivers, we adopt the unilateral approximation, which neglects the influence of the receive antenna currents on the transmitter [13]. This allows the transmit currents to be determined independently of the receive circuits. In the normalized coordinates, H~kiT\widetilde{\mathbf{H}}_k\mathbf{i}_{\mathrm{T}} represents the open-circuit voltages induced at the receive antennas, with constant scaling factors absorbed into (7).

At user kk, we assume that the receive matching network is lossless and maintain receive noise matching as the antenna positions change. Under the adopted circuit model and normalization, this network transforms the induced voltages by CR,k−1/2\mathbf{C}_{\mathrm{R},k}^{-1/2} [11]. Thus, the received signal at user kk is given as

yk=CR,k−1/2H~kiT+nk=CR,k−1/2H~kRT−1/2x+nk,(15)\begin{aligned} \mathbf{y}_k=\mathbf{C}_{\mathrm{R},k}^{-1/2}\widetilde{\mathbf{H}}_k\mathbf{i}_{\mathrm{T}}+\mathbf{n}_k \\ &=\mathbf{C}_{\mathrm{R},k}^{-1/2}\widetilde{\mathbf{H}}_k\mathbf{R}_{\mathrm{T}}^{-1/2}\mathbf{x}+\mathbf{n}_k, \tag*{(15)} \end{aligned}

where yk\mathbf{y}_k is the normalized baseband representation of the output voltages after receive matching and before digital combining, and nk\mathbf{n}_k denotes the additive noise in this observation. Based on (15), we define the corresponding effective channel as

H^k≜CR,k−1/2H~kRT−1/2.(16)\widehat{\mathbf{H}}_k\triangleq\mathbf{C}_{\mathrm{R},k}^{-1/2}\widetilde{\mathbf{H}}_k\mathbf{R}_{\mathrm{T}}^{-1/2}. \tag*{(16)}

To account for both background radiation and receiver hardware noise, we model the equivalent noise covariance referred to the receive ports before matching as

Rn,k=σbg,k2CR,k+σhw,k2INk,(17)\mathbf{R}_{n,k}=\sigma_{\mathrm{bg},k}^{2}\mathbf{C}_{\mathrm{R},k}+\sigma_{\mathrm{hw},k}^{2}\mathbf{I}_{N_k}, \tag*{(17)}

where the first term represents correlated noise from an isotropic background field. The second term models receiver hardware noise referred to the same ports, which we assume to be independent across ports. The transformation associated with receive matching acts on both the signal and this equivalent noise. Accordingly, the noise in (15) follows nk∼CN(0,R^n,k)\mathbf{n}_k\sim\mathcal{CN}(\mathbf{0},\widehat{\mathbf{R}}_{n,k}), with

R^n,k=CR,k−1/2Rn,kCR,k−1/2.(18)\widehat{\mathbf{R}}_{n,k}=\mathbf{C}_{\mathrm{R},k}^{-1/2}\mathbf{R}_{n,k}\mathbf{C}_{\mathrm{R},k}^{-1/2}. \tag*{(18)}

Then, the achievable rate of user kk is

Rk=log⁡det⁡(INk+H^kWkWkHH^kHΩ^k−1),(19)R_k=\log\det\left(\mathbf{I}_{N_k}+\widehat{\mathbf{H}}_k\mathbf{W}_k\mathbf{W}_k^{\mathrm{H}}\widehat{\mathbf{H}}_k^{\mathrm{H}}\widehat{\mathbf{\Omega}}_k^{-1}\right), \tag*{(19)}

where Ω^k\widehat{\mathbf{\Omega}}_k is the covariance of interference and noise, given by

Ω^k=∑j≠kH^kWjWjHH^kH+R^n,k.(20)\widehat{\mathbf{\Omega}}_k=\sum_{j\ne k}\widehat{\mathbf{H}}_k\mathbf{W}_j\mathbf{W}_j^{\mathrm{H}}\widehat{\mathbf{H}}_k^{\mathrm{H}}+\widehat{\mathbf{R}}_{n,k}. \tag*{(20)}

Problem Formulation

In this paper, our goal is to maximize the WSR. Since the transmit and receive antenna positions jointly determine the propagation channels and array coupling, which in turn affect the effective channels and receive noise under the accepted-power constraint. Therefore, we need to jointly optimize the multi-stream precoders and antenna positions, leading to the following problem

max⁡{Wk},PT,{PR,k}∑k=1KαkRk(21)\begin{aligned} \max_{\{\mathbf{W}_k\},\mathbf{P}_{\mathrm{T}},\{\mathbf{P}_{\mathrm{R},k}\}} \quad& \sum_{k=1}^{K} \alpha_k R_k \tag*{(21)} \end{aligned}
s.t.∑k=1K∥Wk∥F2≤Pmax⁡,(22)\begin{aligned} \text{s.t.}\quad& \sum_{k=1}^{K} \lVert\mathbf{W}_k \rVert_{\mathrm{F}}^2 \le P_{\max}, \tag*{(22)} \end{aligned}
pT,m∈AT,m=1,…,M,(23)\mathbf{p}_{\mathrm{T},m} \in\mathcal{A}_{\mathrm{T}},\quad m=1,\ldots,M, \tag*{(23)}
∥pT,m−pT,n∥2≥dTmin⁡,1≤m<n≤M,(24)\lVert\mathbf{p}_{\mathrm{T},m}-\mathbf{p}_{\mathrm{T},n}\rVert^2 \ge d_{\mathrm{T}}^{\min},\quad1\le m<n\le M, \tag*{(24)}
pR,k,n∈AR,k,n=1,…,Nk,∀k,(25)\mathbf{p}_{\mathrm{R},k,n}\in\mathcal{A}_{\mathrm{R},k},\quad n=1,\ldots,N_k,\quad\forall k, \tag*{(25)}
∥pR,k,m−pR,k,n∥2≥dR,kmin⁡,1≤m<n≤Nk,∀k.(26)\lVert\mathbf{p}_{\mathrm{R},k,m}-\mathbf{p}_{\mathrm{R},k,n}\rVert^2 \ge d_{\mathrm{R},k}^{\min},\quad1\le m<n\le N_k,\quad\forall k. \tag*{(26)}

Here, αk≥0\alpha_k \ge0 in (21) denotes the priority weight of user kk, and Pmax⁡P_{\max} in (22) is the maximum power budget at the BS. Constraints (23) and (25) restrict the transmit and receive antenna positions to their prescribed movement regions AT\mathcal{A}_{\mathrm{T}} and AR,k\mathcal{A}_{\mathrm{R},k}, respectively. The parameters dTmin⁡>0d_{\mathrm{T}}^{\min}>0 and dR,kmin⁡>0d_{\mathrm{R},k}^{\min}>0 denote the minimum antenna spacings at the BS and user kk, respectively. Existing studies often impose a minimum spacing of half a wavelength to mitigate MC and neglect its effects in the communication model. In this work, however, MC is explicitly included in the model and its effects are accounted for in the WSR optimization. Therefore, the minimum antenna spacings can be smaller than half a wavelength, provided that physical collisions are avoided. Constraints (24) and (26) enforce these spacing requirements, with the minimum distances determined by the antenna dimensions and mechanical constraints.

Problem (21) is quite challenging to solve because the precoding matrices and antenna positions are coupled in the non-concave WSR objective through both the desired signals and multiuser interference. Moreover, antenna movement changes not only the propagation channels but also the MC matrices, affecting both the effective channels and the receive noise covariances. In particular, the effective channels involve matrix inverse square roots that depend on the antenna positions, which complicates the derivatives required for position optimization. These difficulties motivate the reformulation and alternating optimization framework developed in the next section.

The Proposed Current-Domain WMMSE with Majorization–Minimization Framework

To address the challenges in solving the WSR maximization problem (21), we develop a current-domain WMMSE framework with majorization–minimization (CD-WMMSE-MM). We first reformulate the problem in the current domain and establish an equivalent WMMSE formulation, which provides the basis for alternating optimization of the precoders and antenna positions. For fixed antenna positions, we derive the current-domain precoder update. For the transmit and receive antenna positions, we construct convex subproblems using majorization–minimization and solve them using ADMM.

Problem Reformulation

Directly solving (21) is challenging because the effective channels involve matrix inverse square roots of the coupling matrices, which vary with the antenna positions. To facilitate optimization, we reformulate the problem in the current domain by introducing the current-domain precoding matrix and equivalent receive port observation as

Jk≜RT−1/2Wk∈CM×dk,(27)\mathbf{J}_k \triangleq\mathbf{R}_{\mathrm{T}}^{-1/2}\mathbf{W}_k \in\mathbb{C}^{M\times d_k}, \tag*{(27)}
zk≜CR,k1/2yk∈CNk.(28)\mathbf{z}_k \triangleq\mathbf{C}_{\mathrm{R},k}^{1/2}\mathbf{y}_k \in\mathbb{C}^{N_k}. \tag*{(28)}

The matrix Jk\mathbf{J}_k maps the data streams to the normalized transmit antenna currents, while zk\mathbf{z}_k expresses the receive observation in the coordinates before matching. Since RT\mathbf{R}_{\mathrm{T}} and CR,k\mathbf{C}_{\mathrm{R},k} are positive definite, both transformations are invertible. Then, substituting (27) and (28) into (15), we obtain

zk=Hk∑j=1KJjsj+nˉk,(29)\mathbf{z}_k=\mathbf{H}_k\sum_{j=1}^{K}\mathbf{J}_j\mathbf{s}_j+\bar{\mathbf{n}}_k, \tag*{(29)}

where Hk≜H~k(PT,PR,k)\mathbf{H}_k \triangleq\widetilde{\mathbf{H}}_k(\mathbf{P}_{\mathrm{T}},\mathbf{P}_{\mathrm{R},k}) and

nˉk≜CR,k1/2nk∼CN(0,Rn,k).(30)\bar{\mathbf{n}}_k \triangleq\mathbf{C}_{\mathrm{R},k}^{1/2}\mathbf{n}_k \sim\mathcal{CN}(\mathbf{0},\mathbf{R}_{\mathrm{n},k}). \tag*{(30)}

Thus, the achievable rate of user kk in the current domain can be expressed as

Rk=log⁡det⁡(INk+HkJkJkHHkHΩk−1),(31)R_k=\log\det\left(\mathbf{I}_{N_k}+\mathbf{H}_k\mathbf{J}_k\mathbf{J}_k^{\mathrm{H}}\mathbf{H}_k^{\mathrm{H}}\mathbf{\Omega}_k^{-1}\right), \tag*{(31)}

where Ωk\mathbf{\Omega}_k is the interference-plus-noise covariance matrix in the current domain, given by

Ωk≜∑j≠kHkJjJjHHkH+Rn,k.(32)\mathbf{\Omega}_k \triangleq\sum_{j\ne k}\mathbf{H}_k\mathbf{J}_j\mathbf{J}_j^{\mathrm{H}}\mathbf{H}_k^{\mathrm{H}}+\mathbf{R}_{\mathrm{n},k}. \tag*{(32)}

Moreover, the accepted transmit power in (14) becomes

Pacc=∑k=1KTr⁡(JkHRTJk).(33)P_{\mathrm{acc}}=\sum_{k=1}^{K}\operatorname{Tr}\left(\mathbf{J}_k^{\mathrm{H}}\mathbf{R}_{\mathrm{T}}\mathbf{J}_k\right). \tag*{(33)}

Although the above current-domain reformulation simplifies the treatment of MC matrices, directly optimizing the WSR remains difficult because the precoders and antenna positions are still coupled within the non-concave log-determinant rate expressions. We therefore use the standard WMMSE identity [29, 30, 31] to replace these expressions with an equivalent formulation in terms of weighted MSEs. Introducing auxiliary receive matrices Uk∈CNk×dk\mathbf{U}_k\in\mathbb{C}^{N_k\times d_k} and positive definite weight matrices Vk∈Cdk×dk\mathbf{V}_k\in\mathbb{C}^{d_k\times d_k}, we obtain

Rk=max⁡Uk,Vk≻0[log⁡det⁡Vk−Tr⁡(VkEk)+dk],(34)R_k=\max_{\mathbf{U}_k,\mathbf{V}_k\succ0}\left[\log\det\mathbf{V}_k-\operatorname{Tr}(\mathbf{V}_k\mathbf{E}_k)+d_k\right], \tag*{(34)}

where Ek\mathbf{E}_k is the MSE matrix of the estimate s^k=UkHzk\hat{\mathbf{s}}_k=\mathbf{U}_k^{\mathrm{H}}\mathbf{z}_k, given by

Ek=UkH(HkSHkH+Rn,k)Uk−UkHHkJk−JkHHkHUk+Idk,(35)\mathbf{E}_k=\mathbf{U}_k^{\mathrm{H}}\left(\mathbf{H}_k\mathbf{S}\mathbf{H}_k^{\mathrm{H}}+\mathbf{R}_{\mathrm{n},k}\right)\mathbf{U}_k-\mathbf{U}_k^{\mathrm{H}}\mathbf{H}_k\mathbf{J}_k-\mathbf{J}_k^{\mathrm{H}}\mathbf{H}_k^{\mathrm{H}}\mathbf{U}_k+\mathbf{I}_{d_k}, \tag*{(35)}

with the aggregate transmit current covariance defined as

S≜∑j=1KJjJjH.(36)\mathbf{S}\triangleq\sum_{j=1}^{K}\mathbf{J}_j\mathbf{J}_j^{\mathrm{H}}. \tag*{(36)}

Summing (34) with weights αk\alpha_k, we can obtain the weighted MSE objective as

Ψ≜∑k=1Kαk[Tr⁡(VkEk)−log⁡det⁡(Vk)−dk].(37)\Psi\triangleq\sum_{k=1}^{K}\alpha_k\left[\operatorname{Tr}(\mathbf{V}_k\mathbf{E}_k)-\log\det(\mathbf{V}_k)-d_k\right]. \tag*{(37)}

For any fixed precoders and antenna positions, optimizing the auxiliary variables in (34) yields

min⁡{Uk,Vk≻0}Ψ=−∑k=1KαkRk.(38)\min_{\{U_k,V_k\succ0\}} \Psi=-\sum_{k=1}^{K}\alpha_k R_k. \tag*{(38)}

Therefore, problem (21) can be equivalently reformulated as the following joint WMMSE minimization problem:

min⁡{Jk,Uk,Vk},PT,{PR,k}Ψ(39)\min_{\{J_k,U_k,V_k\},\atop P_{\mathrm{T}},\{P_{\mathrm{R},k}\}} \Psi \tag*{(39)}
s.t.Pacc≤Pmax⁡,(40)\mathrm{s.t.}\quad P_{\mathrm{acc}}\le P_{\max}, \tag*{(40)}
(21c)−(21f),(41)(21c)-(21f), \tag*{(41)}
Vk≻0,k=1,…,K.(42)V_k\succ0,\quad k=1,\ldots,K. \tag*{(42)}

In the following, we develop an alternating optimization algorithm to solve problem (34). For fixed antenna positions, the receiver, auxiliary weight, and precoder blocks can be updated using standard WMMSE steps, as detailed in Section III-B. With these matrices fixed, we next perform one MM step for the transmit antenna positions while holding the receive positions fixed, as detailed in Section III-C. We then perform one MM step for each user’s receive antenna positions using the latest transmit positions, as detailed in Section III-D. The receive-position subproblems are independent across users and can be solved in parallel. These position steps complete one iteration of the alternating algorithm.

Current-Domain Precoder Update

In this step, we update {Jk,Uk,Vk}\{J_k,U_k,V_k\} for fixed antenna positions PTP_{\mathrm{T}} and {PR,k}\{P_{\mathrm{R},k}\}. First, we minimize the WMMSE objective in (37) with respect to the receive matrices UkU_k and MSE weights VkV_k. For each user kk, the receive matrix subproblem is convex quadratic for fixed VkV_k, while the MSE weight matrix subproblem minimizes Tr⁡(VkEk)−log⁡det⁡Vk\operatorname{Tr}(V_kE_k)-\log\det V_k over Vk≻0V_k\succ0 for fixed UkU_k. Their first-order optimality condition yields the closed-form updates with given Jˉk\bar{J}_k2 as

Uk⋆=(HkSˉHkH+Rn,k)−1HkJˉk,(43)U_k^\star=(H_k\bar{S}H_k^{\mathrm{H}}+R_{n,k})^{-1}H_k\bar{J}_k, \tag*{(43)}
Vk⋆=(Ek⋆)−1,(44)V_k^\star=(E_k^\star)^{-1}, \tag*{(44)}

where Sˉ≜∑j=1KJˉjJˉjH\bar{S}\triangleq\sum_{j=1}^{K}\bar{J}_j\bar{J}_j^{\mathrm{H}}, and Ek⋆E_k^\star is (35) evaluated at Uk⋆U_k^\star and {Jˉj}\{\bar{J}_j\}. With Uk=Uk⋆U_k=U_k^\star, Vk=Vk⋆V_k=V_k^\star, we define

A≜∑k=1KαkHkHUˉkVˉkUˉkHHk⪰0,(45)A\triangleq\sum_{k=1}^{K}\alpha_k H_k^{\mathrm{H}}\bar{U}_k\bar{V}_k\bar{U}_k^{\mathrm{H}}H_k\succeq0, \tag*{(45)}
Bk≜αkHkHUˉkVˉk∈CM×dk.(46)B_k\triangleq\alpha_kH_k^{\mathrm{H}}\bar{U}_k\bar{V}_k\in\mathbb{C}^{M\times d_k}. \tag*{(46)}

Then, the current-domain precoder block becomes

min⁡{Jk}∑k=1K[Tr⁡(JkHAJk)−2Re⁡Tr⁡(BkHJk)](47)\min_{\{J_k\}}\sum_{k=1}^{K}\left[\operatorname{Tr}(J_k^{\mathrm{H}}AJ_k)-2\operatorname{Re}\operatorname{Tr}(B_k^{\mathrm{H}}J_k)\right] \tag*{(47)}
s.t.∑k=1KTr⁡(JkHRTJk)≤Pmax⁡.(48)\mathrm{s.t.}\quad\sum_{k=1}^{K}\operatorname{Tr}(J_k^{\mathrm{H}}R_{\mathrm{T}}J_k)\le P_{\max}. \tag*{(48)}

Obviously, problem (39) is convex and satisfies Slater’s condition for Pmax⁡>0P_{\max}>0, we can obtain its optimal solutions by solving the KKT conditions. Specifically, we introduce the Lagrange multiplier λ≥0\lambda\ge0 for the constraint (40), and then obtain the stationarity condition as

(A+λRT)Jk=Bk.(49)(A+\lambda R_{\mathrm{T}})J_k=B_k. \tag*{(49)}

Since RT≻0R_{\mathrm{T}}\succ0, premultiplying (49) by RT−1/2R_{\mathrm{T}}^{-1/2} and collecting factors gives

[RT−1/2ART−1/2+λIM]RT1/2Jk=RT−1/2Bk.(50)\left[R_{\mathrm{T}}^{-1/2}AR_{\mathrm{T}}^{-1/2}+\lambda I_M\right]R_{\mathrm{T}}^{1/2}J_k=R_{\mathrm{T}}^{-1/2}B_k. \tag*{(50)}

Then, according to (50), we can obtain the current-domain precoder update as

Jk(λ)=RT−1/2[RT−1/2ART−1/2+λIM]†RT−1/2Bk,(51)J_k(\lambda)=R_{\mathrm{T}}^{-1/2}\left[R_{\mathrm{T}}^{-1/2}AR_{\mathrm{T}}^{-1/2}+\lambda I_M\right]^\dagger R_{\mathrm{T}}^{-1/2}B_k, \tag*{(51)}

where (⋅)†(\cdot)^\dagger denotes the Moore–Penrose pseudoinverse. To determine λ\lambda, let the accepted transmit power associated with this update be

P(λ)≜∑k=1KTr⁡(Jk(λ)HRTJk(λ)).(52)P(\lambda)\triangleq\sum_{k=1}^{K}\operatorname{Tr}(J_k(\lambda)^{\mathrm{H}}R_{\mathrm{T}}J_k(\lambda)). \tag*{(52)}

Based on the primal feasibility and complementary slackness conditions, the optimal multiplier λ⋆\lambda^\star is the smallest nonnegative value satisfying the power constraint (48), i.e.,

λ⋆=min⁡{λ≥0:P(λ)≤Pmax⁡}.(53)\lambda^\star=\min\{\lambda\ge0:P(\lambda)\le P_{\max}\}. \tag*{(53)}

Since P(λ)P(\lambda) is nonincreasing in λ≥0\lambda\ge0, we can determine λ⋆\lambda^\star by bisection search. However, each bisection iteration evaluates (51) at a different trial multiplier. A direct implementation therefore requires repeatedly factorizing the multiplier-dependent matrix in this expression. To avoid these repeated factorizations, we use the Cholesky factorization of RTR_{\mathrm{T}} as

RT=LTLTH,(54)R_{\mathrm{T}}=L_{\mathrm{T}}L_{\mathrm{T}}^{\mathrm{H}}, \tag*{(54)}

and then compute the eigendecomposition as

LT−1ALT−H=Qdiag⁡(a1,…,aM)QH.(55)L_{\mathrm{T}}^{-1}AL_{\mathrm{T}}^{-\mathrm{H}}=Q\operatorname{diag}(a_1,\ldots,a_M)Q^{\mathrm{H}}. \tag*{(55)}

Concatenate B≜[B1,…,BK]∈CM×DB\triangleq[B_1,\ldots,B_K]\in\mathbb{C}^{M\times D}, where D≜∑kdkD\triangleq\sum_k d_k, and define

B~≜QHLT−1B.(56)\widetilde{B}\triangleq Q^{\mathrm{H}}L_{\mathrm{T}}^{-1}B. \tag*{(56)}

Using these factors, the concatenated current-domain precoder can be expressed equivalently for λ≥0\lambda\ge0 as

J(λ)=LT−HQ[diag⁡(a1,…,aM)+λIM]†B~,(57)J(\lambda)=L_{\mathrm{T}}^{-\mathrm{H}}Q\left[\operatorname{diag}(a_1,\ldots,a_M)+\lambda I_M\right]^\dagger\widetilde{B}, \tag*{(57)}

and the accepted transmit power in (52) becomes

P(λ)=∑m=1M∑ℓ=1D∣[B~]m,ℓ∣2(am+λ)2.(58)P(\lambda)=\sum_{m=1}^{M}\sum_{\ell=1}^{D}\frac{\lvert[\widetilde{B}]_{m,\ell}\rvert^2}{(a_m+\lambda)^2}. \tag*{(58)}

Here, terms with am=λ=0a_m=\lambda=0 are interpreted as zero. With this eigendecomposition, each bisection trial requires only evaluating the scalar power expression (58), avoiding the direct evaluation of the precoder update (51) and thereby reducing the computational cost.

Transmit Antenna Position Update

In this step, we update PTP_{\mathrm{T}} while holding the receive antenna positions {PR,k}\{P_{\mathrm{R},k}\} and the matrices {Jˉk,Uˉk,Vˉk}\{\bar{J}_k,\bar{U}_k,\bar{V}_k\} fixed. Thus, Hk=H~k(PT,PR,k)H_k=\widetilde{H}_k(P_{\mathrm{T}},P_{\mathrm{R},k}), whereas the receive noise covariances remain constant. The fixed current covariance is S‾=∑jJjJjH\overline{\mathbf{S}}=\sum_j\mathbf{J}_j\mathbf{J}_j^{\mathrm{H}}. For notation brevity, we define

Akg≜αkU‾kV‾kV‾kHU‾kH⪰0,(59)\mathbf{A}_k^{\mathrm{g}} \triangleq\alpha_k\overline{\mathbf{U}}_k\overline{\mathbf{V}}_k\overline{\mathbf{V}}_k^{\mathrm{H}}\overline{\mathbf{U}}_k^{\mathrm{H}}\succeq0, \tag*{(59)}
Zk≜αkU‾kV‾kJkH∈CNk×M.(60)\mathbf{Z}_k \triangleq\alpha_k\overline{\mathbf{U}}_k\overline{\mathbf{V}}_k\mathbf{J}_k^{\mathrm{H}}\in\mathbb{C}^{N_k\times M}. \tag*{(60)}

Substituting (35) into (37) and omitting terms independent of both transmit and receive antenna positions, we obtain

F=∑k=1K[Tr⁡(AkgHkS‾HkH)−2Re⁡Tr⁡(ZkHHk)+Tr⁡(AkgRn,k)].(61)\mathcal{F}=\sum_{k=1}^{K}\left[\operatorname{Tr}\left(\mathbf{A}_k^{\mathrm{g}}\mathbf{H}_k\overline{\mathbf{S}}\mathbf{H}_k^{\mathrm{H}}\right)-2\operatorname{Re}\operatorname{Tr}\left(\mathbf{Z}_k^{\mathrm{H}}\mathbf{H}_k\right)+\operatorname{Tr}\left(\mathbf{A}_k^{\mathrm{g}}\mathbf{R}_{n,k}\right)\right]. \tag*{(61)}

The accepted transmit power in (33) is

PT(PT)=Tr⁡(CTS‾)+ρTTr⁡(S‾).(62)\mathcal{P}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}})=\operatorname{Tr}(\mathbf{C}_{\mathrm{T}}\overline{\mathbf{S}})+\rho_{\mathrm{T}}\operatorname{Tr}(\overline{\mathbf{S}}). \tag*{(62)}

The transmit antenna position subproblem of (34) is therefore

min⁡PT Fs.t.PT(PT)≤Pmax⁡, xref‘(21c)‘, xref‘(21d)‘.(63)\min_{\mathbf{P}_{\mathrm{T}}}\ \mathcal{F}\quad\text{s.t.}\quad\mathcal{P}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}})\leq P_{\max},\ {xref}`(21c)`,\ {xref}`(21d)`. \tag*{(63)}

Problem (63) is hard to solve because of its nonconvex objective and constraints. To address this difficulty, we combine an MM upper bound of the objective [32], [33] with convex inner approximations of these constraints. At each update, we minimize the objective upper bound over an inner feasible set containing the current antenna positions.

Let pT≜vec⁡(PT)∈R2M\mathbf{p}_{\mathrm{T}}\triangleq\operatorname{vec}(\mathbf{P}_{\mathrm{T}})\in\mathbb{R}^{2M} stack the candidate transmit antenna positions, and let p‾T=vec⁡(P‾T)\overline{\mathbf{p}}_{\mathrm{T}}=\operatorname{vec}(\overline{\mathbf{P}}_{\mathrm{T}}) contain their positions before the MM step. Using p‾T\overline{\mathbf{p}}_{\mathrm{T}} as the expansion point, we define the displacement δT≜pT−p‾T∈R2M\boldsymbol{\delta}_{\mathrm{T}}\triangleq\mathbf{p}_{\mathrm{T}}-\overline{\mathbf{p}}_{\mathrm{T}}\in\mathbb{R}^{2M}, so that the current positions correspond to δT=0\boldsymbol{\delta}_{\mathrm{T}}=0. Since p‾T\overline{\mathbf{p}}_{\mathrm{T}} is fixed during the update, optimizing δT\boldsymbol{\delta}_{\mathrm{T}} is equivalent to optimizing pT\mathbf{p}_{\mathrm{T}}. Once the MM step yields a displacement δT⋆\boldsymbol{\delta}_{\mathrm{T}}^{\star}, we recover the updated positions as pT⋆=p‾T+δT⋆\mathbf{p}_{\mathrm{T}}^{\star}=\overline{\mathbf{p}}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}}^{\star}.

To obtain a convex surrogate objective, we construct a quadratic upper bound in δT\boldsymbol{\delta}_{\mathrm{T}}. For a twice continuously differentiable scalar function ff, if M⪰0\mathbf{M}\succeq0 upper bounds its Hessian along each candidate segment from p‾T\overline{\mathbf{p}}_{\mathrm{T}} to p‾T+δT\overline{\mathbf{p}}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}}, Taylor’s theorem gives

f(p‾T+δT)≤f^(δT)≜f(p‾T)+∇f(p‾T)TδT+12δTTMδT.(64)f(\overline{\mathbf{p}}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}})\leq\widehat{f}(\boldsymbol{\delta}_{\mathrm{T}})\triangleq f(\overline{\mathbf{p}}_{\mathrm{T}})+\nabla f(\overline{\mathbf{p}}_{\mathrm{T}})^{\mathrm{T}}\boldsymbol{\delta}_{\mathrm{T}}+\frac{1}{2}\boldsymbol{\delta}_{\mathrm{T}}^{\mathrm{T}}\mathbf{M}\boldsymbol{\delta}_{\mathrm{T}}. \tag*{(64)}

Following (64), we first compute the gradient of F\mathcal{F} at p‾T\overline{\mathbf{p}}_{\mathrm{T}} and then construct a Hessian upper bound over the candidate update region.

Objective Gradient and MM Upper Bound

The transmit positions affect F\mathcal{F} in (61) through the channel matrices {Hk}\{\mathbf{H}_k\}. We first express the differential of F\mathcal{F} with respect to the channel matrices as

dF=2Re⁡∑k=1KTr⁡[(AkgHkS‾−Zk)HdHk].(65)\mathrm{d}\mathcal{F}=2\operatorname{Re}\sum_{k=1}^{K}\operatorname{Tr}\left[\left(\mathbf{A}_k^{\mathrm{g}}\mathbf{H}_k\overline{\mathbf{S}}-\mathbf{Z}_k\right)^{\mathrm{H}}\mathrm{d}\mathbf{H}_k\right]. \tag*{(65)}

For brevity, define the coefficient of the channel variation as

Δk≜AkgHkS‾−Zk.(66)\boldsymbol{\Delta}_k\triangleq\mathbf{A}_k^{\mathrm{g}}\mathbf{H}_k\overline{\mathbf{S}}-\mathbf{Z}_k. \tag*{(66)}

To compute the gradient of F\mathcal{F} with respect to the transmit positions, we next compute the partial derivatives of the channel matrices with respect to the antenna coordinates. Moving transmit antenna mm affects only the mm-th column of Hk\mathbf{H}_k. For its aa-coordinate, where a∈{x,y}a\in\{x,y\}, this partial derivative is

ck,m,a≜∂(Hkem)∂[pT,m]a=jκFkHΠkDT,k,agk,m,(67)\mathbf{c}_{k,m,a}\triangleq\frac{\partial(\mathbf{H}_k\mathbf{e}_m)}{\partial[\mathbf{p}_{\mathrm{T},m}]_a}=\mathrm{j}\kappa\mathbf{F}_k^{\mathrm{H}}\mathbf{\Pi}_k\mathbf{D}_{\mathrm{T},k,a}\mathbf{g}_{k,m}, \tag*{(67)}

where em\mathbf{e}_m is the mm-th basis vector, gk,m=Gkem\mathbf{g}_{k,m}=\mathbf{G}_k\mathbf{e}_m, and DT,k,a\mathbf{D}_{\mathrm{T},k,a} is diagonal with entries [νT,k,ℓ]a[\boldsymbol{\nu}_{\mathrm{T},k,\ell}]_a. Combining this channel derivative with the differential of F\mathcal{F} gives the aa-th entry of the channel gradient block

[gT,mch]a=2Re⁡∑k(Δkem)Hck,m,a.(68)[\mathbf{g}_{\mathrm{T},m}^{\mathrm{ch}}]_a=2\operatorname{Re}\sum_k(\boldsymbol{\Delta}_k\mathbf{e}_m)^{\mathrm{H}}\mathbf{c}_{k,m,a}. \tag*{(68)}

Then, evaluating the gradient blocks in (68) at p‾T\overline{\mathbf{p}}_{\mathrm{T}} and stacking them in antenna order gives the objective gradient as

g‾T≜∇pTF∣pT=p‾T=[(gT,1ch)T,…,(gT,Mch)T]T∣pT=p‾T.(69)\overline{\mathbf{g}}_{\mathrm{T}}\triangleq\nabla_{\mathbf{p}_{\mathrm{T}}}\mathcal{F}\big|_{\mathbf{p}_{\mathrm{T}}=\overline{\mathbf{p}}_{\mathrm{T}}} =\left[\left(\mathbf{g}_{\mathrm{T},1}^{\mathrm{ch}}\right)^{\mathrm{T}},\ldots,\left(\mathbf{g}_{\mathrm{T},M}^{\mathrm{ch}}\right)^{\mathrm{T}}\right]^{\mathrm{T}}\bigg|_{\mathbf{p}_{\mathrm{T}}=\overline{\mathbf{p}}_{\mathrm{T}}}. \tag*{(69)}

Next, we construct a Hessian upper bound. We first rewrite the channel-dependent part of (61) in terms of Gk\mathbf{G}_k as

FTch=∑k=1K[Tr⁡(ΞT,kGkS‾GkH)−2Re⁡Tr⁡(TT,kHGk)],(70)\mathcal{F}_{\mathrm{T}}^{\mathrm{ch}}=\sum_{k=1}^{K}\left[\operatorname{Tr}\left(\mathbf{\Xi}_{\mathrm{T},k}\mathbf{G}_k\overline{\mathbf{S}}\mathbf{G}_k^{\mathrm{H}}\right)-2\operatorname{Re}\operatorname{Tr}\left(\mathbf{T}_{\mathrm{T},k}^{\mathrm{H}}\mathbf{G}_k\right)\right], \tag*{(70)}

where ΞT,k≜ΠkFkAkgFkHΠk\mathbf{\Xi}_{\mathrm{T},k}\triangleq\mathbf{\Pi}_k\mathbf{F}_k\mathbf{A}_k^{\mathrm{g}}\mathbf{F}_k^{\mathrm{H}}\mathbf{\Pi}_k and TT,k≜ΠkFkZk\mathbf{T}_{\mathrm{T},k}\triangleq\mathbf{\Pi}_k\mathbf{F}_k\mathbf{Z}_k. Since each entry of Gk\mathbf{G}_k is a complex exponential of a linear position phase, (70) has the real harmonic representation

FTch(pT)=c0+∑q∈HRe⁡{χqejaqTpT},(71)\mathcal{F}_{\mathrm{T}}^{\mathrm{ch}}(\mathbf{p}_{\mathrm{T}})=c_0+\sum_{q\in\mathcal{H}}\operatorname{Re}\left\{\chi_q\mathrm{e}^{\mathrm{j}\mathbf{a}_q^{\mathrm{T}}\mathbf{p}_{\mathrm{T}}}\right\}, \tag*{(71)}

where H\mathcal{H} indexes the individual nonzero position-dependent terms obtained by expanding (70) and c0c_0 is the sum of constant terms independent of pT\mathbf{p}_{\mathrm{T}}. For each term q∈Hq\in\mathcal{H}, χq\chi_q and aq\mathbf{a}_q denote its complex coefficient and phase vector, respectively. For a term arising from the quadratic part, the corresponding coefficient and phase vector are

χq=[ΞT,k]r,ℓ[S‾]m,n,(72)\chi_q=[\mathbf{\Xi}_{\mathrm{T},k}]_{r,\ell}[\overline{\mathbf{S}}]_{m,n}, \tag*{(72)}
aq=κ(em⊗νT,k,ℓ−en⊗νT,k,r),(73)\mathbf{a}_q=\kappa(\mathbf{e}_m\otimes\boldsymbol{\nu}_{\mathrm{T},k,\ell}-\mathbf{e}_n\otimes\boldsymbol{\nu}_{\mathrm{T},k,r}), \tag*{(73)}

respectively, and for a term arising from the linear part, the corresponding coefficient and phase vector are

χq=−2[TT,k]ℓ,m,aq=κem⊗νT,k,ℓ,(74)\chi_q=-2[\mathbf{T}_{\mathrm{T},k}]_{\ell,m},\qquad\mathbf{a}_q=\kappa\mathbf{e}_m\otimes\boldsymbol{\nu}_{\mathrm{T},k,\ell}, \tag*{(74)}

respectively. For each harmonic hq(pT)≜∣χq∣cos⁡(aqTpT+arg⁡χq)h_q(\mathbf{p}_{\mathrm{T}})\triangleq|\chi_q|\cos(\mathbf{a}_q^{\mathrm{T}}\mathbf{p}_{\mathrm{T}}+\arg\chi_q), the Hessian is

∇2hq(pT)=−∣χq∣cos⁡(aqTpT+arg⁡χq)aqaqT.(75)\nabla^2h_q(\mathbf{p}_{\mathrm{T}})=-|\chi_q|\cos(\mathbf{a}_q^{\mathrm{T}}\mathbf{p}_{\mathrm{T}}+\arg\chi_q)\mathbf{a}_q\mathbf{a}_q^{\mathrm{T}}. \tag*{(75)}

The position dependence of this Hessian lies in the scalar cosine term. We bound that term over the phases allowed by the aperture constraints, assuming compact convex apertures. Partition aq\mathbf{a}_q into 2×12\times1 blocks {aq,m}\{\mathbf{a}_{q,m}\} corresponding to the antenna positions, and define

θq−≜arg⁡(χq)+∑m=1Mmin⁡x∈ATaq,mTx,(76)\theta_q^{-}\triangleq\arg(\chi_q)+\sum_{m=1}^{M}\min_{\mathbf{x}\in\mathcal{A}_{\mathrm{T}}}\mathbf{a}_{q,m}^{\mathrm{T}}\mathbf{x}, \tag*{(76)}
θq+≜arg⁡(χq)+∑m=1Mmax⁡x∈ATaq,mTx.\theta_q^{+}\triangleq\arg(\chi_q)+\sum_{m=1}^{M}\max_{\mathbf{x}\in\mathcal{A}_{\mathrm{T}}}\mathbf{a}_{q,m}^{\mathrm{T}}\mathbf{x}.

Then, the phases over the aperture are contained in

Θ‾q≜[θq−,θq+].(77)\overline{\Theta}_q\triangleq[\theta_q^{-},\theta_q^{+}]. \tag*{(77)}

The maximum of −∣χq∣cos⁡θ-|\chi_q|\cos\theta over this interval therefore bounds the scalar in (75). Since aqaqT⪰0\mathbf{a}_q\mathbf{a}_q^{\mathrm{T}}\succeq0, a nonnegative upper bound on this scalar gives a positive semidefinite upper bound on the harmonic’s Hessian. The following proposition sums these bounds and gives the resulting MM upper bound.

Proposition 1. For FTch\mathcal{F}_{\mathrm{T}}^{\mathrm{ch}} in (71), let μ‾q≜max⁡θ∈Θq{0,−∣χq∣cos⁡θ}\overline{\mu}_{q} \triangleq\max_{\theta\in\Theta_{q}}\{0,-|\chi_{q}|\cos\theta\} and M‾ph≜∑q∈Hμ‾qaqaqT\overline{\mathbf{M}}_{\mathrm{ph}} \triangleq\sum_{q \in\mathcal{H}} \overline{\mu}_{q}\mathbf{a}_{q}\mathbf{a}_{q}^{\mathrm{T}}. Then, for every pT∈ATM\mathbf{p}_{\mathrm{T}} \in\mathcal{A}_{\mathrm{T}}^{M}, the Hessian satisfies

∇pT2FTch(pT)⪯M‾ph.(78)\nabla_{\mathbf{p}_{\mathrm{T}}}^{2}\mathcal{F}_{\mathrm{T}}^{\mathrm{ch}}(\mathbf{p}_{\mathrm{T}}) \preceq\overline{\mathbf{M}}_{\mathrm{ph}}. \tag*{(78)}

Consequently, for every δT\boldsymbol{\delta}_{\mathrm{T}} such that pT+δT∈ATM\mathbf{p}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}} \in\mathcal{A}_{\mathrm{T}}^{M}, we have

FTch(pT+δT)≤FTch(pT)+∇FTch(pT)TδT+12δTTM‾phδT.(79)\mathcal{F}_{\mathrm{T}}^{\mathrm{ch}}(\mathbf{p}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}}) \leq\mathcal{F}_{\mathrm{T}}^{\mathrm{ch}}(\mathbf{p}_{\mathrm{T}})+\nabla\mathcal{F}_{\mathrm{T}}^{\mathrm{ch}}(\mathbf{p}_{\mathrm{T}})^{\mathrm{T}}\boldsymbol{\delta}_{\mathrm{T}}+\frac{1}{2}\boldsymbol{\delta}_{\mathrm{T}}^{\mathrm{T}}\overline{\mathbf{M}}_{\mathrm{ph}}\boldsymbol{\delta}_{\mathrm{T}}. \tag*{(79)}

Proof. Please refer to Appendix A.

Hence, combining the bound (78) in Proposition 1 with the objective gradient g‾TF\overline{\mathbf{g}}_{\mathrm{T}}^{F} in (69), we obtain the MM upper bound, where F‾≜F(p‾T)\overline{F} \triangleq F(\overline{\mathbf{p}}_{\mathrm{T}}), as

F(pT)≤F‾T(δT)≜F‾+(g‾TF)TδT+12δTTM‾phδT,(80)F(\mathbf{p}_{\mathrm{T}}) \leq\overline{F}_{\mathrm{T}}(\boldsymbol{\delta}_{\mathrm{T}}) \triangleq\overline{F}+(\overline{\mathbf{g}}_{\mathrm{T}}^{F})^{\mathrm{T}}\boldsymbol{\delta}_{\mathrm{T}}+\frac{1}{2}\boldsymbol{\delta}_{\mathrm{T}}^{\mathrm{T}}\overline{\mathbf{M}}_{\mathrm{ph}}\boldsymbol{\delta}_{\mathrm{T}}, \tag*{(80)}

Power Gradient and Convex Inner Approximation

The accepted transmit power in (62) depends on the transmit positions through the pairwise distances in CT\mathbf{C}_{\mathrm{T}}, making the power constraint generally nonconvex. To address this, we construct a convex upper bound on the power function and impose the power limit on this bound, yielding a convex inner approximation of the constraint.

Let rmn≜∥pT,m−pT,n∥2r_{mn} \triangleq\|\mathbf{p}_{\mathrm{T},m}-\mathbf{p}_{\mathrm{T},n}\|_{2} denote the distance in (8), and let aT,mn≜Re⁡[S]mna_{\mathrm{T},mn} \triangleq\operatorname{Re}[\mathbf{S}]_{mn}. For distinct antenna positions, the gradient of PTP_{\mathrm{T}} w.r.t. antenna mm is computed as

∇pT,mPT=2∑n≠maT,mncT′(rmn)umn,(81)\nabla_{\mathbf{p}_{\mathrm{T},m}}P_{\mathrm{T}}=2\sum_{n\ne m}a_{\mathrm{T},mn}c_{\mathrm{T}}^{\prime}(r_{mn})\mathbf{u}_{mn}, \tag*{(81)}

where umn≜(pT,m−pT,n)/rmn\mathbf{u}_{mn}\triangleq(\mathbf{p}_{\mathrm{T},m}-\mathbf{p}_{\mathrm{T},n})/r_{mn}. Evaluating these gradient blocks at p‾T\overline{\mathbf{p}}_{\mathrm{T}} and stacking them in antenna order gives g‾TP\overline{\mathbf{g}}_{\mathrm{T}}^{P}.

Next, we bound the power Hessian over the candidate update region. We replace the nonconvex minimum-spacing constraints with their tangent inner approximations. Let d‾mn≜p‾T,m−p‾T,n\overline{\mathbf{d}}_{mn}\triangleq\overline{\mathbf{p}}_{\mathrm{T},m}-\overline{\mathbf{p}}_{\mathrm{T},n} and impose

2(d‾mn)T(pT,m−pT,n)−∥d‾mn∥22≥(dmin⁡)2.(82)2(\overline{\mathbf{d}}_{mn})^{\mathrm{T}}(\mathbf{p}_{\mathrm{T},m}-\mathbf{p}_{\mathrm{T},n})-\|\overline{\mathbf{d}}_{mn}\|_{2}^{2}\geq(d^{\min})^{2}. \tag*{(82)}

This constraint implies the original spacing constraint by convexity of the squared norm. Let r‾mn≜∥d‾mn∥2\overline{r}_{mn}\triangleq\|\overline{\mathbf{d}}_{mn}\|_{2} and dmax⁡≜diam⁡(AT)d^{\max}\triangleq\operatorname{diam}(\mathcal{A}_{\mathrm{T}}). By the Cauchy–Schwarz inequality, the tangent and aperture constraints bound each pairwise distance as

rmn∈R‾mn≜[r‾mn2+(dmin⁡)22r‾mn,dmax⁡].(83)r_{mn}\in\overline{\mathcal{R}}_{mn}\triangleq\left[\frac{\overline{r}_{mn}^{2}+(d^{\min})^{2}}{2\overline{r}_{mn}},d^{\max}\right]. \tag*{(83)}

Each pairwise Hessian contribution has radial and tangential eigenvalues 2aT,mncT′′(rmn)2a_{\mathrm{T},mn}c_{\mathrm{T}}^{\prime\prime}(r_{mn}) and 2aT,mncT′(rmn)/rmn2a_{\mathrm{T},mn}c_{\mathrm{T}}^{\prime}(r_{mn})/r_{mn}, respectively. The following proposition bounds these eigenvalues over R‾mn\overline{\mathcal{R}}_{mn} and combines the resulting pairwise bounds.

Proposition 2. For every edge m<nm<n, define

ω‾mn≜max⁡r∈R‾mn{0,2aT,mncT′′(r),2aT,mncT′(r)r},(84)\overline{\omega}_{mn}\triangleq\max_{r\in\overline{\mathcal{R}}_{mn}}\left\{0,2a_{\mathrm{T},mn}c_{\mathrm{T}}^{\prime\prime}(r),2a_{\mathrm{T},mn}\frac{c_{\mathrm{T}}^{\prime}(r)}{r}\right\}, \tag*{(84)}

and

M‾TP≜∑m<nω‾mn(em−en)(em−en)T⊗I2.(85)\overline{\mathbf{M}}_{\mathrm{T}}^{P}\triangleq\sum_{m<n}\overline{\omega}_{mn}(\mathbf{e}_{m}-\mathbf{e}_{n})(\mathbf{e}_{m}-\mathbf{e}_{n})^{\mathrm{T}}\otimes\mathbf{I}_{2}. \tag*{(85)}

For every δT\boldsymbol{\delta}_{\mathrm{T}} such that the pairwise distances along the entire segment from p‾T\overline{\mathbf{p}}_{\mathrm{T}} to p‾T+δT\overline{\mathbf{p}}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}} lie in their respective intervals R‾mn\overline{\mathcal{R}}_{mn},

PT(p‾T+δT)≤PT(p‾T)+(g‾TP)TδT+12δTTM‾TPδT.(86)P_{\mathrm{T}}(\overline{\mathbf{p}}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}})\leq P_{\mathrm{T}}(\overline{\mathbf{p}}_{\mathrm{T}})+(\overline{\mathbf{g}}_{\mathrm{T}}^{P})^{\mathrm{T}}\boldsymbol{\delta}_{\mathrm{T}}+\frac{1}{2}\boldsymbol{\delta}_{\mathrm{T}}^{\mathrm{T}}\overline{\mathbf{M}}_{\mathrm{T}}^{P}\boldsymbol{\delta}_{\mathrm{T}}. \tag*{(86)}

Proof. Please refer to Appendix B.

Hence, combining Proposition 2 with the power gradient g‾TP\overline{\mathbf{g}}_{\mathrm{T}}^{P} gives the convex power upper bound over the update domain defined below:

P^T(δT)≜P‾T+(g‾TP)TδT+12δTTM‾TPδT,(87)\widehat{P}_{\mathrm{T}}(\boldsymbol{\delta}_{\mathrm{T}})\triangleq\overline{P}_{\mathrm{T}}+(\overline{\mathbf{g}}_{\mathrm{T}}^{P})^{\mathrm{T}}\boldsymbol{\delta}_{\mathrm{T}}+\frac{1}{2}\boldsymbol{\delta}_{\mathrm{T}}^{\mathrm{T}}\overline{\mathbf{M}}_{\mathrm{T}}^{P}\boldsymbol{\delta}_{\mathrm{T}}, \tag*{(87)}

where P‾T≜PT(p‾T)\overline{P}_{\mathrm{T}}\triangleq P_{\mathrm{T}}(\overline{\mathbf{p}}_{\mathrm{T}}). Finally, combining the objective upper bound (80), the power upper bound (87), and the position update domain (82), we obtain the convex surrogate of problem (63) as

min⁡δTF^T(δT)(88)\begin{aligned} \min_{\boldsymbol{\delta}_{\mathrm{T}}}\quad&\widehat{F}_{\mathrm{T}}(\boldsymbol{\delta}_{\mathrm{T}}) \tag*{(88)} \end{aligned}
s.t.P^T(δT)≤Pmax⁡,p‾T+δT∈D‾T,(89)\begin{aligned} \text{s.t.}\quad&\widehat{P}_{\mathrm{T}}(\boldsymbol{\delta}_{\mathrm{T}})\leq P_{\max},\\ &\overline{\mathbf{p}}_{\mathrm{T}}+\boldsymbol{\delta}_{\mathrm{T}}\in\overline{\mathcal{D}}_{\mathrm{T}}, \tag*{(89)} \end{aligned}

where

D‾T≜{pT: pT,m∈AT, ∀m; (73), ∀m<n}.(90)\overline{\mathcal{D}}_{\mathrm{T}}\triangleq\left\{\mathbf{p}_{\mathrm{T}}:\ \mathbf{p}_{\mathrm{T},m}\in\mathcal{A}_{\mathrm{T}},\ \forall m;\ \text{(73)},\ \forall m<n\right\}. \tag*{(90)}

Now, problem (79) is a convex optimization problem and can be solved using standard convex optimization methods [34]. To efficiently solve this problem, we develop a conic ADMM method in Section III-E.

Receive Antenna Position Update

After the transmit MM step, we hold the updated transmit positions p‾T\overline{\mathbf{p}}_{\mathrm{T}} and the matrices {Jk,U‾k,V‾k}\{\mathbf{J}_{k},\overline{\mathbf{U}}_{k},\overline{\mathbf{V}}_{k}\} fixed and perform one MM step for each user’s receive positions. For user kk, Hk=H~k(P‾T,PR,k)\mathbf{H}_{k}=\widetilde{\mathbf{H}}_{k}(\overline{\mathbf{P}}_{\mathrm{T}},\mathbf{P}_{\mathrm{R},k}) and Rn,k\mathbf{R}_{n,k} both vary with PR,k\mathbf{P}_{\mathrm{R},k}. This position block affects only the kk-th summand of (61), which we denote by

FR,k=Tr⁡(AkgHkSHkH)−2Re⁡Tr⁡(ZkHHk)+Tr⁡(AkgRk).(91)\mathcal{F}_{\mathrm{R},k}=\operatorname{Tr}(\mathbf{A}_{k}^{\mathrm{g}}\mathbf{H}_{k}\mathbf{S}\mathbf{H}_{k}^{\mathrm{H}})-2\operatorname{Re}\operatorname{Tr}(\mathbf{Z}_{k}^{\mathrm{H}}\mathbf{H}_{k})+\operatorname{Tr}(\mathbf{A}_{k}^{\mathrm{g}}\mathbf{R}_{k}). \tag*{(91)}

The receive-position subproblem for user kk is

min⁡PR,kFR,k(92)\min_{\mathbf{P}_{\mathrm{R},k}}\quad\mathcal{F}_{\mathrm{R},k} \tag*{(92)}
s.t.(21e), (21f),\text{s.t.}\quad(21\mathrm{e}),\ (21\mathrm{f}),

where the constraints apply to user kk. Let pR,k≜vec⁡(PR,k)\mathbf{p}_{\mathrm{R},k}\triangleq\operatorname{vec}(\mathbf{P}_{\mathrm{R},k}) and p‾R,k=vec⁡(P‾R,k)\overline{\mathbf{p}}_{\mathrm{R},k}=\operatorname{vec}(\overline{\mathbf{P}}_{\mathrm{R},k}). Define the receive displacement as δR,k≜pR,k−p‾R,k∈R2Nk\boldsymbol{\delta}_{\mathrm{R},k}\triangleq\mathbf{p}_{\mathrm{R},k}-\overline{\mathbf{p}}_{\mathrm{R},k}\in\mathbb{R}^{2N_{k}}. The accepted transmit power is independent of the receive positions, and the KK subproblems are mutually independent for fixed transmit positions.

The objective and minimum-spacing constraints make (92) nonconvex. As in the transmit update, we construct an MM upper bound on the objective and a convex inner approximation of the spacing constraints. Write F‾R,k=FR,k+FR,knoise\overline{\mathcal{F}}_{\mathrm{R},k}=\mathcal{F}_{\mathrm{R},k}+\mathcal{F}_{\mathrm{R},k}^{\mathrm{noise}}, where the channel and noise terms consist of the first two terms and the last term of (91), respectively.

All channel quantities below use the updated transmit positions P‾T\overline{\mathbf{P}}_{\mathrm{T}}. In particular, we recompute Δk\boldsymbol{\Delta}_{k} in (66) using the channel after the transmit-position update. For the channel-gradient calculation, let DR,k,a\mathbf{D}_{\mathrm{R},k,a} be diagonal with entries [νR,k,ℓ]a[\nu_{\mathrm{R},k,\ell}]_{a} and let fk,n=Fken\mathbf{f}_{k,n}=\mathbf{F}_{k}\mathbf{e}_{n}. The derivative of the nn-th row of Hk\mathbf{H}_{k} with respect to the aa-coordinate of receive antenna nn is

hk,n,aR≜−jkfk,nHDR,k,aΠkGk.(93)\mathbf{h}_{k,n,a}^{\mathrm{R}} \triangleq-\mathrm{j}k\mathbf{f}_{k,n}^{\mathrm{H}}\mathbf{D}_{\mathrm{R},k,a}\mathbf{\Pi}_{k}\mathbf{G}_{k}. \tag*{(93)}

The corresponding channel-gradient block is

[gR,k,nch]a=2Re⁡[enTΔkr,k,n,a].(94)[\mathbf{g}^{\mathrm{ch}}_{R,k,n}]_a = 2\operatorname{Re}\left[\mathbf{e}_n^{\mathsf{T}}\Delta\mathbf{k}_{r,k,n,a}\right]. \tag*{(94)}

Substituting (17) into the noise term of (91), we apply the same differentiation as in (81) to obtain its receive-position gradient blocks, using pR,k,m\mathbf{p}_{R,k,m}, the kernel cR,kc_{R,k}, and the coefficients

aR,k,mn=σbg,k2Re⁡[Akg]mn.(95)a_{R,k,mn} = \sigma_{\mathrm{bg},k}^{2}\operatorname{Re}\left[\mathbf{A}_{k}^{\mathrm{g}}\right]_{mn}. \tag*{(95)}

The hardware-noise term is position independent and contributes zero gradient. Evaluating the channel and noise gradients at p‾R,k\overline{\mathbf{p}}_{R,k} and stacking their antenna blocks gives g‾R,kch\overline{\mathbf{g}}^{\mathrm{ch}}_{R,k} and g‾R,knoise\overline{\mathbf{g}}^{\mathrm{noise}}_{R,k}, respectively. Adding these two contributions gives the objective gradient

g‾R,k=g‾R,kch+g‾R,knoise.(96)\overline{\mathbf{g}}_{R,k}=\overline{\mathbf{g}}^{\mathrm{ch}}_{R,k}+\overline{\mathbf{g}}^{\mathrm{noise}}_{R,k}. \tag*{(96)}

We next construct Hessian upper bounds over the convex receive update domain D‾R,k\overline{\mathcal{D}}_{R,k}, obtained from (90) using the receive positions, aperture AR,k\mathcal{A}_{R,k}, and minimum spacing dR,kd_{R,k}.

To bound the channel Hessian, we rewrite the channel-dependent objective using the fixed transmit FRM G‾k\overline{\mathbf{G}}_k. Let BR,k=ΠkG‾k\mathbf{B}_{R,k}=\mathbf{\Pi}_k\overline{\mathbf{G}}_k and define

ΞR,k≜BR,kSBR,kH,(97)\mathbf{\Xi}_{R,k}\triangleq\mathbf{B}_{R,k}\mathbf{S}\mathbf{B}_{R,k}^{\mathrm{H}}, \tag*{(97)}
TR,k≜BR,kZkH.(98)\mathbf{T}_{R,k}\triangleq\mathbf{B}_{R,k}\mathbf{Z}_k^{\mathrm{H}}. \tag*{(98)}

The channel-dependent part of (91) can then be written as

FR,kch=Tr⁡(ΞR,kFkAkgFkH)−2Re⁡Tr⁡(TR,kHFk).(99)\mathcal{F}^{\mathrm{ch}}_{R,k}=\operatorname{Tr}\left(\mathbf{\Xi}_{R,k}\mathbf{F}_k\mathbf{A}_k^{\mathrm{g}}\mathbf{F}_k^{\mathrm{H}}\right)-2\operatorname{Re}\operatorname{Tr}\left(\mathbf{T}_{R,k}^{\mathrm{H}}\mathbf{F}_k\right). \tag*{(99)}

The channel term in (99) has the same harmonic structure as (70). Its coefficients and phase vectors follow from the transmit expressions by replacing (ΞT,k,S,TT,k,νT,k,ℓ)(\mathbf{\Xi}_{T,k},\mathbf{S},\mathbf{T}_{T,k},\boldsymbol{\nu}_{T,k,\ell}) with (ΞR,k,Akg,TR,k,νR,k,ℓ)(\mathbf{\Xi}_{R,k},\mathbf{A}_k^{\mathrm{g}},\mathbf{T}_{R,k},\boldsymbol{\nu}_{R,k,\ell}). Following Proposition 1, we obtain the channel Hessian upper bound M‾R,kch\overline{\mathbf{M}}^{\mathrm{ch}}_{R,k} over the receive aperture. For the noise term, the pairwise construction in Proposition 2, using cR,kc_{R,k}, the coefficients in (95), and the corresponding receive-distance intervals from (83), gives M‾R,knoise\overline{\mathbf{M}}^{\mathrm{noise}}_{R,k}.

The Hessian of FR,k\mathcal{F}_{R,k} is the sum of the channel and noise Hessians, so their upper bounds add. We therefore set

M‾R,k=M‾R,kch+M‾R,knoise.(100)\overline{\mathbf{M}}_{R,k}=\overline{\mathbf{M}}^{\mathrm{ch}}_{R,k}+\overline{\mathbf{M}}^{\mathrm{noise}}_{R,k}. \tag*{(100)}

Let F‾R,k=FR,k(P‾R,k)\overline{\mathcal{F}}_{R,k}=\mathcal{F}_{R,k}(\overline{\mathbf{P}}_{R,k}). Combining the channel and noise bounds gives the MM upper bound of the entire receive objective:

FR,k(PR,k)≤F^R,k(δR,k)≜F‾R,k+(g‾R,k)TδR,k+12δR,kTM‾R,kδR,k.(101)\mathcal{F}_{R,k}(\mathbf{P}_{R,k})\leq\widehat{\mathcal{F}}_{R,k}(\boldsymbol{\delta}_{R,k}) \triangleq\overline{\mathcal{F}}_{R,k}+(\overline{\mathbf{g}}_{R,k})^{\mathsf{T}}\boldsymbol{\delta}_{R,k} +\frac{1}{2}\boldsymbol{\delta}_{R,k}^{\mathsf{T}}\overline{\mathbf{M}}_{R,k}\boldsymbol{\delta}_{R,k}. \tag*{(101)}

Minimizing this upper bound over the receive update domain gives

min⁡δR,kF^R,k(δR,k)s.t.P‾R,k+δR,k∈D‾R,k.(102)\begin{aligned} \min_{\boldsymbol{\delta}_{R,k}}\quad&\widehat{\mathcal{F}}_{R,k}(\boldsymbol{\delta}_{R,k})\\ \mathrm{s.t.}\quad&\overline{\mathbf{P}}_{R,k}+\boldsymbol{\delta}_{R,k}\in\overline{\mathcal{D}}_{R,k}. \tag*{(102)} \end{aligned}

The KK receive-position subproblems are convex and can be solved in parallel.

ADMM-Based Solution to Position Subproblems

The transmit and receive position subproblems share a common conic structure. We exploit this structure to solve them using ADMM. We present the formulation and updates for the transmit displacement δT\boldsymbol{\delta}_T, and the receive counterpart follows from the corresponding coefficients and constraints. To express the transmit subproblem in conic form, we represent the spacing and aperture constraints using affine inequalities and, for disk apertures, second-order cone (SOC) constraints. The SOC is defined as Qq={(t,x):∥x∥2≤t}\mathcal{Q}_q=\{(\mathbf{t},x):\lVert\mathbf{x}\rVert_2\leq t\}. The remaining transmit power constraint admits a rotated SOC representation. In particular, factoring M‾Tp=LPTLP\overline{\mathbf{M}}_T^{\mathrm{p}}=\mathbf{L}_P^{\mathsf{T}}\mathbf{L}_P gives

(Pmax⁡−P‾T−(g‾T)TδT, 1, LPδT)∈Qr,(103)\left(P_{\max}-\overline{P}_T-(\overline{\mathbf{g}}_T)^{\mathsf{T}}\boldsymbol{\delta}_T,\ 1,\ \mathbf{L}_P\boldsymbol{\delta}_T\right)\in\mathcal{Q}_r, \tag*{(103)}

where Qr={(u,v,w):2uv≥∥w∥2, u,v≥0}\mathcal{Q}_r=\{(u,v,\mathbf{w}):2uv\geq\lVert\mathbf{w}\rVert^2,\ u,v\geq0\}. We collect these constraints into

min⁡δT12δTTQδT+gTδTs.t.KδT+c∈K,(104)\begin{aligned} \min_{\boldsymbol{\delta}_T}\quad&\frac{1}{2}\boldsymbol{\delta}_T^{\mathsf{T}}\mathbf{Q}\boldsymbol{\delta}_T+\mathbf{g}^{\mathsf{T}}\boldsymbol{\delta}_T\quad\mathrm{s.t.}\quad\mathbf{K}\boldsymbol{\delta}_T+\mathbf{c}\in\mathcal{K}, \tag*{(104)} \end{aligned}

where Q⪰0\mathbf{Q}\succeq0 and K\mathcal{K} is the product of the corresponding cones. For the receive subproblem, the cone product contains only the aperture and spacing blocks.

To solve (104), we introduce z=KδT+c\mathbf{z}=\mathbf{K}\boldsymbol{\delta}_T+\mathbf{c} and apply two-block ADMM with a scaled dual variable y\mathbf{y} [35]. Let tt index the ADMM iterations for the fixed surrogate subproblem at outer iteration ii. With penalty ρAD(t)>0\rho_{\mathrm{AD}}^{(t)}>0, define

RAD(t)=Q+ρAD(t)KTK.(105)\mathbf{R}_{\mathrm{AD}}^{(t)}=\mathbf{Q}+\rho_{\mathrm{AD}}^{(t)}\mathbf{K}^{\mathsf{T}}\mathbf{K}. \tag*{(105)}

A nonzero null direction of the aperture-constraint blocks would leave all aperture constraints unchanged, contradicting boundedness of the apertures. Hence K\mathbf{K} has full column rank and RAD(t)≻0\mathbf{R}_{\mathrm{AD}}^{(t)}\succ0. We obtain the updates

δT(t+1)=(RAD(t))−1[−g+ρAD(t)KT(z(t)−c−y(t))],(106)\boldsymbol{\delta}_T^{(t+1)}=\left(\mathbf{R}_{\mathrm{AD}}^{(t)}\right)^{-1}\left[-\mathbf{g}+\rho_{\mathrm{AD}}^{(t)}\mathbf{K}^{\mathsf{T}}\left(\mathbf{z}^{(t)}-\mathbf{c}-\mathbf{y}^{(t)}\right)\right], \tag*{(106)}
z(t+1)=ΠK(KδT(t+1)+c+y(t)),(107)\mathbf{z}^{(t+1)}=\Pi_{\mathcal{K}}\left(\mathbf{K}\boldsymbol{\delta}_T^{(t+1)}+\mathbf{c}+\mathbf{y}^{(t)}\right), \tag*{(107)}
y(t+1)=y(t)+KδT(t+1)+c−z(t+1).(108)\mathbf{y}^{(t+1)}=\mathbf{y}^{(t)}+\mathbf{K}\boldsymbol{\delta}_T^{(t+1)}+\mathbf{c}-\mathbf{z}^{(t+1)}. \tag*{(108)}

The product structure of K\mathcal{K} allows the projection ΠK\Pi_{\mathcal{K}} to be evaluated separately for each cone, with closed-form projections onto the orthant, SOC, and rotated SOC. The resulting displacement is then used to update the transmit antenna positions, and the receive positions are updated in the same manner.

Overall, the alternating optimization procedure, i.e., CD-WMMSE-MM method, is summarized in Algorithm 1.

Convergence and Complexity Analysis

With a feasible initialization and exact subproblem solutions, the WMMSE updates and the MM-based transmit and receive position updates preserve feasibility and do not increase the WMMSE objective. By the equivalence between the WMMSE and WSR formulations, the WSR is non-decreasing over the outer iterations. Since the WSR is bounded above, the objective value of Algorithm 1 converges. For the precoder update, the eigendecomposition-based computation costs O(M3+M2D+NbisMD)\mathcal{O}(M^3+M^2D+N_{\mathrm{bis}}MD), where D=∑kdkD=\sum_k d_k and NbisN_{\mathrm{bis}} is the number of bisection trials. For a fixed ADMM penalty, the transmit and receive position solves have an aggregate cost of O(M3+NAD,TM2+∑k[Nk3+NAD,R,kNk2])\mathcal{O}(M^3+N_{\mathrm{AD},T}M^2+\sum_k[N_k^3+N_{\mathrm{AD},R,k}N_k^2]), where NAD,TN_{\mathrm{AD},T} and NAD,R,kN_{\mathrm{AD},R,k} are their iteration counts.

Algorithm 1 The proposed CD-WMMSE-MM method

Input: Feasible PT(0)\mathbf{P}_{\mathrm{T}}^{(0)}, {PR,k(0)}\{\mathbf{P}_{\mathrm{R},k}^{(0)}\}, and {Wk(0)}\{\mathbf{W}_{k}^{(0)}\}

  1. Initialize {Jk(0)}\{\mathbf{J}_{k}^{(0)}\} using (27); set i←0i \leftarrow0

  2. repeat

  3. &nbsp;&nbsp;&nbsp;&nbsp;Update {Uk,Vk}\{\mathbf{U}_{k},\mathbf{V}_{k}\} using (43) and (44)

  4. &nbsp;&nbsp;&nbsp;&nbsp;Update {Jk}\{\mathbf{J}_{k}\} using (57) with scalar bisection on λ\lambda

  5. &nbsp;&nbsp;&nbsp;&nbsp;Refresh {Uk,Vk}\{\mathbf{U}_{k},\mathbf{V}_{k}\} using the updated {Jk}\{\mathbf{J}_{k}\}

  6. &nbsp;&nbsp;&nbsp;&nbsp;Construct and solve the transmit-position subproblem (79) by ADMM to update PT\mathbf{P}_{\mathrm{T}}

  7. &nbsp;&nbsp;&nbsp;&nbsp;Using the updated transmit positions and channels, construct and solve the receive-position subproblems (102) by ADMM in parallel to update {PR,k}\{\mathbf{P}_{\mathrm{R},k}\}

  8. &nbsp;&nbsp;&nbsp;&nbsp;Set i←i+1i \leftarrow i+1

  9. until The relative WSR improvement satisfies the prescribed tolerance

  10. Recover {Wk}\{\mathbf{W}_{k}\} by Wk=RT(PT)1/2Jk\mathbf{W}_{k}=\mathbf{R}_{\mathrm{T}}(\mathbf{P}_{\mathrm{T}})^{1/2}\mathbf{J}_{k}

Output: {Wk}\{\mathbf{W}_{k}\}, PT\mathbf{P}_{\mathrm{T}}, {PR,k}\{\mathbf{P}_{\mathrm{R},k}\}

Numerical Results

In this section, we evaluate the WSR performance of the MC-aware joint precoding and antenna positioning design in MA-enabled MU-MIMO systems.

Simulation Setup

We consider a 28 GHz narrowband downlink, for which the wavelength is approximately 10.714 mm. The default system consists of K=4K=4 users, M=8M=8 transmit antennas, and Nk=2N_k=2 receive antennas per user. Two data streams are sent to every user, i.e., dk=2d_k=2, and all user weights are set to one. The transmit antennas move in a 1.25λ×0.75λ1.25\lambda\times0.75\lambda rectangular aperture, whereas the receive antennas of every user move in a 0.5λ×0.5λ0.5\lambda\times0.5\lambda rectangular aperture. The minimum spacing at the BS and users is 0.2λ0.2\lambda.

The physical channel follows the clustered Rician structure used in [11]. In addition to the LoS component, three scattering clusters with eight subpaths per cluster are generated, giving 25 paired departure/arrival paths for each user. The Rician factor is 0 dB, the log-normal shadowing standard deviation is 4 dB, and user distances are drawn between 100 m and 300 m. The nominal departure angles of the four users are [−45∘,−10∘,25∘,60∘][-45^\circ,-10^\circ,25^\circ,60^\circ]. Both the transmit and receive MC matrices use the isotropic-element kernel c(r)=sinc⁡(2πr/λ)c(r)=\operatorname{sinc}(2\pi r/\lambda) [22]. The normalized transmit ohmic-loss coefficient is ρT=1/73.1≃0.01368\rho_{\mathrm{T}}=1/73.1\simeq0.01368. The total isolated-port noise power is −80-80 dBm; a 5 dB noise figure is used to divide it into the correlated background-noise and independent receiver-hardware-noise components in (17).

The reference SNR is defined at a distance of 200 m, with zero shadowing and before array and beamforming gains. For a requested reference SNR γref\gamma_{\mathrm{ref}}, the accepted-power budget is selected as

Pmax⁡[dBm]=γref[dB]+PL(200 m)[dB]+σtot2[dBm],(109)P_{\max}[\mathrm{dBm}]=\gamma_{\mathrm{ref}}[\mathrm{dB}]+\mathrm{PL}(200\ \mathrm{m})[\mathrm{dB}]+\sigma_{\mathrm{tot}}^{2}[\mathrm{dBm}], \tag*{(109)}

where PL(200 m)\mathrm{PL}(200\ \mathrm{m}) is the path loss at the reference distance. Thus, the instantaneous received SNRs still vary with user distance, shadowing, and small-scale fading.

We compare the proposed MC-aware joint precoding and antenna positioning design with the following baselines.

  • MC-aware fixed array: The transmit and receive antennas are fixed on uniform grids. We consider both conventional half-wavelength-spaced arrays and compact arrays with grid spacings chosen to satisfy the aperture and minimum-spacing constraints. For each fixed layout, we optimize the precoders and receive matrices using WMMSE [29, 30], with MC explicitly accounted for.

  • MC-ignored movable array: The transmit and receive antenna positions are jointly optimized without accounting for MC. The resulting positions and current-domain precoders are evaluated under the MC-aware model.

The default maximum number of outer iterations is 200. The relative WSR stopping tolerance is 2×10−42\times10^{-4}. The absolute and relative stopping tolerances of the inner ADMM solver are 10−710^{-7} and 10−610^{-6}, respectively, and at most 30,000 ADMM iterations are allowed per position update. Unless otherwise stated, each operating point is averaged over 1,000 independent channel realizations.

Convergence Behavior

Figure 2 illustrates the WSR trajectories of CD-WMMSE-MM for one representative channel realization at 0 dB and M∈{8,16,24}M\in\{8,16,24\}. All curves are recorded for 200 outer iterations without early stopping. They exhibit a sharp increase during the first few iterations, followed by progressively smaller improvements as the transceiver variables and antenna positions are refined. The WSR is nondecreasing for every array size, and the larger arrays attain higher WSR values in this realization.

Figure 2. Convergence of CD-WMMSE-MM for different numbers of transmit antennas under a representative channel realization at 0 dB reference SNR.

WSR Versus Reference SNR

Figure 3 shows the average WSR versus the reference SNR. The MC-aware joint design consistently outperforms both baselines over the entire range from −10-10 dB to 10 dB. At 0 dB, it achieves 9.173 bit/s/Hz, compared with 7.552 bit/s/Hz for the conventional half-wavelength fixed array and 8.302 bit/s/Hz for the movable design that ignores MC. These correspond to relative gains of 21.5% and 10.5%, respectively. The absolute gain over the fixed array increases from 1.021 bit/s/Hz at −10 dB to 1.913 bit/s/Hz at 10 dB. Meanwhile, the persistent gap to the MC-ignored design demonstrates that position optimization based only on the field-response channel cannot fully exploit the movable apertures when closely spaced antenna elements are coupled.

Figure 3. Average WSR versus reference SNR.

MMKKFixedTX-onlyRX-onlyJoint
16410.99711.07012.04412.215
16814.28514.37015.43215.656
20411.68511.69012.78812.803
20815.28915.29516.50416.521
24411.92511.92813.04513.056
24815.61015.61416.86416.875

Table 1. AVERAGE WSR (BIT/S/HZ) FOR ANTENNA-MOVEMENT CONFIGURATIONS AT 0 dB REFERENCE SNR.

Ablation of Transmit- and Receive-Side Antenna Movement

Table I compares joint position optimization with the fixed-array, TX-only, and RX-only designs for M∈{16,20,24}M \in\{16, 20, 24\} and K∈{4,8}K \in\{4, 8\} at 0 dB. The joint design achieves the highest average WSR in all six settings.

Among the single-block variants, RX-only position optimization captures most of the gain from antenna movement, whereas TX-only position optimization remains close to the fixed feasible grid. At M=16M = 16, joint TX–RX position optimization still improves upon RX-only position optimization by 1.4% for both user loads. The incremental gain decreases to 0.06%–0.12% for M∈{20,24}M \in\{20, 24\}, although the joint design remains the best in every setting. Thus, receive-side movement provides most of the antenna-movement gain for the larger compact transmit arrays considered here, while jointly optimizing both position blocks yields the highest WSR in these settings.

Impact of the Transmit and Receive Apertures

Figure 4 separately varies the transmit- and receive-aperture scales, with the other aperture held at its nominal size. The same feasible initial antenna positions are used across aperture scales. The fixed-array baseline remains at 8.251 bit/s/Hz because its antenna positions do not change.

Average weighted sum-rate versus transmit aperture scale and receive aperture scale

Figure 4. (a) WSR performance w.r.t. different transmit aperture scale. (b) WSR performance w.r.t. different receive aperture scale. Average WSR versus transmit- and receive-aperture scales at 0 dB reference SNR.

In Fig. 4??, enlarging the transmit aperture scale from 0.8 to 2 increases the WSR of the MC-aware joint design from 9.595 to 9.982 bit/s/Hz, with most of the gain already realized by scale 1.5. In contrast, Fig. 4?? shows a steadier increase from 9.689 to 10.232 bit/s/Hz as the receive aperture is enlarged. At scale 2, the MC-aware joint design outperforms the fixed grid by 21.0% in the transmit-aperture sweep and by 24.0% in the receive-aperture sweep. The MC-ignored design benefits from a larger feasible region but remains well below the MC-aware joint design throughout both sweeps. These results indicate that the nominal compact apertures already capture a large fraction of the available gain from antenna movement, while additional receive-side space remains particularly useful for jointly improving the desired channel and the coupling-dependent noise covariance.

Scaling With the Number of Transmit Antennas

Fig. 5 studies the effect of increasing MM under two aperture policies. In Fig. 5??, the physical transmit aperture is kept fixed. The WSR of the MC-aware joint design increases from 9.154 bit/s/Hz at M=8M = 8 to 13.056 bit/s/Hz at M=24M = 24, but the incremental gain gradually decreases as the aperture becomes crowded. The MC-ignored design saturates much earlier: its WSR peaks around M=16M = 16 and remains near 9 bit/s/Hz for M=20M = 20 and 24. Consequently, the gain of the MC-aware joint design over the MC-ignored design widens from 10.4% at M=8M = 8 to 44.9% at M=24M = 24. This widening gap highlights the increasing importance of accounting for coupling in the design when more antenna elements are packed into the fixed aperture.

In Fig. 5??, both linear dimensions of the transmit aperture are scaled by M/8\sqrt{M/8}, so that the aperture area per transmit antenna remains constant. All three designs then continue to improve with MM. At M=24M = 24, the proposed, fixed-grid, and MC-ignored designs achieve 14.712, 13.466, and 12.132 bit/s/Hz, respectively. Comparing the two panels shows that saturation at large MM under a fixed aperture is consistent with the effects of denser antenna packing and stronger MC. MC-aware position optimization mitigates this effect, while enlarging the physical aperture provides an additional gain.

Scaling With the Number of Users

Fig. 6 reports the average WSR for K∈{2,4,6,8}K \in\{2, 4, 6, 8\}, with M=16M = 16 and the nominal departure directions uniformly spread from −60° to 60°. The aggregate WSR increases with KK for all designs. The MC-aware joint design remains above both baselines, and its advantage over the MC-ignored movable design grows from 25.3% at K=2K = 2 to 33.6% at K=8K = 8.

Conclusion

This paper investigated joint precoding and antenna positioning for MA-enabled MU-MIMO systems with position-dependent MC. We combined field-response and circuit-based models and developed a current-domain WMMSE framework with MM-based position updates and a conic ADMM solver. Numerical results demonstrated the WSR benefits of the proposed design over both MC-aware fixed arrays and movable arrays designed without considering MC. The

Figure 5. (a) Fixed transmit aperture. (b) Fixed transmit-antenna density. Average WSR versus the number of transmit antennas at 0 dB reference SNR. At fixed antenna density, both transmit-aperture dimensions scale as M/8\sqrt{M/8}.

Figure 6. Average WSR versus the number of users at 0 dB reference SNR with M=16M = 16.

current-domain formulation also clarifies the different roles of transmit and receive antenna positioning: transmit positions affect the power required to generate the antenna currents, while receive positions affect the noise covariance, alongside their respective effects on propagation. The impact of these coupling-dependent quantities is governed by the transmit-current covariance and receive processing. Consequently, the antenna positions should be optimized together with the precoders and receive processing, accounting for their combined effects on desired signals, interference, transmit power, and receive noise.

Appendix

Proof of Proposition 1

For any pT∈ATM\mathbf{p}_{T} \in\mathcal{A}_{T}^{M}, the bounds in (76) place the phase aqTpT+arg⁡(χq)\mathbf{a}_{q}^{T}\mathbf{p}_{T} + \arg(\chi_{q}) in Θq\Theta_{q}. The definition of μ‾q\overline{\mu}_{q} therefore bounds the scalar coefficient in (75) from above, and, since aqaqT⪰0\mathbf{a}_{q}\mathbf{a}_{q}^{T} \succeq0, we obtain ∇2hq(pT)⪯μ‾qaqaqT\nabla^{2}h_{q}(\mathbf{p}_{T}) \preceq\overline{\mu}_{q}\mathbf{a}_{q}\mathbf{a}_{q}^{T}. Summing these inequalities over q∈Hq \in\mathcal{H} gives the Hessian bound in (78). Moreover, convexity of AT\mathcal{A}_{T} ensures that the line segment from p‾T\overline{\mathbf{p}}_{T} to any feasible p‾T+δT\overline{\mathbf{p}}_{T} + \delta_{T} lies entirely in ATM\mathcal{A}_{T}^{M}, so the same Hessian bound holds throughout the segment. Applying this bound to the integral remainder in Taylor’s theorem bounds the remainder by 12δTTM‾TϕδT\frac{1}{2}\delta_{\mathrm{T}}^{\mathrm{T}}\overline{\mathbf{M}}_{\mathrm{T}}\phi_{\delta_{\mathrm{T}}}, where the factor 12\frac{1}{2} follows from ∫01(1−t) dt=12\int_{0}^{1}(1-t)\,\mathrm{d}t=\frac{1}{2}. Substituting this bound into the Taylor expansion gives (79). This completes the proof.

Proof of Proposition 2

Because CT\mathbf{C}_{\mathrm{T}} is real symmetric and S‾\overline{\mathbf{S}} is Hermitian, the accepted transmit power can be written as

PT(pT)=constant+2∑m<naT,mncT(rmn).(110)\mathcal{P}_{\mathrm{T}}(\mathbf{p}_{\mathrm{T}})=\text{constant}+2\sum_{m<n}a_{\mathrm{T},mn}c_{\mathrm{T}}(r_{mn}). \tag*{(110)}

Differentiating the edge potentials gives the gradient in (81). For one edge, the Hessian with respect to dmn=pT,m−pT,n\mathbf{d}_{mn}=\mathbf{p}_{\mathrm{T},m}-\mathbf{p}_{\mathrm{T},n}, with r=∥dmn∥2r=\lVert\mathbf{d}_{mn}\rVert_{2} and u=dmn/r\mathbf{u}=\mathbf{d}_{mn}/r, is

Wmn(r)=2aT,mn[cT′′(r)uuT+cT′(r)r(I2−uuT)].(111)\mathbf{W}_{mn}(r)=2a_{\mathrm{T},mn}\left[c_{\mathrm{T}}^{\prime\prime}(r)\mathbf{u}\mathbf{u}^{\mathrm{T}}+\frac{c_{\mathrm{T}}^{\prime}(r)}{r}\left(\mathbf{I}_{2}-\mathbf{u}\mathbf{u}^{\mathrm{T}}\right)\right]. \tag*{(111)}

Its radial and tangential eigenvalues are 2aT,mncT′′(r)2a_{\mathrm{T},mn}c_{\mathrm{T}}^{\prime\prime}(r) and 2aT,mncT′(r)/r2a_{\mathrm{T},mn}c_{\mathrm{T}}^{\prime}(r)/r, respectively, so (84) gives

Wmn(r)⪯ω‾mnI2,r∈R‾mn.\mathbf{W}_{mn}(r)\preceq\overline{\omega}_{mn}\mathbf{I}_{2},\qquad r\in\overline{\mathcal{R}}_{mn}.

The contribution of this edge to the stacked position Hessian is

(em−en)(em−en)T⊗Wmn(r).(\mathbf{e}_{m}-\mathbf{e}_{n})(\mathbf{e}_{m}-\mathbf{e}_{n})^{\mathrm{T}}\otimes\mathbf{W}_{mn}(r).

Because (em−en)(em−en)T⪰0(\mathbf{e}_{m}-\mathbf{e}_{n})(\mathbf{e}_{m}-\mathbf{e}_{n})^{\mathrm{T}}\succeq0, summing the edge bounds gives ∇2PT⪯M‾TP\nabla^{2}\mathcal{P}_{\mathrm{T}}\preceq\overline{\mathbf{M}}_{\mathrm{T}}^{\mathrm{P}} whenever all pairwise distances lie in their respective intervals R‾mn\overline{\mathcal{R}}_{mn}. The distance condition in Proposition 2 ensures that this Hessian bound holds throughout the update segment, so Taylor’s theorem with integral remainder gives (86). This completes the proof.

References

References

  1. [1]K. B. Letaief, W. Chen, Y. Shi, J. Zhang, and Y.-J. A. Zhang, “The roadmap to 6G: AI empowered wireless networks,” IEEE Commun. Mag., vol. 57, no. 8, pp. 84–90, Aug. 2019.arxiv.org/abs/1904.11686
  2. [2]W. Saad, M. Bennis, and M. Chen, “A vision of 6G wireless systems: Applications, trends, technologies, and open research problems,” IEEE Network, vol. 34, no. 3, pp. 134–142, 2020.arxiv.org/abs/1902.10265
  3. [3]X. Lin, J. Zhang, Y. Liu, and J. Kim, Eds., Fundamentals of 6G communications and networking. Cham, Switzerland: Springer, 2024.DOI
  4. [4]E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, “Massive MIMO for next generation wireless systems,” IEEE Commun. Mag., vol. 52, no. 2, pp. 186–195, Feb. 2014.DOI
  5. [5]L. Lu, G. Y. Li, A. L. Swindlehurst, A. Ashikhmin, and R. Zhang, “An overview of massive MIMO: Benefits and challenges,” IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 742–758, Oct. 2014.DOI
  6. [6]W. Ma, L. Zhu, and R. Zhang, “MIMO capacity characterization for movable antenna systems,” IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 3392–3407, Apr. 2024.arxiv.org/abs/2210.05396
  7. [7]W. K. New, K.-K. Wong, H. Xu, K.-F. Tong, and C.-B. Chae, “An information-theoretic characterization of MIMO-FAS: Optimization, diversity-multiplexing tradeoff and q-outage capacity,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 5541–5556, 2024.
  8. [8]E. Tang, W. Guo, H. Se, S. Song, J. Zhang, and K. B. Letaief, “A unified two-stage generative diffusion framework for channel estimation and port selection in multiuser MIMO-FAS,” arXiv preprint arXiv:2605.29679, 2026.arxiv.org/abs/2605.29679
  9. [9]Z. Wang, L. Zheng, Y. Shi, K. Huang, and K. B. Letaief, “Rethinking channel estimation for fluid antenna systems: A physics-informed operator learning,” arXiv preprint arXiv:2610.36787, 2026.arxiv.org/abs/2610.36787
  10. [10]L. Zhu, W. Ma, and R. Zhang, “Modeling, estimation, and performance analysis for movable antenna enabled wireless communications,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 6234–6250, Jun. 2024.arxiv.org/abs/2210.05325
  11. [11]T. Liao, W. Guo, J. Qian, Z. Wang, S. Song, J. Zhang, and K. B. Letaief, “Rethinking mutual coupling in movable antenna MIMO systems: Modeling and optimization,” arXiv preprint arXiv:2604.26282, 2026.arxiv.org/abs/2604.26282
  12. [12]W. Xu, L. Zhu, W. Ma, A. Liu, and R. Zhang, “Movable antenna enhanced multiuser communications with mutual coupling,” IEEE Commun. Lett., vol. 30, pp. 1954–1958, 2026.DOI
  13. [13]M. T. Iravanchy and J. A. Nossek, “Toward a circuit theory of communication,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 57, no. 7, pp. 1663–1683, Jul. 2010.
  14. [14]L. Zhu, W. Ma, B. Ning, and R. Zhang, “Movable-antenna enhanced multiuser communication via antenna position optimization,” IEEE Trans. Wireless Commun., vol. 23, no. 7, pp. 7214–7229, Jul. 2024.arxiv.org/abs/2302.06978
  15. [15]B. Feng, Y. Wu, X.-G. Xia, and C. Xiao, “Weighted sum-rate maximization for movable antenna-enhanced wireless networks,” IEEE Wireless Commun. Lett., vol. 13, no. 6, pp. 1770–1774, 2024.arxiv.org/abs/2404.09734
  16. [16]T. Liao, W. Guo, H. He, S. Song, J. Zhang, and K. B. Letaief, “Joint beamforming and antenna position optimization for fluid antenna-assisted MU-MIMO networks,” IEEE J. Sel. Areas Commun., vol. 44, pp. 1209–1226, 2026.arxiv.org/abs/2503.04040
  17. [17]S. Yang, Z. Wan, Y. Xiu, B. Ning, Y. Li, Y. Liu, and C. Yuen, “Flexible WMMSE beamforming for MU-MIMO movable antenna communications,” IEEE Trans. Signal Process., vol. 73, pp. 4479–4491, 2025.arxiv.org/abs/2503.17718
  18. [18]Z. Zheng, Q. Wu, W. Chen, and G. Hu, “Two-timescale design for movable antenna-enabled multiuser MIMO systems,” IEEE Trans. Commun., vol. 73, no. 11, pp. 10554–10571, 2025.DOI
  19. [19]X. Pi, L. Zhu, H. Mao, X. Xiao, X.-G. Xia, and R. Zhang, “Movable antenna enabled near-field MU-MIMO communication,” IEEE Wireless Commun. Lett., vol. 14, no. 10, pp. 3319–3323, 2025.DOI
  20. [20]A. Irshad, E. Björnson, A. Kosasih, and V. Petrov, “Performance evaluation of movable antenna arrays in wideband multi-user MIMO systems,” IEEE Trans. Commun., 2026, early access, doi: 10.1109/TCOMM.2026.3745149.DOI
  21. [21]S. S. A. Yuan, X. Chen, C. Huang, and W. E. I. Sha, “Effects of mutual coupling on degree of freedom and antenna efficiency in holographic MIMO communications,” IEEE Open J. Antennas Propag., vol. 4, pp. 237–244, 2023.DOI
  22. [22]A. Pizzo and A. Lozano, “Mutual coupling in holographic MIMO: Physical modeling and information-theoretic analysis,” IEEE J. Sel. Areas Inf. Theory, vol. 6, pp. 111–126, 2025.arxiv.org/abs/2502.10209
  23. [23]J. Zhu, F. Han, Y. Guo, and Y. Wang, “Mutual coupling-enhanced movable antenna arrays: Breaking minimum-spacing constraints,” IEEE Commun. Lett., vol. 30, pp. 672–676, 2026.DOI
  24. [24]W. Xu, L. Zhu, W. Ma, A. Liu, and R. Zhang, “Directivity enhancement of movable antenna arrays with mutual coupling,” IEEE Wireless Commun. Lett., vol. 15, pp. 2759–2763, 2026.
  25. [25]Z. Zhang, Y. Wu, H. Jiang, Z. Chen, and Z. Zhang, “Electromagnetic-aware fluid antenna array,” arXiv preprint arXiv:2607.21375, 2026.arxiv.org/abs/2607.21375
  26. [26]G. Iacovelli, C. K. Sheemar, and S. Chatzinotas, “Mutual-coupling-aware movable and fluid antennas on holographic surfaces: A wavenumber-domain circuit-field unification,” arXiv preprint arXiv:2609.04968, 2026.
  27. [27]J. Xu, J. Dang, and Z. Zhang, “Off-grid position optimization under mutual coupling in fluid antenna arrays,” arXiv preprint arXiv:2608.15603, 2026.arxiv.org/abs/2608.15603
  28. [28]J. Xu, H. Liang, Z. Zhang, and J. Dang, “Sparse port selection under mutual coupling in fluid antenna arrays,” arXiv preprint arXiv:2608.15599, 2026.arxiv.org/abs/2608.15599
  29. [29]S. S. Christensen, R. Agarwal, E. De Carvalho, and J. M. Cioffi, “Weighted sum-rate maximization using weighted MMSE for MIMO beamforming design,” IEEE Trans. Wireless Commun., vol. 7, no. 12, pp. 4792–4799, Dec. 2008.
  30. [30]Q. Shi, M. Razaviyayn, Z.-Q. Luo, and C. He, “An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel,” IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4331–4340, Sep. 2011.
  31. [31]X. Zhao, S. Lu, Q. Shi, and Z.-Q. Luo, “Rethinking WMMSE: Can its complexity scale linearly with the number of BS antennas?” IEEE Trans. Signal Process., vol. 71, pp. 433–446, 2023.DOI
  32. [32]D. R. Hunter and K. Lange, “A tutorial on MM algorithms,” The American Statistician, vol. 58, no. 1, pp. 30–37, Feb. 2004.DOI
  33. [33]Y. Sun, P. Babu, and D. P. Palomar, “Majorization-minimization algorithms in signal processing, communications, and machine learning,” IEEE Trans. Signal Process., vol. 65, no. 3, pp. 794–816, Feb. 2017.DOI
  34. [34]S. Boyd and L. Vandenberghe, Convex optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
  35. [35]S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learn., vol. 3, no. 1, pp. 1–122, 2011.

Paper details

vlnc:W_7a5g88zw
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents