Beamforming Gain Maximization for Fluid Reconfigurable Intelligent Surface: A Minkowski Geometry Approach

arXiv:2602.11654 · eess.SP · Submitted 2026-02-12 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.

Rosa: We're looking at the paper: "Beamforming Gain Maximization for Fluid Reconfigurable Intelligent Surface".

Dev: Here's the gist of the paper. This paper investigates beamforming-gain maximization for a fluid reconfigurable intelligent surface (FRIS)-assisted downlink system where each active port applies a finite-resolution unit-modulus phase selected from a discrete codebook, leading to a highly nonconvex mixed discrete optimization.

Rosa: Problem Formulation and Framework The resulting design couples the multi-antenna base-station (BS) beamformer with combinatorial FRIS port selection and discrete phase assignment, leading to a highly nonconvex mixed discrete optimization.

Dev: To address this challenge, an alternating-optimization (AO) framework is developed that alternates between a closed-form maximum-ratio-transmission (MRT) update at the BS and an optimal FRIS-configuration update.

Rosa: The core of the proposed FRIS configuration is a Minkowski-geometry reformulation of the FRIS codebook superposition by convexifying the feasible reflected-sum set and exploiting supportfunction identities.

Paper summary: Dev: So wrapping up this discussion on "Beamforming Gain Maximization for Fluid Reconfigurable Intelligent Surface: A Minkowski Geometry Approach", the authors, Hong Bae Jeon and his team, have presented a method that tackles the highly nonconvex mixed discrete optimization problem in FRIS systems.

Rosa: They used Minkowski geometry to reformulate the codebook superposition, which turned the FRIS subproblem into a one-dimensional maximization over a directional parameter. This allowed them to use support function identities to simplify things significantly.

Taro: The key result we talked about is that for regular Mp-gon codebooks, they get closed-form expressions for per-port directional scores, which leads to a piecewise smooth structure in the support function.

Dev: That smoothness is what lets them use a finite candidate angle search instead of sweeping every single possible direction, which proves they can find the global optimum without doing an exhaustive search.

Rosa: It’s not just about getting a result; it’s about establishing a principled framework that couples the base station beamformer with the discrete FRIS port selection and phase assignment in an efficient way.

Taro: For wireless engineers, this means you have a concrete tool to design systems where you need high gain but are limited by practical hardware constraints on how finely you can control those surface phases.

Dev: The overall implication is that we can get near-optimal beamforming gains with a very low iteration count, and the complexity scales reasonably well with the number of antennas and codebook size.

Rosa: So, this paper gives us a geometry-driven solution for beamforming in FRIS systems that’s both efficient computationally and mathematically sound.

Conclusion: Rosa: So we’re wrapping up our look at this paper, "Beamforming Gain Maximization for Fluid Reconfigurable Intelligent Surface: A Minkowski Geometry Approach." Basically, they figured out a way to make the best possible signal boost using that fluid surface technology while keeping things computationally manageable.

Dev: Yeah, it tackles this huge problem of mixed discrete optimization—it’s like trying to pick the right combination of surface ports and the right phase settings all at once, and it gets really hard because there are so many possibilities.

Taro: The core idea they used was turning that messy combination problem into something geometric by using Minkowski geometry. They reformulated the way those surface ports can be combined, which made it much simpler to solve mathematically.

Rosa: And the big win there is how they handled the phase assignment for those surface ports. They found that by looking at a certain mathematical structure—a support function—they could reduce that complicated search space down to just one dimension.

Dev: That reduction was key for me from a controls standpoint because it means we don't have to check every single possible combination of the surface elements; we can focus our search on just one direction.

Taro: And for the regular phase codebooks they used, they got closed-form expressions. That means instead of doing an exhaustive search over every possible angle, they can just test a finite set of critical angles and you’re guaranteed to find the best one.

Rosa: It’s really neat because it shows that even with these complex physical systems, if you have the right mathematical framework—like geometry—you can get very close to the perfect performance without needing an impossible amount of computing power.

Dev: It's efficient for real-time loops too, which is what I care about. The complexity analysis showed it scales reasonably well with the number of antennas and codebook size, meaning it should run fast enough for actual deployment.

Taro: So, what this means practically is that we can design these intelligent surfaces to deliver maximum signal gain reliably, not just in a perfect lab scenario but when things are actually happening in the field.

Rosa: Exactly. It gives us a principled way to move from theory to something that actually works when you’re trying to maximize performance across a fluid system.

Dev: And this efficiency is what makes it interesting for real-world systems where latency matters and you need a robust safety case for the control loop.

Hong-Bae Jeon

Hankuk University of Foreign Studies Research Fund of 2026

eess.SP

Submitted: 2026-02-12

Updated: 2026-11-07

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 88/100

The gist: This paper investigates beamforming-gain maximization for a fluid reconfigurable intelligent surface (FRIS)-assisted downlink system where each active port applies a finite-resolution unit-modulus…

Key concepts

Mixed Discrete Optimization
This is a difficult mathematical problem where you have to make two types of decisions simultaneously: choosing which ports on the FRIS to use (discrete) and selecting a specific phase from a limited set for each chosen port. The paper addresses this highly complex scenario.
Alternating-Optimization (AO)
This is a strategy used to solve hard problems by breaking them into simpler, alternating steps. The process involves two main cycles: first optimizing the base station's beamformer based on current FRIS settings, and then optimizing the FRIS configuration based on the current beamformer.
Minkowski Geometry
This is a mathematical tool used to simplify problems involving sets of points or shapes. In this context, it helps transform the complex set of possible reflected-sum configurations from the FRIS codebook into a simpler shape (a convex hull) that can be easily analyzed for its optimal direction.
Support Function
A support function is a mathematical tool that describes the geometric properties of a set. The paper uses it to convert the complex maximization problem over all possible phase combinations into a simpler one-dimensional search, making it computationally feasible.

Terminology

Summary

This paper investigates beamforming-gain maximization for a fluid reconfigurable intelligent surface (FRIS)-assisted downlink system where each active port applies a finite-resolution unit-modulus phase selected from a discrete codebook, leading to a highly nonconvex mixed discrete optimization. p. 0

Where the paper says it

1 Beamforming Gain Maximization for Fluid Reconfigurable Intelligent Surface: A Minkowski Geometry Approach Hong-Bae Jeon, Member, IEEE Abstract—This paper investigates beamforming-gain maximization for a fluid reconfigurable intelligent surface (FRIS)- assisted downlink system, where each active port applies a finiteresolution unit-modulus phase selected from a discrete codebook. The resulting design couples the multi-antenna base-station (BS) beamformer with combinatorial FRIS port selection and discrete phase assignment, leading to a highly nonconvex mixed discrete optimization.

Problem Formulation and Framework

The resulting design couples the multi-antenna base-station (BS) beamformer with combinatorial FRIS port selection and discrete phase assignment, leading to a highly nonconvex mixed discrete optimization. To address this challenge, an alternating-optimization (AO) framework is developed that alternates between a closed-form maximum-ratio-transmission (MRT) update at the BS and an optimal FRIS-configuration update. p. 0

Where the paper says it

The resulting design couples the multi-antenna base-station (BS) beamformer with combinatorial FRIS port selection and discrete phase assignment, leading to a highly nonconvex mixed discrete optimization. To address this challenge, we develop an alternating-optimization (AO) framework that alternates between a closed-form maximum-ratio-transmission (MRT) update at the BS and an optimal FRIS-configuration update.

The core of the proposed FRIS configuration is a Minkowski-geometry reformulation of the FRIS codebook superposition by convexifying the feasible reflected-sum set and exploiting supportfunction identities. p. 0
Where the paper says it

To address this challenge, we develop an alternating-optimization (AO) framework that alternates between a closed-form maximum-ratio-transmission (MRT) update at the BS and an optimal FRIS-configuration update. The key step of the proposed FRIS configuration is a Minkowski-geometry reformulation of the FRIS codebook superposition: by convexifying the feasible reflected-sum set and exploiting supportfunction identities, we convert the FRIS subproblem into a onedimensional maximization over a directional parameter.

This conversion transforms the FRIS subproblem into a one-dimensional maximization over a directional parameter. p. 1
Where the paper says it

• Minkowski-geometry reformulation and an optimal FRIS-update subroutine: To tackle the above coupling, we develop a convex-geometry-based FRIS optimization principle by representing the feasible reflected-sum as a union of Minkowski sums and then convexifying it without loss of optimality. By leveraging support-function identities, we transform the FRIS configuration subproblem into a one-dimensional maximization over a directional parameter.

Geometric Optimization of Port Selection

The problem is reduced to maximizing the magnitude of the effective channel coefficient, which is equivalent to maximizing a function over a set defined by Minkowski sums and convex hulls. This maximization is achieved through several steps:

  1. Equality (a) shows that max z in ZMo,tz equals max z in PMo,tz, meaning convexifying the feasible reflected-sum set does not alter the optimal beamforming gain. p. 4

    Where the paper says it

    ■ Lemma 1 implies that convexifying the feasible reflectedsum set does not alter the optimal beamforming gain, i. , the maximum achievable magnitude is always attained on the boundary of the convex hull, allowing the original discrete and nonconvex optimization over ZMo,t to be equivalently solved over its convex hull PMo,t without any loss of optimality.

  2. The norm maximization is transformed into a one-dimensional search over a directional parameter ϕ via support functions. p. 1

    Where the paper says it

    • Minkowski-geometry reformulation and an optimal FRIS-update subroutine: To tackle the above coupling, we develop a convex-geometry-based FRIS optimization principle by representing the feasible reflected-sum as a union of Minkowski sums and then convexifying it without loss of optimality. By leveraging support-function identities, we transform the FRIS configuration subproblem into a one-dimensional maximization over a directional parameter.

  3. The support function hPMo,t (e jϕ) decomposes into the direct link contribution and a term involving the sum of per-port scores. p. 4

    Where the paper says it

    (27) By (22), the support function decomposes as hPMo,t (u) = h{d}(u)+hPMo (u) = ℜ{u ∗ d}+hPMo (u), (28) and setting u = e jϕ yields hPMo,t (e jϕ) = ℜ{e −jϕd} + hPMo (e jϕ). (29) Note that the direct link contributes an additive directional term that depends only on ϕ and does not couple across ports.

Specialization for Regular Codebooks

For the practically important regular Mp-gon phase-shifter codebook, closed-form expressions for per-port directional scores are derived, establishing a piecewise-smooth structure of the resulting support function. This structure enables a finite candidate-angle search that provably identifies the global optimum without exhaustive angular sweeping. p. 1

Where the paper says it

As a result, the proposed framework reveals a fundamental geometric structure underlying FRIS signal combining and enables an optimal, fully constructive configuration via support-function maximization. In particular, for the practically important regular Mp-gon phase-shifter codebook, this structure further leads to closed-form per-port scoring and a finite candidate-angle search that provably identifies the global optimum without exhaustive angular sweeping.

The optimal FRIS configuration is found by evaluating a finite set of critical angles, which avoids generic one-dimensional search. p. 2
Where the paper says it

Moreover, this specialization reveals a piecewise-smooth structure of the resulting support function, which enables a finite candidate-angle maximization procedure that avoids exhaustive one-dimensional search while provably identifying the global optimum. • AO framework with closed-form MRT update and monotonic convergence: Building on the above FRISupdate subroutine, we develop an AO framework that alternates between a closed-form MRT beamformer update, and an optimal FRIS configuration update that solves the discrete port-selection and phase-quantization step via the proposed support-function maximization.

Performance and Complexity Analysis

Simulation results demonstrate that the proposed framework consistently outperforms conventional baselines, achieving near-optimal beamforming gains in exhaustive search validations. The AO algorithm converges rapidly within a few iterations, implying that the required iteration count is typically very small. p. 2

Where the paper says it

In addition, the results explicitly illustrate how the optimal FRIS configuration is determined through the proposed support-function-based directional search, validating the effectiveness of the one-dimensional phase optimization procedure. Finally, convergence plots verify that the AO algorithm saturates within only a few iterations, implying that the required iteration count is typically very small, so that the practical computational burden is mainly governed by the structural system parameters rather than by iterative convergence.

The computational complexity scales as O(T MN + Nϕ X M m=1Wm+M) for general codebooks and simplifies to O(T MN + M2Mp) for regular Mp-gon codebooks. p. 9
Where the paper says it

Combining the above steps, the overall computational complexity after T AO iterations is given by O T MN + Nϕ X M m=1 |Wm|+M ! (63) 2) Complexity Implication for Regular Mp-gon Codebooks: In the practically case of a regular Mp-gon codebook, as a function of ϕ, sm(ϕ) is piecewise cosine, where its maximizing codeword changes at (51) with at most 2Mp breakpoint angles over [0, 2π), and the total number of breakpoints across all M ports scales as Nϕ = O(MMp).

This confirms the scalability and efficiency of the proposed design. p. 9
Where the paper says it

(64) As demonstrated in Section VIII, the AO framework converges within only a few iterations, with T typically being much smaller than both M and Nϕ. Therefore, the practical computational burden of the proposed algorithm is primarily governed by the structural system parameters M, N, Mp, and Nϕ, rather than by iterative convergence, confirming the scalability and efficiency of the proposed design.

Conclusion

The paper proposes a principled framework for beamforming-gain maximization in FRIS-assisted downlink systems under multi-antenna BS and practical finite-resolution phase constraints. By exploiting the geometric structure of the reflectedsum codebook space, the FRIS subproblem was reduced to a one-dimensional maximization of a support function, enabling efficient configuration via direction-dependent per-port scoring, Top-Mo port selection, and optimal quantized phase assignment. p. 0

Where the paper says it

The key step of the proposed FRIS configuration is a Minkowski-geometry reformulation of the FRIS codebook superposition: by convexifying the feasible reflected-sum set and exploiting supportfunction identities, we convert the FRIS subproblem into a onedimensional maximization over a directional parameter. For each direction, the optimal configuration is obtained constructively via per-port directional scoring, Top-Mo port selection, and optimal codeword assignment.

The framework provides an efficient and geometry-driven solution for FRISaided wireless networks. p. 0
Where the paper says it

Index Terms—Fluid reconfigurable intelligent surface (FRIS), Minkowski sum, convex geometry, alternating optimization. INTRODUCTION T HE continuing evolution of wireless communications is being accelerated by an unprecedented demand for extremely high data rates, ultra-reliable transmission, and lowlatency connectivity, driven by the proliferation of dataintensive and latency-critical services [1]–[4].

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. The AI system can implement an alternating optimization framework that alternates between a closed-form maximum ratio transmission update at the base station and an optimal fluid reconfigurable intelligent surface configuration update using a Minkowski geometry reformulation.

  2. The system can solve highly nonconvex mixed discrete optimization problems by transforming the FRIS configuration subproblem into a one-dimensional maximization over a directional parameter, which is then solved constructively via per-port directional scoring, Top-Mo port selection, and optimal codeword assignment.

  3. For regular Mp-gon phase shifters, the system can utilize closed form expressions for per port directional scores and establish a piecewise smooth structure of the resulting support function to enable a finite candidate angle search that provably identifies the global optimum without exhaustive angular sweeping.

  4. The AI system can converge rapidly within a few alternating optimization iterations by leveraging monotonic convergence properties derived from alternating optimization, meaning the practical computational burden is mainly governed by structural system parameters rather than iterative convergence.

  5. The system can perform beamforming gain maximization while accounting for practical hardware constraints, such as finite resolution unit-modulus phase coefficients, leading to a principled AO design with fast convergence and low effective complexity.

Abstract

This paper studies joint beamforming and configuration optimization for a fluid reconfigurable intelligent surface (FRIS)-assisted downlink system with port selection and finite-resolution phase shifts. We develop an alternating-optimization (AO) framework that combines a closed-form maximum-ratio transmission update with a globally optimal FRIS update for a fixed beamformer, and converges monotonically within finitely many iterations. The key idea is to represent the feasible reflected-signal set as a union of Minkowski sums over port subsets and to characterize its maximum magnitude through support functions. This reduces the FRIS subproblem to a one-dimensional directional search, in which the optimal configuration is obtained by selecting the ports with the largest direction-dependent scores together with their best phase codewords. For uniformly quantized phase codebooks, closed-form scores and a finite set of critical angles are derived, identifying the global optimum with near-quadratic complexity. Numerical results demonstrate superior performance over existing benchmarks, near-optimal beamforming gains, robustness to channel uncertainty, and rapid convergence.

Sources

Related papers