WorksComputer Science
Can Reciprocal RIS Perform as Non-Reciprocal RIS?
Abstract
Yes, if and only if some optimal non-reciprocal RIS (i.e., maximizing a given performance metric) makes the round-trip channel transmitter-RIS-transmitter symmetric, which holds if the channel transmitter-RIS has rank one or if single-stream transmission is optimal.
Introduction
Reconfigurable intelligent surface (RIS) has been largely explored as a technology that can enhance wireless communications by shaping the wireless channel [1, 2]. Consider a generic wireless system between transmitting antennas and receiving antennas, as shown in Figure 1(a). The wireless channel with an -element RIS is given by
Figure 1. RIS-aided system with transmitting antennas and receiving antennas where we highlight: (a) the channel from the transmitting to the receiving antennas ; (b) the round-trip channel from the transmitting antennas to themselves ; (c) the round-trip channel from the transmitted streams to themselves .
where is the direct channel between the transmitting and receiving antennas, is the channel between the RIS and the receiving antennas, is the RIS reflection matrix, and is the channel between the transmitting antennas and the RIS [1]. In this system, the transmitting antennas can belong to a single or multiple transmitters, and, similarly, the receiving antennas can belong to a single or multiple receivers. We can control the wireless channel with a RIS by optimizing its reflection matrix , which formally is the scattering matrix of the microwave network implementing the RIS. The reader is referred to [3 Chapter 4] for more details on the physical meaning of a scattering matrix.
Conventionally, RIS has been designed by controlling each element independently through a tunable load [1, 2]. Assuming lossless loads, this design results in a scattering matrix
where , for . Given the structure of this , such RIS design has been denoted as diagonal RIS (D-RIS) [4]. Nevertheless, more general RIS designs are possible, which have a scattering matrix not limited to being diagonal and go under the umbrella term of beyond-diagonal RIS (BD-RIS) [4, 5]. By implementing a RIS with an arbitrary lossless and reciprocal microwave network, it is possible to optimize
This work has been supported in part by UKRI under Grant EP/Y004086/1, EP/X040569/1, EP/Y037197/1, EP/X04047X/1, EP/Y037243/1.
Matteo Nerini and Bruno Clerckx are with the Department of Electrical and Electronic Engineering, Imperial College London, SW7 2AZ London, U.K. (e-mail: [email protected]; [email protected]).
Juan Vidal Alegría is with the Department of Electrical and Information Technology, Lund University, 221 00 Lund, Sweden. (e-mail: [email protected]).
subject to unitary (due to losslessness) and symmetric (due to reciprocity) constraints, i.e.,
which are the most general constraints of a lossless reciprocal RIS [4, 5, 6]. Note that the constraints of a reciprocal RIS in (3) are more general than the constraints of a D-RIS in (2), and therefore a reciprocal RIS performs at least as well as a D-RIS. Even more general RIS designs have been proposed, including the use of non-reciprocal microwave components such as circulators, isolators, and gyrators [6, 7, 8]. In particular, by implementing a RIS with an arbitrary lossless microwave network, is only constrained to be unitary, i.e.,
giving the most general constraints of a lossless non-reciprocal RIS. The terminology non-reciprocal RIS does not mean that the RIS is not reciprocal. It means that the RIS is not required to be reciprocal, i.e., it is not constrained to have a symmetric , consistent with previous literature [6, 7, 8]. Since the constraints of a non-reciprocal RIS in (4) are more general than those of a reciprocal RIS in (3), a non-reciprocal RIS performs at least as well as a reciprocal RIS.
Related literature explored non-reciprocal RIS mainly for uplink-downlink channel reciprocity attacks [8, 9, 10, 11] and for full-duplex systems [12, 13, 14, 15]. In addition, [6] showed that a reciprocal RIS requires more elements than a non-reciprocal one to arbitrarily reconfigure the channel, e.g., for channel orthogonalization. However, non-reciprocal RIS requires non-reciprocal components (e.g., circulators, isolators, and gyrators), which increase hardware complexity. It is therefore essential to understand when this additional complexity brings a performance gain. In this paper, we therefore answer the fundamental question: Can reciprocal RIS perform as non-reciprocal RIS? Our contributions are as follows.
First, we derive a necessary and sufficient condition for reciprocal RIS to perform as non-reciprocal RIS with the same number of elements. This condition states that there must exist an optimal non-reciprocal RIS (i.e., maximizing the considered performance metric) that makes the round-trip channel from the transmitting antennas, via the RIS, back to the transmitting antennas symmetric. We show that, as a consequence of this condition, reciprocal RIS performs as non-reciprocal RIS when the channel from the transmitting antennas to the RIS, or from the RIS to the receiving antennas, has rank one. This includes all single-user single-input single-output (SISO), single-input multiple-output (SIMO), and multiple-input single-output (MISO) systems.
Second, we refine this necessary and sufficient condition under linear precoding, which is not assumed in our first contribution. In this case, symmetry is only required for the round-trip channel seen by the transmitted streams. Since this round-trip channel is a scalar for single-stream transmission, reciprocal RIS performs as non-reciprocal RIS when single-stream transmission is optimal.
The statements of all lemmas, theorems, and corollaries have been formally verified in Lean 4 with the assistance of Claude (Anthropic), and the code is available at: https://github.com/matteonerini/reciprocal-ris.
Reciprocal Versus Non-Reciprocal RIS
In this section, we formally define when reciprocal RIS performs as non-reciprocal RIS, and we derive two lemmas characterizing the operations that each of them can realize.
Let and denote the sets of feasible scattering matrices of a non-reciprocal and a reciprocal RIS, respectively.
To compare these two architectures in any wireless system under any performance metric, we first observe how a RIS affects performance. The transmitted signals reach the RIS only through the channel , and the signals reflected by the RIS reach the receivers only through the channel . Therefore, most, if not all, performance metrics depend on through , through , or through both. In this work, we consider metrics of the form , where can be any real-valued metric, such as capacity, sum-rate, max-min fairness, or energy efficiency, in which all other design variables, such as precoders and combiners, have already been optimized.
For metrics of the form , all results of this work hold with replaced by , since and both and are closed under transposition. Metrics depending on , such as any function of the channel , are of both forms, so all results of this work apply to them both as they are and with replaced by . Note that metrics that are functions of but not of the whole are rare but exist. For example, in a two-operator system [16], a RIS controlled by one operator must not alter the channels of the other operator, imposing a fixed in [16 Equation (2)]. These constraints involve but not the whole .
We assume that the maximum of the considered metric over is attained, which holds, e.g., when the metric is continuous, since is compact. Since , a non-reciprocal RIS always performs at least as well as a reciprocal RIS. We are interested in when a reciprocal RIS is enough to achieve optimal performance, as formalized by the following definition.
Definition 1. We say that reciprocal RIS performs as non-reciprocal RIS when there exists such that
Definition 1 suggests a simple strategy to verify whether reciprocal RIS can perform as non-reciprocal RIS. Let be an optimal non-reciprocal RIS, i.e., a solution to the right-hand side of Eq. (5). Since depends on only through the matrix , if a reciprocal RIS can produce the same matrix, i.e., , then it achieves optimal performance, and (5) holds. Therefore, comparing reciprocal and non-reciprocal RIS reduces to answering the following question: which matrices can be produced with , and which with ? We answer this question for non-reciprocal RIS in Lemma 1 and for reciprocal RIS in Lemma 2.
Lemma 1. Let . There exists such that if and only if
Proof. Although Lemma 1 is a classical result [17 Theorem 7.3.11], we report its proof for completeness, as its structure is mirrored in the proof of Lemma 2.
Necessity. If with , then .
Sufficiency. We show that if (6) holds, then it is always possible to construct a unitary such that . Let be the rank of and write its singular value decomposition (SVD) as , where and have orthonormal columns and is diagonal with positive entries. Complete to an unitary matrix .
Step 1 (introduce a unitary W). Define . We have
where (a) follows from , (b) follows from , and (c) follows from . Therefore, has orthonormal columns, and we can complete it to an unitary matrix .
Step 2 (construct a unitary ). Define
which is unitary as a product of unitary matrices.
Step 3 (verify that ). Since and , we have
It remains to show . Let , so that . Using , we obtain
Hence , which gives . □
Lemma 1 states that a unitary can map the columns of to the columns of if and only if all their norms and inner products are preserved, i.e., , for . For , condition (6) reduces to . Hence, a unitary can map any vector to any vector with the same norm. For , it is instructive to consider the case where the columns of are orthogonal, so that is diagonal. In this case, (6) holds if and only if the columns of are also orthogonal and for . Hence, a unitary can map an arbitrary set of orthogonal vectors to an arbitrary set of orthogonal vectors with the same norms. We now show how this flexibility is reduced when is also required to be symmetric.
Lemma 2. Let . There exists such that if and only if
Proof. This lemma implicitly appears in the proof of [18 Theorem 2] (see [18 Section IV-B]). Here, we report a self-contained proof that constructs a solving , similar to the proof of Lemma 1.
Necessity. If with , then . If, in addition, , then is symmetric.
Sufficiency. We show that if (16) holds, then it is always possible to construct a symmetric unitary such that . To this end, we exploit the fact that also implies when is symmetric unitary, since . We therefore construct a symmetric unitary satisfying both equations at once, i.e., , where , . Let be the rank of and write its SVD as , where and have orthonormal columns and is diagonal with positive entries. Complete to an unitary matrix . Introducing the symmetric permutation matrix
we have
From the definitions of and , if (16) holds, we have
Substituting the SVD expressions of and into (19) gives
Step 1 (introduce a symmetric unitary ). Define the matrices
is symmetric because is symmetric. In the following, we show that is symmetric unitary. Multiplying (20) by on the left and by on the right gives . Multiplying it on the left by and on the right by yields , showing that is symmetric. Furthermore, multiplying (20) by on the left and by on the right gives . Thus, , proving that is unitary.
Step 2 (construct a symmetric unitary ). Define
which is unitary as a product of unitary matrices, and symmetric because the middle matrix is symmetric and .
Step 3 (verify that ). Since , we have
It remains to show . Let , so that . Using (19), we get . Hence, , which gives . We have finally obtained , whose first columns are . □
Lemma 2 states that has a symmetric unitary solution if and only if it satisfies, in addition to (16a), also the symmetry condition (16b), i.e., , for . For , condition (16a) reduces to , and (16b) is a scalar identity that always holds. Hence, a symmetric unitary can map any vector to any vector with the same norm, exactly as a unitary . For , (16b) imposes additional constraints. Therefore, unlike a unitary , a symmetric unitary cannot map an arbitrary set of orthogonal vectors to an arbitrary set of orthogonal vectors with the same norms.
A Necessary and Sufficient Condition
In this section, we derive a necessary and sufficient condition under which reciprocal RIS performs as non-reciprocal RIS.
Notice that reciprocal RIS performs as non-reciprocal RIS when it can reproduce the matrix produced by an optimal non-reciprocal RIS . Lemma 2 states when this is possible. Introducing and , condition (16a) is always satisfied since is unitary. Therefore, the only obstacle for a reciprocal RIS is condition (16b), which requires to be symmetric. This observation is formalized in the following theorem.
Theorem 1. Reciprocal RIS performs as non-reciprocal RIS if and only if there exists an optimal non-reciprocal RIS for which is symmetric.
Proof. Necessity. If (5) holds, is an optimal non-reciprocal RIS (since ), and is symmetric because is.
Sufficiency. Assume there exists an optimal non-reciprocal RIS such that is symmetric. We show that a reciprocal RIS can produce the same matrix , and therefore achieve optimal performance. To this end, consider and . Since is unitary, we have . In addition, is symmetric. Therefore, by Lemma 2, there exists a reciprocal RIS such that , achieving optimal performance.
Theorem 1 can be physically interpreted as follows. Since is the channel from the RIS back to the transmitting antennas, is the round-trip channel from the transmitting antennas, via the RIS, back to the transmitting antennas, as shown in Figure 1(b). Its th entry is the channel from the th to the th transmitting antenna via the RIS, so its symmetry means that this channel is the same in both directions, i.e., the round-trip channel is reciprocal. A reciprocal RIS can never break this reciprocity, and Theorem 1 shows that this is the only limitation of reciprocal RIS that matters. In other words, reciprocal RIS performs as non-reciprocal RIS if and only if optimal performance does not require breaking the reciprocity of this round-trip channel. Note that for metrics of the form , an analogous result holds with in place of , i.e., the round-trip channel from the receiving antennas, via the RIS, back to the receiving antennas. For metrics that are functions of , which are of both forms and , either of the two conditions can be equivalently used.
A notable case where the round-trip channel is always symmetric is when has rank one, as stated in the following corollary.
Corollary 1. If , then reciprocal RIS performs as non-reciprocal RIS.
Proof. If , we have for some and , so that
where follows from being a scalar. Since is symmetric, this corollary follows from Theorem 1. □
Corollary 1 includes all systems with a single transmitting antenna (), regardless of the number of receiving antennas. It also includes all systems where all transmitting antennas belong to one device in line-of-sight (LoS) and far-field conditions with the RIS, since is then the outer product of the steering vectors of the RIS and of the device. Similarly, for metrics of the form , the same holds if , e.g., with a single receiving antenna () or a single receiving device in LoS and far-field conditions with the RIS. For metrics that are functions of , reciprocal RIS performs as non-reciprocal RIS if either or has rank one. Hence, single-user SISO, SIMO, and MISO systems never benefit from non-reciprocal RIS.
A Necessary and Sufficient Condition in the Presence of Precoding
In this section, we refine the condition in Theorem 1 by accounting for the transmitter precoder.
Consider a transmitted signal , where contains symbols (data streams) and is the precoder, with being the set of feasible precoders, e.g., satisfying a power constraint. Since the received signal is , we consider metrics that depend on through . We therefore write them as , where is real-valued and can also depend on directly, e.g., through . We assume that the maximum of the metric over is attained, which holds, e.g., when is continuous and is compact.
Definition 2. We say that reciprocal RIS performs as non-reciprocal RIS in the presence of precoding when there exists a pair such that
Note that a reciprocal RIS now only needs to reproduce the matrix produced by an optimal pair of non-reciprocal RIS and precoder , rather than the whole matrix . This leads to the following necessary and sufficient condition, which is weaker than the one in Theorem 1.
Theorem 2. Reciprocal RIS performs as non-reciprocal RIS in the presence of precoding if and only if there exists an optimal pair of non-reciprocal RIS and precoder for which is symmetric.
Proof. Necessity. If (25) holds, is an optimal pair for the non-reciprocal RIS problem (since ), and is symmetric because is.
Sufficiency. Assume there exists an optimal pair of the non-reciprocal RIS problem such that is symmetric. We show that a reciprocal RIS can produce the same , and therefore achieve optimal performance with the same precoder. To this end, consider and . Since is unitary, we have . In addition, is symmetric. Therefore, by Lemma 2, there exists a reciprocal RIS such that . The pair is feasible for the reciprocal RIS problem and achieves optimal performance.
The condition in Theorem 2 involves the round-trip channel seen by the transmitted streams, i.e., from the streams, via the RIS, back to the streams, as shown in Figure 1(c). This is weaker than the condition in Theorem 1, since is symmetric whenever is symmetric, but not vice versa. Thus, a reciprocal RIS only needs to preserve the reciprocity of the round-trip channel along the directions actually used for transmission. Similarly, if the receiving antennas use a combiner , Theorem 2 holds with in place of .
A notable case where the condition of Theorem 2 always holds is single-stream transmission, as stated in the following.
Corollary 2. If single-stream transmission () is optimal with non-reciprocal RIS, then reciprocal RIS performs as non-reciprocal RIS.
Proof. Since is a scalar for , and therefore symmetric, this corollary follows from Theorem 2.
Corollary 2 extends Corollary 1 to systems where and have arbitrary rank but only one stream is transmitted. This includes, for example, single-user multiple-input multiple-output (MIMO) systems at low signal-to-noise ratio (SNR) and multi-user MISO systems maximizing the sum-power, where transmission over the dominant channel eigenmode is optimal. In addition, this also includes multi-user MISO systems maximizing the sum-rate at low SNR, where only the strongest user is served. In these systems, reciprocal RIS performs as non-reciprocal RIS, consistent with the optimal reciprocal RIS solutions derived for single-stream systems in [19, 20].
Conclusion
We have answered the question of whether reciprocal RIS can perform as non-reciprocal RIS. This happens if and only if there exists an optimal non-reciprocal RIS that makes the round-trip channel from the transmitting antennas, via the RIS, back to the transmitting antennas symmetric. When the precoder is taken into account, this condition only needs to hold for the round-trip channel seen by the transmitted streams. As a result, reciprocal RIS performs as non-reciprocal RIS when the channel from the transmitting antennas to the RIS has rank one or when single-stream transmission is optimal. In these systems, the additional hardware complexity of non-reciprocal RIS brings no performance gain.
Conversely, non-reciprocal RIS is beneficial when optimal performance requires breaking the reciprocity of the round-trip channel. The clearest example is a full-duplex system, where a base station simultaneously receives from an uplink user and transmits to a downlink user located in a different direction, both via the RIS [12, 13, 14, 15]. Here, a reciprocal RIS forces the channel from the uplink user to the base station to be equal to the reverse one, while optimal performance requires the former to be strong and the latter weak, since the base station signal should be reflected towards the downlink user. More generally, non-reciprocal RIS is expected to be beneficial when numerous streams are transmitted through well-conditioned channels [6], e.g., when the RIS serves multiple transmitters and receivers in different directions, or in rich scattering environments.
References
- [1]Q. Wu, S. Zhang, B. Zheng, C. You, and R. Zhang, “Intelligent reflecting surface-aided wireless communications: A tutorial,” IEEE Trans. Commun., vol. 69, no. 5, pp. 3313–3351, 2021.arxiv.org/abs/2007.02759
- [2]S. Zhang and R. Zhang, “Capacity characterization for intelligent reflecting surface aided MIMO communication,” IEEE J. Sel. Areas Commun., vol. 38, no. 8, pp. 1823–1838, 2020.arxiv.org/abs/1910.01573
- [3]D. M. Pozar, Microwave Engineering. John wiley & sons, 2011.
- [4]H. Li, M. Nerini, S. Shen, and B. Clerckx, “A tutorial on beyond-diagonal reconfigurable intelligent surfaces: Modeling, architectures, system design and optimizations, and applications,” IEEE Commun. Surv. Tutor., vol. 28, pp. 4086–4126, 2026.arxiv.org/abs/2505.16504
- [5]S. Shen, B. Clerckx, and R. Murch, “Modeling and architecture design of reconfigurable intelligent surfaces using scattering parameter network analysis,” IEEE Trans. Wireless Commun., vol. 21, no. 2, pp. 1229–1243, 2022.DOI
- [6]J. V. Alegría, J. Thunberg, and O. Edfors, “Channel orthogonalization with reconfigurable surfaces: General models, theoretical limits, and effective configuration,” IEEE Trans. Wireless Commun., vol. 24, no. 6, pp. 5179–5195, 2025.
- [7]G. Bartoli, A. Abrardo, N. Decarli, D. Dardari, and M. Di Renzo, “Spatial multiplexing in near field MIMO channels with reconfigurable intelligent surfaces,” IET Signal Process., vol. 17, no. 3, p. e12195, 2023.arxiv.org/abs/2212.11057
- [8]J. Xu, H. Wang, R. Liu, J. A. Nossek, and A. L. Swindlehurst, “Non-reciprocal reconfigurable intelligent surfaces,” IEEE Wireless Commun. Lett., vol. 14, no. 10, pp. 3329–3333, 2025.arxiv.org/abs/2411.15617
- [9]H. Wang, Z. Han, and A. L. Swindlehurst, “Channel reciprocity attacks using intelligent surfaces with non-diagonal phase shifts,” IEEE Open J. Commun. Soc., vol. 5, pp. 1469–1485, 2024.arxiv.org/abs/2309.11665
- [10]H. Wang, J. Hu, J. Xu, Y. Ju, and A. L. Swindlehurst, “DRL-based mitigation against nonreciprocal RIS-aided channel reciprocity attacks,” in ICC 2026 - IEEE International Conference on Communications, 2026.DOI
- [11]H. Wang, J. Hu, J. Xu, Y. Ju, and A. L. Swindlehurst, “Nonreciprocal RIS-aided covert channel reciprocity attacks and countermeasures,” arXiv preprint arXiv:2509.11117, 2025.arxiv.org/abs/2509.11117
- [12]H. Li and B. Clerckx, “Non-reciprocal beyond diagonal RIS: Multiport network models and performance benefits in full-duplex systems,” IEEE Trans. Commun., vol. 73, no. 11, pp. 12211–12234, 2025.arxiv.org/abs/2411.04370
- [13]Z. Liu, H. Li, and B. Clerckx, “Non-reciprocal beyond diagonal RIS: Sum-rate maximization in full-duplex communications,” IEEE Trans. Commun., vol. 74, pp. 5169–5183, 2026.arxiv.org/abs/2411.18523
- [14]Z. Liu and B. Clerckx, “A secure full-duplex wireless circulator enabled by non-reciprocal beyond-diagonal RIS,” IEEE J. Sel. Areas Commun., vol. 44, pp. 3750–3765, 2026.arxiv.org/abs/2507.23381
- [15]Z. Liu, W. Shin, and B. Clerckx, “Enabling full-duplex LEO satellite systems with non-reciprocal BD-RIS-assisted beamforming,” IEEE Trans. Wireless Commun., vol. 25, pp. 15459–15473, 2026.arxiv.org/abs/2511.22525
- [16]Z. Wu, M. Nerini, and B. Clerckx, “RIS optimization and scaling laws in multi-operator systems: Is quadratic scaling achievable?” arXiv preprint arXiv:2605.01389, 2026.arxiv.org/abs/2605.01389
- [17]R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge University Press, 2012.
- [18]Z. Wu and B. Clerckx, “Beyond-diagonal RIS in multiuser MIMO: Graph theoretic modeling and optimal architectures with low complexity,” IEEE Trans. Inf. Theory, vol. 71, no. 11, pp. 8506–8523, 2025.arxiv.org/abs/2502.16509
- [19]M. Nerini, S. Shen, and B. Clerckx, “Closed-form global optimization of beyond diagonal reconfigurable intelligent surfaces,” IEEE Trans. Wireless Commun., vol. 23, no. 2, pp. 1037–1051, 2024.arxiv.org/abs/2211.06117
- [20]I. Santamaria, M. Soleymani, E. Jorswieck, and J. Gutiérrez, “SNR maximization in beyond diagonal RIS-assisted single and multiple antenna links,” IEEE Signal Process. Lett., vol. 30, pp. 923–926, 2023.DOI
