Multiuser Multibeam Beamforming
Joint Design of and
With the cascaded channel model of Section 21.3 in hand, the multiuser problem is now clear: we must design a digital precoder on the -element active feed together with a passive phase profile on the RIS. The digital precoder picks the right combination of the spatial modes; the RIS phase profile picks which modes the feed has access to.
A clean analytical derivation is not available β the problem is bilinear in and and has unit-modulus phase constraints, which are non-convex. The standard recipe is alternating optimization: (i) fix , compute the optimal linear precoder via ZF or MMSE on the resulting effective channel; (ii) fix , update by solving the per-element sub-problem or by an SDR/majorization relaxation. The procedure converges quickly in practice even on non-convex landscapes, and we report numerical evidence that 5β15 iterations reach within dB of a much more expensive branch-and-bound baseline.
Definition: Multiuser Downlink with Array-Fed RIS
Multiuser Downlink with Array-Fed RIS
The active-array feed of an array-fed RIS base station serves single-antenna users. The transmitted baseband signal is
where is the vector of independent unit-power user symbols and is the active-array precoder for user , with the sum-power constraint . User 's received signal is
where is user 's effective channel. The SINR of user is
and the downlink sum rate is .
Theorem: Optimal Linear Precoder for Fixed RIS Phase Profile
Fix and define the effective multiuser channel matrix
If and has full row rank, the zero-forcing precoder
nulls all interference, where sets the per-user powers. The regularized (MMSE) variant replaces the inverse by with , yielding a higher sum rate at finite SNR.
ZF reduces the problem to parallel scalar channels at the price of a power penalty set by the condition of . A well-chosen shapes to be well-conditioned β essentially picking a set of near-orthogonal directions on the -dimensional active-feed manifold β which is the design objective for the outer loop.
Interference cancellation condition
Require for . This is linear constraints on the entries of . For the feasibility is generic.
Right pseudo-inverse
The MooreβPenrose pseudo-inverse is the right inverse of a full-row-rank , so , which is diagonal. Interference is zero by construction, and the per-user effective channel becomes .
SINR of ZF
, and the sum-power constraint determines the feasible by waterfilling.
Alternating Optimization for Array-Fed RIS Sum-Rate
Complexity: with βEach per-element update in lines 6β7 is exact because the dependence of the sum rate on a single (with all others fixed) is a single sinusoid β Caire and collaborators' key structural observation. This makes the outer loop monotonically non-decreasing and allows certification of local optimality at convergence.
Example: Two-User Array-Fed RIS: Numerical Walk-Through
Consider an array-fed RIS with , , single-antenna users at angles in the far field of the RIS. Assume LOS reflected channels with m. The sum-power budget is W. Compute (a) the ZF precoder given the ideal RIS profile aligning both user directions, (b) the SINR of each user, and (c) the sum rate at GHz.
Ideal RIS phase profile
The RIS aligns its aperture between the two user steering vectors. Setting for some maximizes the joint illumination. For the symmetric case , the effective per-user array gains are in each direction.
Effective channel matrix
With the near-field coupler approximated as orthonormal, has row norms . The two rows are nearly orthogonal because the angular separation exceeds the active-feed beamwidth.
ZF SINR and sum rate
With , ZF is feasible. Equal-power allocation gives . With in the chosen normalization, the post-ZF SNR per user is . At dBm over MHz, dB, and the sum rate is approximately bits/s/Hz β vastly better than a passive RIS of the same size.
Multiuser Sum Rate vs
Compute the multiuser sum rate of an array-fed RIS with active elements serving users as grows. The curves use the analytical alt-opt upper bound; compare with a passive RIS baseline at the same .
Parameters
Estimating the Cascaded Channel
All the algorithms in this section assume perfect knowledge of , which is itself a function of the RIS phase profile. In practice, the BS must probe the cascaded channel using a sequence of pilot training patterns , each producing a measurement of a different linear combination of the rank-one terms in the sum decomposition of . The number of training phases required scales as to resolve all cascaded entries, and the pilot overhead can be reduced further by exploiting angular sparsity of the reflected channels β a direct generalization of the compressed channel estimation techniques of Chapter 8 and FSI Chapter 12. The bottom line is that the channel estimation problem is non-trivial but tractable; we leave its full treatment to Chapter 22 and the RIS book.
Convergence and Real-Time Operation
The alternating optimization of Algorithm AAlternating Optimization for Array-Fed RIS Sum-Rate converges in outer iterations for typical geometries. Each iteration requires one MMSE precoder update () and per-element phase updates (). At , , , , this is roughly flops per coherence block β milliseconds on a commodity DSP. The bottleneck in real deployments is channel estimation, not precoding.
Three practical observations from the CommIT prototype:
- Warm-starting from the previous coherence block reduces to 2β3.
- Per-element updates can be parallelized, because (after a Taylor expansion) the cross-effects are weak when is small.
- Phase quantization is applied only at the final step; quantizing inside the loop causes instability.
- β’
Coherence block of ~ 1 ms at mmWave (large Doppler)
- β’
Phase resolution in hardware: 1β3 bits (Section 21.1 engineering note)
- β’
Channel estimation pilot overhead scales as
Common Mistake: Alt-Opt Is Not Globally Optimal
Mistake:
Because each step of the alternating procedure monotonically increases the sum rate, it is tempting to claim that Algorithm AAlternating Optimization for Array-Fed RIS Sum-Rate converges to the global optimum.
Correction:
Monotone convergence only guarantees a local stationary point. The joint problem is non-convex in (unit-modulus constraints) and multi-modal. Empirically, alt-opt reaches a good local optimum within 0.5 dB of the branch-and-bound global solution, but rare initializations converge to inferior critical points. In production, it is common to run a small number of random restarts (5β10) and pick the best. We will see similar caveats when we generalize to SDR and majorization-based algorithms in Chapter 22.
Quick Check
An array-fed RIS with , serves users. Using the ZF precoder alone is infeasible. Which of the following is the most reasonable remedy?
Increase until
Apply MMSE + user scheduling so that at most users are served per resource block
Use random RIS phases and ZF
Drop 4 users permanently
The rank of is capped at , so at most 8 users can be served on orthogonal spatial modes at a single time-frequency resource. The 12 users must share via time-frequency scheduling, each resource block serving at most of them. MMSE precoding handles the residual interference between scheduled users better than ZF when SINR is moderate. Increasing helps array gain but does not unlock more DoF.