Next Article in Journal
Grating Structures for Silver-Based Surface Plasmon Resonance Sensors with Adjustable Excitation Angle
Previous Article in Journal
Concurrent Validity Evidence for Pressure-Sensing Walkways Measuring Spatiotemporal Features of Gait: A Systematic Review and Meta-Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Bilayer Intelligent Omni-Surface-Assisted Full-Duplex Systems: Simultaneous Self-Interference Cancellation and Sum Rate Maximization

School of Information Science and Technology, Fudan University, Shanghai 200433, China
*
Author to whom correspondence should be addressed.
Sensors 2024, 24(14), 4535; https://doi.org/10.3390/s24144535
Submission received: 14 June 2024 / Revised: 4 July 2024 / Accepted: 11 July 2024 / Published: 13 July 2024
(This article belongs to the Section Communications)

Abstract

:
Recently, reconfigurable intelligent surfaces (RISs) have attracted increasing attentions in the design of full-duplex (FD) systems due to their novel capability of propagation environment reconfiguration. However, in conventional RIS-assisted FD systems, the beamforming for self-interference cancellation (SIC) and sum rate maximization (SRM) are highly coupled during RIS optimization, which significantly degrades the system performance. To tackle this issue, we exploit a novel bilayer intelligent omni-surface (BIOS) structure in FD systems. Compared with the conventional RIS designs, the BIOS provides independent beams on both sides, thus enabling more flexible achievement of SRM and SIC. For the BIOS-assisted FD system, we first formulate an optimization problem to achieve SRM and efficient SIC simultaneously. Then, we exploit the relationship between the SRM and mean square error (MSE), and propose a weighted MSE minimization with SIC algorithm to solve the problem. Specifically, we jointly design the beamforming at the base station and the BIOS with manifold optimization while guaranteeing an SIC constraint. Furthermore, we theoretically derive a lower band for the BIOS size required for efficient SIC in FD systems. Simulation results indicate that the BIOS outperforms the conventional RIS designs in FD systems, and verify the accuracy of the derived lower bound for the BIOS size.

1. Introduction

With the explosive growth of wireless communication devices, the scarcity of available spectrum resources has become increasingly acute. Consequently, effectively utilizing existing spectrum resources has emerged as a pivotal factor in advancing wireless communication technology [1,2,3]. Recently, in-band full-duplex (FD) systems have drawn notable interest in the design of next-generation wireless communication systems due to their capability of transmitting and receiving data on the same frequency band concurrently. Compared to traditional half-duplex (HD) systems, such as time division duplex or frequency division duplex, FD systems can significantly enhance spectrum utilization and reduce the time delay of wireless communication systems [4,5]. Additionally, FD systems can significantly improve confidentiality while maintaining the same data rate [4]. Therefore, FD technology is critical for communication in ultra-dense network environments in the future.
Despite the advantages mentioned above, a prominent problem in FD systems is the inevitable self-interference (SI) emanating from the transmitter to the receiver, as its high intensity significantly interferes with uplink (UL) signals. To tackle this issue, three typical categories of SI cancellation (SIC) methods are discussed in the literature: transmission-domain processing, analog-domain processing, and digital-domain signal processing [4]. The transmission-domain SIC scheme involves suppressing SI through hardware design, such as physical isolation, shielding materials, and antennas with different polarization directions, thereby minimizing the power of SI signals before they reach the receiver [6,7,8]. The analog-domain SIC scheme focuses on suppressing SI in the radio frequency (RF) chain by adding isolators or designing circuits to generate signals that counteract the SI signals [9,10,11,12,13]. In [9], the authors added an additional RF chain at the transmitter, connected to the receiver. They estimated the SI channel and used the results to digitally preprocess the transmitted signal, generating a counteracting signal with the same amplitude but opposite phase to the SI, thus canceling it at the receiver. Similarly, in [10], an active RF chain was utilized to generate a signal compensating for the inevitable leakage from passive analog SIC. The digital-domain SIC scheme employs digital signal processing techniques on baseband signals to cancel residual SI, exploiting the spatial degrees of freedom provided by multi-antenna systems. Typically, digital SIC methods involve beamforming techniques such as zero-forcing (ZF), minimum mean square error (MMSE), and least squares [14,15,16,17]. In [14], the authors used ZF precoding at the transmitter and maximum ratio combining at the receiver to effectively cancel SI. In [15], the authors employed the MMSE algorithm to jointly design transmitting and receiving beamforming, aiming to minimize the mean square error (MSE) and reduce the SI. However, despite numerous attempts, these SIC methods come with high hardware expenses, substantial complexity, and constrained performance. Thus, the reconfigurable intelligent surface (RIS) is considered a promising technology and has attracted increasing attention in the design of FD systems. Specifically, RIS is a two-dimensional (2D) metasurface consisting of programmable, low-cost, and passive elements [18,19]. Due to its flexibility and low-cost nature, RIS has been extensively applied in wireless communication systems [20,21,22,23,24].
For the FD systems, RIS has been proven a promising technology to tackle the SIC and thus is widely investigated in the literature [25,26,27,28,29]. In [26], intelligent reflecting surface (IRS), as the most famous type of RIS, was exploited in FD systems to achieve efficient SIC. Specifically, the IRS smartly reconfigured the cascade signal emitted from the base station (BS) transmitter ( BS Tx ) to the IRS and then reflected to the BS receiver ( BS Rx ) to create destructive interference with the SI signal. Moreover, taking into account the quantization noise of analog-to-digital converters (ADCs), the authors of [27] considered a more practical scenario and proposed to jointly design the downlink (DL) precoding matrix and the IRS coefficients. However, due to hardware limitations, the IRS can only reflect the signal back to the same side [30]. Therefore, it can only service user equipment (UE) on the same side of the BS. To tackle this constraint, the authors of [28] first introduced intelligent omni-surface (IOS) to FD systems, which is named simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) in some studies [31]. Compared with the IRS, the IOS can simultaneously reflect and refract the incident signal to both sides [30,31]. Thus, it can extend the wireless coverage to the full space while suppressing the SI signal in FD systems.
Although previous studies have focused on the performance of RIS-assisted FD systems, there remains a notable gap in the literature regarding the simultaneous SIC and sum rate maximization (SRM) of DL and UL. Ref. [28] only addressed SI constraints targeting DL rate optimization, while [25] assumed perfect SIC when maximizing the sum rate (SR). However, minimizing the residual SI is crucial for effective air interface SIC as excessive SI will lead to the saturation of ADCs, preventing it from functioning properly [7]. Thus, it is necessary to investigate beamforming optimization for the SRM under practical SI constraints in RIS-assisted FD systems. Moreover, it is notable that although current IOS models offer both reflection and refraction capabilities, they cannot independently adjust reflecting and refracting phase shifts [30,31,32]. This limitation results in coupled beamforming on both sides, which leads to a serious performance loss in the FD system as the IOS is expected to simultaneously suppress the SI signal and enhance the system data rate.
To deal with these issues, in this paper, we introduce a novel bilayer intelligent omni-surface (BIOS) structure to simultaneously suppress the SI and enhance the system SR in FD systems. This BIOS structure deploys two neighboring IOS layers, and thus can ensure independent beamforming design on both sides [33]. Unlike [33], which utilizes both reflected and refracted beams for communication, our design employs the reflected signals for SIC and the refracted signal for communication, thus achieving both objectives simultaneously. Our approach is grounded in a practical scenario that considers the power constraint of the SI signal. The main contributions are summarized as follows:
  • We introduce a novel BIOS in a multi-user FD system. With the unique bilayer structure, the BIOS can provide flexible beamforming on both sides and thus can simultaneously improve the SR and cancel the SI more effectively than the conventional RIS designs.
  • For the BIOS-assisted multi-user FD system, we jointly optimize the beamforming at the BS and BIOS to maximize the SR of UL and DL. We ensure effective over-the-air SIC by constraining the residual SI power below a threshold, marking a distinct approach from that of other studies. To solve this problem, we establish the proof of equivalence between the SRM and a weighted MSE minimization (WMMSE) and then propose a novel SIC-WMMSE algorithm.
  • To further guide the practical deployment of BIOS-assisted FD systems, we theoretically derive a lower bound of the BIOS size required for efficient SIC, which is proven to be quite close to the accurate size required in practical systems.
  • We provide simulation results to show that the BIOS-assisted FD system significantly outperforms that of the conventional IOS due to its capability of independent beamforming on both sides.
Notations: Matrices and vectors are denoted by boldface upper case and boldface lower case, respectively. ( · ) T , ( · ) H , ( · ) 1 , and ( · ) * , respectively, denote the transpose, Hermitian transpose, inverse, and conjugate. [ · ] i j and [ · ] i denote the ( i , j ) -th element of a matrix and the i-th element of a vector. C M × N denotes the space of M × N complex-valued matrices. The trace, l 1 norm, and Frobenius norm are denoted by Tr ( · ) , | · | 1 , and  · F , respectively. R { · } and E ( · ) , respectively, denote the real-part and expectation operation. ∘ denotes Hadamard products. Furthermore, I N denotes the N × N identity matrix. diag ( a ) is a diagonal matrix with the elements of a on its main diagonal and diag ( A ) represents the extraction of the diagonal of A . CN ( 0 , K ) denotes the circularly symmetric complex Gaussian distribution with zero mean and covariance matrix K .

2. System Model and Problem Formulation

2.1. BIOS Structure

As mentioned in Section 1, hardware limitations prevent IOS from independently controlling the phases of refracted and reflected signals, resulting in symmetric beams on both sides. However, in the proposed FD system, we aim to utilize the reflected signals to cancel SI and for the refracted signals to communicate. Thus, the symmetric beams will degrade the system performance. Specifically, the cascaded reflected signal, which is emitted from the BS Tx into the IOS and then reflected to the BS Rx , serves exclusively for SIC while the refracted signals aim to maximize SR. Moreover, refraction beamforming must align DL signals with the DL UEs and enhance UL reception, complicating the optimization problem due to increased coupling and non-convexity. Consequently, performance trade-offs are necessary to find an optimal balance.
To mitigate the constraints, we propose a BIOS-assisted FD system as shown in Figure 1, which can achieve simultaneous SIC and SRM by flexibly controlling the reflection and refraction beams on both sides of the BIOS [33,34]. The BIOS consists of two neighboring IOSs (referred to as IOS 1 and IOS 2 ). Situated proximately to the BS, IOS 1 functions like a traditional IOS, managing both reflection and refraction, while IOS 2 is set to the full-transmitting mode. With this arrangement, the reflected cascaded signals can be smartly designed by controlling the IOS 1 to suppress SI signals. Furthermore, the SR can be maximized by independently controlling the reflection and refraction beams on both sides of the BIOS. Thus, the BIOS can achieve the dual-function target of SIC and SRM in FD systems better than the conventional RIS designs. Specifically, compared to traditional IRS, BIOS allows the BS to achieve greater service coverage by reflecting and refracting signals into the full space. Moreover, the capability of independent beamforming on both sides enables separate and effective management for SIC and SRM. Compared to single-layer IOS, the addition of IOS 2 enables independent beams on both sides, allowing for more flexible adjustment. Additionally, compared to multilayer refractive RIS investigated in the previous studies [35,36], the BIOS is distinguished by its specific dual function of simultaneous and decoupled reflection and refraction, which enhances its performance in FD systems.
Without loss of generality, we assume that both IOS 1 and IOS 2 are uniform square planar arrays consisting of M = M y × M z elements, where M y = M z . Thus, the effective reflecting and refracting coefficient matrices of BIOS can be respectively presented as follows:
Φ ^ r = ξ r Φ 1 , Φ ^ t = ϵ t ξ t Φ 2 G Φ 1 ,
where Φ 1 C M × M and Φ 2 C M × M denote the diagonal coefficient matrices of IOS 1 and IOS 2 . ξ r and ξ t are the respective fractions of reflection and refraction signal power relative to the total power of the incoming signal for IOS 1 , satisfying the power constraint ξ r + ξ t = 1 . (Following the assumption in [32], we presume negligible penetration loss for IOS and BIOS. Nevertheless, the penetration loss will be an interesting and important issue that deserves further investigation.) Similarly, ϵ r and ϵ t denote those for IOS 2 with ϵ r + ϵ t = 1 . According to the setup, ϵ r = 0 and ϵ t = 1 . G C M × M denotes the channel between IOS 1 and IOS 2 .

2.2. System Model

Consider a narrowband multi-input single-output (MISO) FD system comprising a BS, a BIOS, K D DL UEs, and  K U UL UEs in Figure 1. We assume that all the UEs are single-antenna, BS Tx employs N T transmit antennas, and BS Rx has N R receive antennas. The BIOS is deployed significantly close to the BS to ensure the reflected signals are strong enough to efficiently suppress the SI signals, so we assume that there is no line-of-sight (LoS) path between the BS and UEs [28].
For this FD system, the DL signal from the BS is denoted as s D = F x D with E { | s D | 2 } = P s . Similarly, F = [ f 1 , , f K D ] C N T × K D denotes the precoder at the BS, x D = x D , 1 , , x D , K D T C K D × 1 denotes the original symbol vector, and  x U , l is the symbol transmitted by the l-th UL UE with the power constraint E { | x U , l | 2 } = P U . The channels between the BS Tx - IOS 1 , BS Tx - BS Rx , BS Rx - IOS 1 , IOS 2 - UE D , k , and IOS 2 - UE U , l are denoted, respectively, as H TB C M × N T , H TR C N R × N T , H BR C M × N R , h D , k C M × 1 , and  h U , l C M × 1 . Therefore, the DL received signal at the k-th DL UE and the UL received signal at the BS Rx can be respectively represented as follows:   
y D , k = ξ t h D , k H Φ 2 G Φ 1 H TB f k x D , k + i = 1 , i k K D ξ t h D , k H Φ 2 G Φ 1 H TB f i x D , i n D , k MU + n D , k ,
y U = ξ t H BR H Φ 1 G H Φ 2 h U , l x U , l + i = 1 , i l K U ξ t H BR H Φ 1 G H Φ 2 h U , i x U , i n U , l MU + H TR + ξ r H BR H Φ 1 H TB i = 1 K D f i x D , i n SI + n U ,
where n D , k MU represents the interference from other DL UEs for the k-th DL UE and n U , l MU represents the interference from other UL UEs for the l-th UL UE. n SI is the SI at the BS. n D , k denotes the Gaussian noise at the k-th DL UE with mean zero and variance σ D 2 , and  n U denotes the noise at the BS satisfying the distribution of n U CN 0 , σ U 2 I .

2.3. Channel Model

Before problem formulation, we first present detailed channel modeling. As the BIOS is deployed at the BS to achieve efficient SIC, H TB , H TR , and  H BR are considered near-field channels without non-line-of-sight (NLoS) paths. Thus, considering the properties of spherical waves, we model the LoS path gain from the n-th receive antenna of BS Tx to the m-th element of IOS 1 as follows [37]:
H TB m , n = a 2 G TB F TB θ m , n r , ϕ m , n r 4 π d m , n 2 exp j 2 π d m , n λ ,
where a is the size of scattering elements, λ is the carrier wavelength, and d m , n is the distance between the n-th antenna of BS Tx and the m-th element of IOS 1 . θ m , n r and ϕ m , n r , respectively, denote the elevation and azimuth angle of the received signal at the m-th element of IOS 1 . Moreover, G TB = 2 and F TB θ , ϕ = cos θ , respectively, denote parameters related to the equivalent antenna gain and the normalized power radiation pattern between BS Tx and IOS 1 .
Similarly, the channel gain of H BR , H TR , and  G can be modeled as follows:
H BR m , n = a 2 G BR F BR θ m , n r , ϕ m , n r 4 π d m , n 2 exp j 2 π d m , n λ ,
H TR m , n = a 2 4 π d m , n 2 exp j 2 π d m , n λ ,
G m , n = a 2 G II F II θ m , n r , ϕ m , n r 4 π d m , n 2 exp j 2 π d m , n λ ,
where G BR = 2 , G II = 1 , F BR ( θ , ϕ ) = | cos θ | , and  F II ( θ , ϕ ) = | cos θ | 2 .
Considering the NLoS paths, h D , k and h U , l can be modeled as Rician channels. Specifically, the channel gain between the k-th DL UE and m-th element of IOS 2 can be modeled as follows:
h D , k m = κ 1 + κ h m LoS + 1 1 + κ h m NLoS ,
h m LoS = α 0 d m d 0 β G UE F UE θ m t , ϕ m t exp j 2 π d m λ ,
h m NLoS = α 0 d m d 0 β G UE F UE θ m t , ϕ m t h m s ,
where κ is the Rician factor. h m LoS and h m NLoS , respectively, denote the LoS and NLoS path gain from the m-th element of IOS 2 to the k-th DL UE. d m denotes the distance between the m-th element of IOS 2 and the k-th DL UE. α 0 denotes the pass loss of the reference distance d 0 with the path loss exponent β . h m 1 , n s CN ( 0 , 1 ) denotes the cumulative effect of a large number of scattered paths. Moreover, G UE = 2 , F UE ( θ , ϕ ) = | cos θ | . Similarly, h U , l can be modeled in the same way.

2.4. Problem Formulation

According to (2) and (3), the data rate of the k-th DL UE can be expressed as
R D , k = log 2 1 + ξ t h D , k H Φ 2 G Φ 1 H TB f k 2 i = 1 , i k K D ξ t h D , k H Φ 2 G Φ 1 H TB f i 2 + σ D 2 .
Similarly, the UL data rate of the l-th UL UE is given by
R U , l = log 2 I + P U H ^ h U , l h U , l H H ^ H j = 1 , j l K U P U H ^ h U , j h U , j H H ^ H + i = 1 K D H SI f i f i H H SI H + σ U 2 I ,
where H ^ = ξ t H BR H Φ 1 G H Φ 2 , H SI = H TR + ξ r H BR H Φ 1 H TB .
In this paper, we jointly optimize the beamforming design at the BS and BIOS to maximize the SR of UL and DL while effectively managing SIC. It is worth noting that excessive residual SI will cause the saturation of ADC, preventing it from functioning properly. However, most of the existing works are based on perfect SIC. To tackle this issue, we take into account the hardware limitations and then impose a constraint to maintain the residual SI power below a threshold, which is different from other papers. Specifically, the problem can be formulated as follows:
max Φ 1 , Φ 2 , F l = 1 K U R U , l + k = 1 K D R D , k
s . t . H SI F F 2 / N R γ ,
Φ 1 i i = Φ 2 j j = 1 , i , j ,
Tr F F H P s .
Constraint (13b) maintains the residual SI power below a threshold to achieve efficient SIC. Constraints (13c) and (13d) result from the constant modulus constraint of the BIOS scattering elements and the power limitation at the BS, respectively.

3. Beamforming Design for BIOS-FD Systems

Problem (13) is difficult to solve directly due to the severely coupled variables and non-convex constraints. Thus, we propose an SIC-WMMSE method to transform the primal problem into an equivalent weighted MSE minimization problem, and then employ alternating optimization (AO) to solve it.

3.1. SIC-WMMSE Approach

Due to the multiple coupled variables and non-convex constraints, problem (13) is difficult to solve directly. However, by leveraging the relationship between MSE and data rate, we convert the primal problem (13) into an equivalent WMMSE problem as follows:
min Φ 1 , Φ 2 , F , a D , k , u D , k , a U , l , u U , l f = k = 1 K D a D , k e D , k log 2 a D , k + l = 1 K U a U , l e U , l log 2 a U , l                   s . t . H SI F F 2 / N R γ , Φ 1 i i = Φ 2 j j = 1 , i , j , Tr F F H P s ,
where a D , k and a U , l are the weighting coefficients for the k-th DL UE and the l-th UL UE, respectively. u D , k * is the receive coefficient at the k-th DL UE and u U , l H is the receive combiner for the l-th UL UE at the BS Rx , respectively. e D , k and e U , l , respectively, denote the MSEs of the k-th DL UE and the l-th UL UE as follows:
e D , k = E u D , k * y D , k x D , k 2 = u D , k * h ^ D , k H f k 1 u D , k * h ^ D , k H f k 1 H + i = 1 i k K D u D , k * u D , k h ^ D , k H f i f i H h ^ D , k + σ D , k 2 u D , k * u D , k = u D , k * u D , k h ^ D , k H F F H h ^ D , k 2 Re u D , k * h ^ D , k H f k + σ D , k 2 u D , k * u D , k + 1 ,
e U , l = E u U , l H y U x U , l 2 = P U u U , l H h ^ U , l 1 u U , l H h ^ U , l 1 H + i = 1 i l K U P U u U , l H h ^ U , i h ^ U , i H u U , l + u U , l H H SI F F H H SI H u U , l + σ U 2 u U , l H I u U , l = u U , l H P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I u U , l 2 P U Re u U , l H l ^ U , l + 1 ,
where h ^ D , k H = ξ t h D , k H Φ 2 G Φ 1 H TB represents the equivalent channel of the k-th DL UE for simplification and H ^ D H = h ^ D , 1 , , h ^ D , K D H . Similarly, h ^ U , l = ξ t H BR H Φ 1 G H Φ 2 h U , l represents the equivalent channel of the l-th UL UE for simplification and H ^ U = h ^ U , 1 , , h ^ U , K U . The proof of the equivalence between problems (13) and (14) can be found in Appendix A. For a more concise representation, problem (14) can be rewritten as follows by transforming the scalars into matrices:
min Φ 1 , Φ 2 , F , U D , A D , U U , A U f = Tr A D E D log det A D + Tr A U E U log det A U                   s . t . H SI F F 2 / N R γ , Φ 1 i i = Φ 2 j j = 1 , i , j , Tr F F H P s ,
where E D = diag e D , 1 , , e D , K D and E U = diag e U , 1 , , e U , K U , respectively, denote diagonal matrices containing the MSEs of each DL and UL UE. A D = diag a D , 1 , , a D , K D and A U = diag a U , 1 , , a U , K U , respectively, denote diagonal matrices containing the weighting coefficients of each DL and UL UE. U D = diag u D , 1 , , u D , K D denotes the diagonal matrix containing the receive coefficients of each DL UE, and  U U = u U , 1 , , u U , K U denotes the matrix containing the receive combiners of each UL UE.
Although we have transformed the SRM problem into an equivalent WMMSE problem (17), it is still difficult to solve it directly due to the highly non-convex constraints. Thus, we propose an efficient way to deal with the residual SI power constraint (13b). Specifically, move the SI suppression term into the objective function with a penalty factor ρ , resulting in a new optimization problem as follows:
min Φ 1 , Φ 2 , F , U D , A D , U U , A U f = Tr A D E D log det A D + Tr A U E U log det A U + ρ ζ                   s . t . Φ 1 i i = Φ 2 j j = 1 , i , j , Tr F F H P s ,
where ζ = 1 N R H SI F F 2 is the power of the SI signal.
In order to facilitate the optimization of each variable, we substitute all variables into objective function (18) to derive a more detailed expression of f, which can be expressed as follows:
f = f D + f U + f SI ,
where
f D = Tr A D E D log det A D = Tr F H H ^ D A D U D H U D H ^ D H F 2 Re Tr A D U D H H ^ D H F + Tr A D σ D U D H U D + Tr A D log 2 A D = Tr ξ t F H H TB H Φ 1 H G H Φ 2 H H D A D U D H U D H D H Φ 2 G Φ 1 H TB F + Tr A D σ D U D H U D 2 Re Tr ξ t A D U D H H D H Φ 2 G Φ 1 H TB F + Tr A D log 2 A D ,
f U = Tr A U E U log det A U = Tr U U A U U U H P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I 2 Re P U Tr H ^ U A U U U H + Tr A U log 2 A U = Tr U U A U U U H ξ t P U H BR H Φ 1 G H Φ 2 H U H U H Φ 2 H G Φ 1 H H BR + H TR + ξ r H BR H Φ 1 H TB F F H H TR + ξ r H RR H Φ 1 H TB H + σ U 2 I 2 Re Tr P U ξ t U U A U H BR H Φ 1 G H Φ 2 H U + Tr A U log 2 A U ,
f SI = ρ N R H TR + ξ r H BR H Φ 1 H TB F 2 = ρ N R Tr H TR + ξ r H BR H Φ 1 H TB H TR + ξ r H BR H Φ 1 H TB H = ρ N R Tr H TR H TR H + ξ r H TR H TB H Φ 1 H H BR + ξ r H BR H Φ 1 H TB H TR H + ξ r H BR H Φ 1 H TB H TB H Φ 1 H H BR .

3.2. Optimize A D , A U , U D , U U with Fixed F , Φ 1 , Φ 2

According to the WMMSE design approach [28] and the derivation in Appendix A, A D , A U , U D , and U U all have closed-form solutions when other variables are fixed, which can be expressed as follows:
a D , k = e D , k 1 = u D , k * u D , k h ^ D , k H F F H h ^ D , k 2 Re u D , k * h ^ D , k H f k + σ D , k 2 u D , k * u D , k + 1 1 ,
u D , k = h ^ D , k H F F H h ^ D , k + σ D , k 2 1 h ^ D , k H f k ,
a U , l = e U , l 1 = u U , l H P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I u U , l 2 P U Re u U , l H h ^ U , l + 1 1 ,
u U , l = P U P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I 1 h ^ U , l .

3.3. Optimize F  with Fixed A D , A U , U D , U U , Φ 1 , Φ 2

When A D , A U , U D , U U , Φ 1 , and  Φ 2 are fixed, problem (18) is reduced into a sub-problem for the optimization of F with the power constraint, which can be rewritten as follows by ignoring constant terms:
min F f ( F ) = Tr U U A U U U H H SI F F H H SI H + Tr F H H ^ D A D U D H U D H ^ D H F 2 Re Tr A D U D H H ^ D H F + ρ N R Tr H SI F F H H SI H s . t . Tr F H F P s .
It can be observed that sub-problem (27) is convex. Thus, with other parameters fixed, the optimal F can be obtained by utilizing the Karush–Kuhn–Tucker (KKT) conditions as
F = F ˜ H ^ D A D U D ,
where F ˜ = ( H SI H U U A U U U H H SI + H ^ D A D U D H U D H ^ D H + ρ N R H SI H H SI + δ I ) 1 . δ is the KKT coefficient whose optimal solution can be obtained through a one-dimensional search based on the power constraint. The follow two subsections focus on the optimization of BIOS, i.e.,  Φ 1 , Φ 2 .

3.4. Optimize Φ 1  with Fixed F , Φ 2 , A D , A U , U D , U U

In this subsection, we will optimize Φ 1 by fixing other variables. By further defining H D = h D , 1 , , h D , K D , H U = h U , 1 , , h ^ U , K U , H ¯ = H U H Φ 2 H G H , F ¯ = H TB F , H fle = H BR U U A U U U H H BR H , and H fra = G H Φ 2 H H D U D A D U D H H D H Φ 2 G , the objective function in (18) related to Φ 1 can be simplified as follows:
min Φ 1 f 1 Φ 1 = 2 Re Tr Φ 1 H ξ r H BR U ¯ U H TR F F ¯ H ξ t P U H BR U U A U H ¯ ξ t G H Φ 2 H U ¯ D F ¯ H + ρ N R ξ r H BR H TR H TB H + Tr ξ t P U Φ 1 H H fle Φ 1 H ¯ H H ¯ + Tr ξ r Φ 1 H H fle Φ 1 F ¯ F ¯ H + Tr ξ t Φ 1 H H fra Φ 1 F ¯ F ¯ H + Tr ρ ξ r N R Φ 1 H H BR H BR H Φ 1 H TB H TB H s . t . Φ 1 i i = 1 , i .
Due to the constant modulus constraint of BIOS, sub-problem (29) remains highly non-convex. Thus, we propose to apply the manifold optimization (MO) algorithm to address this challenge. Similar to the gradient descent method, the MO algorithm aims to find the most rapid descent direction on the manifold which also minimally deviates from it, namely, the Riemann conjugate gradient (RCG). It can be derived that the RCG is the projection of the Euclidean gradient in the tangent space, which is the set of directions that least deviate from the manifold surface. Consequently, the key of MO lies in the derivation of the Euclidean gradient. To obtain the gradient of f 1 Φ 1 , we first extract the main diagonal elements of Φ 1 containing useful information to form vector ϕ 1 , i.e.,  ϕ 1 = diag Φ 1 , and transform the objective function f 1 Φ 1 into f 1 ϕ 1 as follows:   
f 1 ϕ 1 = 2 Re Tr A ϕ 1 H + Tr ξ t P U ϕ 1 H H fle ϕ 1 H ¯ H H ¯ + Tr ξ r ϕ 1 H H fle ϕ 1 F ¯ F ¯ H + Tr ξ t ϕ 1 H H fra ϕ 1 F ¯ F ¯ H + Tr ρ ξ r N R ϕ 1 H H BR H BR H ϕ 1 H TB H TB H = ( a ) 2 Re ϕ 1 H a + ϕ 1 H B ϕ 1 ,
where A and B are equivalent matrices as
A = ξ r H BR U U A U U U H H TR F F ¯ H ξ t P U H BR U U A U H ¯ ξ t G H Φ 2 H H D A D U D F ¯ H + ρ N R ξ r H BR H TR H TB H ,
B = ξ t P U H fle H ¯ H H ¯ T + ξ r H fle F ¯ F ¯ H T + ξ t H fra F ¯ F ¯ H T + ρ ξ r N H BR H BR H H TB H TB H T ,
and equality ( a ) holds due to the following properties: Tr ( C H P C Q ) = c H ( P Q T ) c , Tr ( P C ) = p T c for any matrices P , Q , and diagonal matrix C , with  p = diag ( P ) and c = diag ( C ) . Thus, the Euclidean gradient of f 1 ϕ 1 can be obtained as
ϕ 1 f 1 ϕ 1 = a + B ϕ 1 .
Thus, the RCG can be derived to facilitate gradient descent with an appropriate step size. Subsequently, the optimized ϕ 1 is projected back onto the manifold surface to ensure the constant modulus constraint. Consequently, the optimal ϕ 1 can be obtained by iteratively descending along the RCG until a predefined stopping criterion is satisfied.
It is important to notice that the term Tr ρ ξ r N R Φ 1 H H BR H BR H Φ 1 H TB H TB H results from the SI power constraint, while the other terms are associated with the SR. Consequently, the optimization of Φ 1 takes into account SRM and SIC simultaneously.

3.5. Optimize Φ 2  with Fixed F , Φ 1 , A D , A U , U D , U U

Similarly, we optimize Φ 2 with other variables fixed in this subsection. By defining equivalent matrices H ¯ BR = P U U U H H BR H Φ 1 G , H ¯ TB = G Φ 1 H TB F , H ¯ D = H D U D , the sub-problem related to Φ 2 can be expressed as
min Φ 2 f 2 Φ 2 = 2 ξ t Re Tr H ¯ BR H A U H U H + H D U D A D H ¯ TB H Φ 2 H + ξ t Tr Φ 2 H H ¯ BR H A U H ¯ BR Φ 2 H U H U H + ξ t Tr Φ 2 H H ¯ D A D H ¯ D H Φ 2 H ¯ TB H ¯ TB H s . t . Φ 2 i i = 1 , i .
Similarly, we can also employ MO to solve (33). Extract the main diagonal elements of Φ 2 to form vector ϕ 2 ; the objective f 2 Φ 2 can be transformed into f 2 ϕ 2 as follows:
f 2 Φ 2 = 2 ξ t Re ϕ 2 H c + ξ t ϕ 2 H D ϕ 2 ,
where ϕ 2 = diag Φ 2 , and C and D are equivalent matrices as
C = H ¯ BR H A U H U H + H D U D A D H ¯ TB H ,
D = H ¯ BR H A U H ¯ BR H U H U H T + H ¯ D A D H ¯ D H H ¯ TB H ¯ TB H T .
Thus, the Euclidean gradient of f 2 ϕ 2 can be obtained as
ϕ 2 f 2 ϕ 2 = ξ t c + ξ t D ϕ 2 .
It is worth noting that, despite the similar form, the optimization of Φ 1 and Φ 2 has different meanings for this system. As indicated in the UL rate expression (12), the SI is tied to Φ 1 while not directly related to the optimization of Φ 2 . Therefore, we can ignore the penalty item related to SIC in (19) during the Φ 2 optimization. Furthermore, as the BIOS can independently control the reflection and refraction beams on both sides, the additional freedom enables Φ 2 to focus on the beamforming for SRM without affecting the SIC quality.
The proposed SIC-WMMSE algorithm for solving the sub-problem is summarized in Algorithm 1. It is worth noting that the application of the KKT conditions and the MO algorithm enables a reduction in the objective function for each variable within each iteration. When the decrement in the weighted MSE between two iterations is below a predefined threshold, the iteration is terminated. Since the objective function decreases after each step of updating, Algorithm 1 can converge to a locally optimal solution. To analyze its computational complexity, we count the number of complex multiplications of the key steps in one iteration turn. Assuming that N T = N T = N , K D = K U = K , and  M > N > K , the complexity can be summarized as follows: updating F ( i ) : O K M 2 + N 3 ; updating Φ 1 ( i ) : O M 3 ; updating Φ 2 ( i ) : O N M 2 ; updating A D ( i ) : O K M 2 ; updating A U ( i ) : O K M 2 + M N 2 ; updating U D ( i ) : O N K 2 ; updating U U ( i ) : O N 3 .
Algorithm 1 Proposed SIC-WMMSE Algorithm
1:
Randomly initialize Φ 1 ( 0 ) , Φ 2 ( 0 ) and F ( 0 ) and set i = 0 .
2:
Calculate A D ( 0 ) , A U ( 0 ) , U D ( 0 ) , and  U U ( 0 ) according to (23)–(26).
3:
repeat
4:
   Update F ( i ) according to (28).
5:
   Update Φ 1 ( i ) , Φ 2 ( i ) according to (31), (36).
6:
   Update U D ( i ) and U U ( i ) according to (24), (26).
7:
   Update A D ( i ) , A U ( i ) according to (23), (25).
8:
    i i + 1 .
9:
until the stopping condition is satisfied.

4. Analysis of BIOS Size

To further guide the practical deployment of BIOS-assisted FD systems, a lower bound of BIOS size required for efficient SIC is derived here for the single-input single-output (SISO) scenario. Specifically, the channels between the BS Tx - BS Rx , BS Tx - IOS 1 , and BS Rx - IOS 1 are denoted as h TR , h TB , and h BR , respectively.
Theorem 1.
To achieve efficient SIC, the number of elements in one layer of the BIOS must exceed a threshold M that satisfies the following inequality:
m = 1 M 1 d m BR d m TB 3 2 2 π ξ r λ d BB d TR ,
where d m BR , d m TB , respectively, denote the distances from the m-th element of the I O S 1 to the B S Rx and B S Tx , and d BB and d TR denote the distance between BS-BIOS and B S Rx - B S Tx .
Proof of Theorem 1.
To ensure effective SIC in the SISO scenario, the residual SI should satisfy the following power constraint:
( h TR + ξ r h BR H Φ 1 h TB ) s D F 2 γ .
Notably, for effective SIC, the threshold γ should be minimized, and the power constraint (38) should be universally valid for any s D . This requires that the residual interference approaches zero, which can be expressed as
h TR + ξ r h BR H Φ 1 h TB 0 .
To clarify, the necessary condition for efficient SIC is that the modulus of the cascaded channel ξ r h BR H Φ 1 h TB should exceed that of the SI channel h TR , which can be formulated as follows:
ξ r h BR H Φ h TB 2 h TR 2 .
We define g ( M ) as the maximum gain of the cascade channel generated by BIOS with M scattering elements in one layer, which is given by
g ( M ) = max Φ ξ r h BR H Φ h TB 2 = max ϕ ξ r m = 1 M h BR H m [ ϕ ] m h TB m 2
It can be observed that maximizing the cascade channel gain occurs when the phase shift element [ ϕ ] m is aligned in phase with h BR H m h TB m . Thus, by setting [ ϕ 1 ] m = h BR m h TB * m h BR * m h TB m , g ( M ) has an evident closed-form solution as
g ( M ) = ξ r h BR h TB 1 2 = ξ r m = 1 M [ h BR * ] m [ h TB ] m 2 .
By substituting the channel settings, we have
g ( M ) = λ 2 d BB 8 π m = 1 M ( 1 d m BR d m TB ) 3 2 .
h TR = λ 4 π d TR .
According to the derivations mentioned above, the lower bound of the element number can be derived through the inequality constraint
λ 2 d BB 8 π m = 1 M ( 1 d m BR d m TB ) 3 2 λ 4 π d TR .
The proof is thus completed. □
Theorem 1 provides a lower bound of BIOS size required for SIC, which is of practical importance in the design of FD systems. As will be shown in Section 5, the derived lower bound is rather close to the required BIOS size in the simulation.

5. Simulation Results

This section presents numerical results to illustrate the performance evaluation of the proposed BIOS-assisted FD system. For comparison, an IOS-assisted FD system is employed as a benchmark, which is characterized by identical phase matrices for reflecting and refracting with ξ r = ξ t = 1 / 2 . Throughout simulations, the centers of the BS and BIOS are set at the origin of a three-dimensional coordinate system. The distance between two neighboring IOSs of the BIOS is set as d II = 0.05 m. The DL and UL UEs are randomly distributed within two respective circles of 3m radius centered at ( 20 , 10 , 0 ) and ( 10 , 10 , 0 ) . Considering the NLoS paths, h D , k and h U , l are modeled as Rician channels with a Rician factor κ = 4 . Moreover, α 0 = 10 4 is the pass loss of the reference distance d 0 = 1 m with the path loss exponent β = 2.2 . Furthermore, λ = 0.05 m and σ U 2 = σ D 2 = 80 dBm.
Figure 2 shows the SR performance as a function of the BIOS/IOS size for different designs in a multi-user MISO system with N T = N R = 3 and K D = K U = 2 . Specifically, the solid lines illustrate the SR of FD systems, and the dashed lines indicate the rate of HD systems, with blue for BIOS assistance and red for IOS assistance, respectively. Meanwhile, as the BIOS may be too small to enable effective SIC, we switch the system from the FD mode to the HD one with only the DL transmission when the SIC constraint cannot be satisfied, which is indicated by the shaded area. It is worth noting that as the channels are randomly generated, the shaded area means that in most of the simulation realizations, the system has to switch to the HD mode as the size of the BIOS/IOS is too small to achieve the SIC threshold. It can be observed that for all systems, the data rate monotonically increases with M y for both BIOS and IOS due to the enhanced beamforming gains. For FD systems, as M y increases, the SR of BIOS-assisted systems significantly outperforms that of HD systems. However, the IOS-assisted FD system demonstrates only a slight enhancement over HD systems. This is because the IOS beams for SIC and SRM are tightly coupled, limiting the system’s efficiency. Specifically, if the IOS is designed to cancel the SI signal on the reflecting side, it cannot be efficiently optimized for SRM on the refracting side. Conversely, the BIOS-assisted FD system can provide flexible beamforming on both sides, thereby enhancing communication performance and achieving SIC simultaneously.
To further investigate the beamforming performance of the BIOS and IOS in FD systems, Figure 3 shows the detailed UL and DL rates of the BIOS/IOS-assisted system with different M. As can be observed, the system switches from the FD mode to the HD mode with M y < 9 . In this range, the data rate, i.e., the DL rate, consistently increases with M. This is because the expansion of the array scale provides higher degrees of freedom, thus enhancing the beamforming gain. However, when M y changes from 8 to 9, the DL rate unexpectedly decreases while the UL rate substantially increases. This is because the power of the cascaded signal generated by the BIOS/IOS is strong enough to facilitate effective SIC, thus leading to a trade-off between the SRM and SIC for beamforming. It is worth noting that, compared with the IOS-assisted system, the DL rate in the BIOS-assisted system is less affected due to the independent beamforming on both sides. Consequently, the SR performance of the BIOS-assisted FD system significantly surpasses that of the IOS-assisted system.
Furthermore, Figure 4 shows the performance comparison between the proposed BIOS and an IOS with the same scattering elements. As the element spacing is kept unchanged, the IOS with 2 M elements has a larger aperture size, it can be observed that the IOS with 2 M elements slightly outperforms the IOS with M elements due to the additional beamforming gain from the increase in the element number and the aperture size. Similarly, it outperforms the BIOS when M y is small for the same reasons. However, with the increase in M y , the performance of the IOS with 2 M elements remains significantly inferior to that of the BIOS due to the coupling between the reflected and refracted beams.
Finally, to visualize the SIC capability of the BIOS and verify the theoretical lower bound discussed in Section 4, Figure 5 shows the residual SI power as a function of M y in SISO FD systems with different d BB . Specifically, the solid line represents the residual SI power, and the dashed line of the same color represents the theoretical lower bound of M for efficient SIC in the system with the same d BB . It can be observed that the residual SI power with the proposed scheme monotonically decreases as M increases due to the beamforming gain. Meanwhile, despite the approximation, the theoretical lower bound calculated according to (37) is consistent with the simulation result.

6. Conclusions

We proposed a novel BIOS-assisted FD system for simultaneous SIC and SRM, and formulated the beamforming optimization problem aiming at maximizing the SR with the SIC requirement constraint. The BS precoder and the BIOS phase shifts were jointly optimized by the proposed SIC-WMMSE approach. Furthermore, a theoretical lower bound of BIOS size required for efficient SIC was derived and proved to be very tight through simulation. The simulation results also showed that the BIOS-assisted FD system significantly outperforms the conventional IOS-assisted system, as the BIOS can flexibly control the beamforming for SIC and SRM.

Author Contributions

Y.Z. (Yunxia Zhou) contributed to the methodology, experiment, and writing. Q.W. and Y.Z. (Yu Zhu) contributed to the guidance and suggestions of the problem, and review of the writing. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Natural Science Foundation of Shanghai under Grant No. 23ZR1407300.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Theorem A1.
For the problem of SRM for both DL and UL, it can be transformed into a WMMSE problem by introducing auxiliary variables a D , k and a U , l , i.e., weighting coefficients, which can be reformulated as follows:
arg max Φ 1 , Φ 2 , F R D , k = arg min Φ 1 , Φ 2 , F a D , k e D , k log 2 a D , k , k ,
arg max Φ 1 , Φ 2 , F R U , l = arg min Φ 1 , Φ 2 , F a U , l e U , l log 2 a U , l , l .
Proof of Theorem A1.
In the DL scenario, considering the independence between UEs, we take the k-th DL UE as an example to prove the equivalence between SRM and WMMSE. The proof is to demonstrate that maximizing the rate of the k-th DL UE is equivalent to solving the following optimization problem:
min Φ 1 , Φ 2 , F g D , k = a D , k e D , k log 2 a D , k .
It can be observed that when variables Φ 1 , Φ 2 , and F are fixed, the optimization problem (A3) becomes convex with respect to A D , k , u D , k . Thus, the optimal A D , k can be directly obtained through the first-order conditions
a D , k g D , k = 0 a D , k = e D , k 1 .
Similarly, the optimal u D , k can be derived as
u D , k * g D , k = a D , k u D , k * u D , k h ^ D , k H F F H h ^ D , k 2 Re u D , k * h ^ D , k H f k + σ D , k 2 u D , k * u D , k + 1 u D , k * = a D , k u D , k h ^ D , k H F F H h ^ D , k h ^ D , k H f k + σ D , k 2 u D , k ,
u D , k * g D , k = 0 u D , k = h ^ D , k H F F H h ^ D , k + σ D , k 2 1 h ^ D , k H f k .
By substituting u D , k into e D , k , the minimized MSE can be derived as follows:
e D , k MMSE = 1 h ^ D , k H f k f k H h ^ D , k h ^ D , k H F F H h ^ D , k + σ D 2 1 = i = k , i = 1 K D h ^ D , k H f i f i H h ^ D , k + σ D 2 h ^ D , k H F F H h ^ D , k + σ D 2 .
According to (A4), the optimal a D , k can be rewritten as
a D , k = e D , k MMSE 1 = 1 + h ^ D , k H f k f k H h ^ D , k i k , i = 1 K D h ^ D , k H f i f i H h ^ D , k + σ D , k 2 ,
By taking (A8) back to g D , k , we have
g D , k = 1 log a D , k = 1 log 1 + h ^ D , k H f k f k H h ^ D , k i = k , j = 1 K D h ^ D , f i f f i H h ^ D , k + σ D , k 2 .
Comparing (11) with (A9), we can find that the logarithmic term in (A9) matches the expression of the achievable rate. Consequently, the optimal solution Φ 1 , Φ 2 , F that maximizes the rate in (11) is also the one that minimizes the WMMSE as described in (A9).
Similarly, we take the l-th UL UE as an example to prove the equivalence between SRM and WMMSE in the UL scenario. This equivalence is shown by transforming the rate maximization problem of the l-th UL UE into the following minimization problem
min Φ 1 , Φ 2 , F g U , l = a U , l e U , l log 2 a U , l .
With Φ 1 , Φ 2 , F fixed, the optimal a U , l , u U , l can be derived as
a U , 1 g U , l = 0 a U , l = e U , l 1 ,
u U , l ( U , l ) = 0 u U , l = P U P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I 1 h ^ U , l ,
where
u U , g U , l = a U , l e U , l u U , l H = a U , l u U , l H P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I u U , l 2 P U Re u U , l H h ^ U , l + 1 u U , l H = a U , l P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I u U , l P U h ^ U , l .
By substituting u U , l into (16), we have
e U , l MMSE = u U , l H P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I u U , l 2 P U Re u U , l H h ^ U , l + 1 = 1 P U h ^ U , l H P U H ^ U H ^ U H + H SI F F H H SI H + σ U 2 I 1 h ^ U , l .
Thus, according to (A11), a U , l can be rewritten as
a U , l = e U , l NMSE 1 = ( b ) 1 + P U h ^ U , l P U i = 1 , i l K U h ^ U , i h ^ U , i H + H SI F F H H SI H + σ U 2 I 1 h ^ U , l H ,
where equality ( b ) holds due to the Woodbury matrix identity ( A + UCV ) 1 = A 1 A 1 U ( C 1 + VA 1 U ) 1 VA 1 . By taking (A11) back to g U , l , we have
g U , l = 1 log e U , l MMSE 1 = 1 log 1 + P U h ^ U , l H P U i = 1 , i l K U h ^ U , i h ^ U , i H + H SI F F H H SI H + σ U 2 I 1 h ^ U , l = ( c ) 1 log I + P U h ^ U , l h ^ U , l H P U i = 1 , i l K U h ^ U , i h ^ U , i H + H SI F F H H SI H + σ U 2 I ,
where equality ( c ) holds due to det I + u v H = 1 + v H u .
Similarly, comparing (12) with (A16), we can find that the logarithmic term in (A16) directly corresponds to the achievable rate. Therefore, the optimal solution Φ 1 * , Φ 2 * , F * that maximizes the rate in (12) is also the one that minimizes the WMMSE(A10). The proof is thus complete. □

References

  1. Kolodziej, K.E.; Perry, B.T.; Herd, J.S. In-Band Full-Duplex Technology: Techniques and Systems Survey. IEEE Trans. Microw. Theory Tech. 2019, 67, 2508. [Google Scholar] [CrossRef]
  2. Lin, Z.; Lin, M.; Champagne, B.; Zhu, W.-P.; Al-Dhahir, N. Secrecy-Energy Efficient Hybrid Beamforming for Satellite-Terrestrial Integrated Networks. IEEE Trans. Commun. 2021, 69, 6345–6360. [Google Scholar] [CrossRef]
  3. Khan, R.; Tsiga, N.; Asif, R. Interference Management with Reflective In-Band Full-Duplex NOMA for Secure 6G Wireless Communication Systems. Sensors 2022, 22, 2508. [Google Scholar] [CrossRef]
  4. Smida, B.; Sabharwal, A.; Fodor, G.; Alexandropoulos, G.C.; Suraweera, H.A.; Chae, C.B. Full-Duplex Wireless for 6G: Progress Brings New Opportunities and Challenges. IEEE J. Sel. Areas Commun. 2023, 41, 2729–2750. [Google Scholar] [CrossRef]
  5. Sabharwal, A.; Schniter, P.; Guo, D.; Bliss, D.W.; Rangarajan, S.; Wichman, R. In-Band Full-Duplex Wireless: Challenges and Opportunities. IEEE J. Sel. Areas Commun. 2014, 32, 1637–1652. [Google Scholar] [CrossRef]
  6. Everett, E.; Sahai, A.; Sahai, A. Passive Self-Interference Suppression for Full-Duplex Infrastructure Nodes. IEEE Trans. Wirel. Commun. 2014, 13, 680–694. [Google Scholar] [CrossRef]
  7. Hong, S.; Brand, J.; Choi, J.I.; Jain, M.; Mehlman, J.; Katti, S.; Levis, P. Applications of Self-Interference Cancellation in 5G and Beyond. IEEE Commun. Mag. 2014, 52, 114–121. [Google Scholar] [CrossRef]
  8. Choi, J.I.; Jain, M.; Srinivasan, K.; Levis, P.; Katti, S. Achieving Single Channel, Full Duplex Wireless Communication. In Proceedings of the 16th Annual International Conference on Mobile Computing and Networking, Chicago, IL, USA, 20–24 September 2010; pp. 1–12. [Google Scholar] [CrossRef]
  9. Duarte, M.; Sabharwal, A. Full-Duplex Wireless Communications Using off-the-shelf Radios: Feasibility and First Results. In Proceedings of the 2010 IEEE 44th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 7–10 November 2010; pp. 1558–1562. [Google Scholar] [CrossRef]
  10. Kwak, J.W.; Sim, M.S.; Kang, I.-W.; Park, J.; Wong, K.-K.; Chae, C.-B. Analog Self-Interference Cancellation With Practical RF Components for Full-Duplex Radios. IEEE Trans. Wirel. Commun. 2023, 22, 4552–4564. [Google Scholar] [CrossRef]
  11. Duarte, M.; Dick, C.; Sabharwal, A. Experiment-Driven Characterization of Full-Duplex Wireless Systems. IEEE Trans. Wirel. Commun. 2012, 11, 4296–4307. [Google Scholar] [CrossRef]
  12. Lee, J.-H. Self-Interference Cancelation Using Phase Rotation in Full-Duplex Wireless. IEEE Trans. Veh. Technol. 2013, 62, 4421–4429. [Google Scholar] [CrossRef]
  13. Fukui, T.; Komatsu, K.; Miyaji, Y.; Uehara, H. Analog Self-Interference Cancellation Using Auxiliary Transmitter Considering IQ Imbalance and Amplifier Nonlinearity. IEEE Trans. Wirel. Commun. 2020, 19, 7439–7452. [Google Scholar] [CrossRef]
  14. Mohammadi, M.; Suraweera, H.A.; Tellambura, C. Uplink/Downlink Rate Analysis and Impact of Power Allocation for Full-Duplex Cloud-RANs. IEEE Trans. Wirel. Commun. 2018, 17, 5774–5788. [Google Scholar] [CrossRef]
  15. Lin, C.-T.; Tseng, F.-S.; Wu, W.-R. MMSE Transceiver Design for Full-Duplex MIMO Relay Systems. IEEE Trans. Veh. Technol. 2017, 66, 6849–6861. [Google Scholar] [CrossRef]
  16. Kim, S.-M.; Lim, Y.-G.; Dai, L.; Chae, C.-B. Performance Analysis of Self-Interference Cancellation in Full-Duplex Massive MIMO Systems: Subtraction Versus Spatial Suppression. IEEE Trans. Wirel. Commun. 2023, 22, 642–657. [Google Scholar] [CrossRef]
  17. Ma, R.; Yang, W.; Guan, X.; Lu, X.; Song, Y.; Chen, D. Covert mmWave Communications With Finite Blocklength Against Spatially Random Wardens. IEEE Internet Things J. 2024, 11, 3402–3416. [Google Scholar] [CrossRef]
  18. Liu, Y.; Liu, X.; Mu, X.; Hou, T.; Xu, J.; Di, R.M.; Al-Dhahir, N. Reconfigurable Intelligent Surfaces: Principles and Opportunities. IEEE Commun. Surv. Tutor. 2021, 23, 1546–1577. [Google Scholar] [CrossRef]
  19. ElMossallamy, M.A.; Zhang, H.; Song, L.; Seddik, K.; Han, Z.; Li, G.Y. Reconfigurable Intelligent Surfaces for Wireless Communications: Principles, Challenges, and Opportunities. IEEE Trans. Cogn. Commun. Netw. 2020, 6, 990–1002. [Google Scholar] [CrossRef]
  20. Xu, Y.; Gao, Z.; Wang, Z.; Huang, C.; Yang, Z.; Yuen, C. RIS-enhanced WPCNs: Joint Radio Resource Allocation and Passive Beamforming Optimization. IEEE Trans. Veh. Technol. 2021, 70, 7980–7991. [Google Scholar] [CrossRef]
  21. Renzo, M.D.; Zappone, A.; Debbah, M.; Alouini, M.-S.; Yuen, C.; Rosny, J.D.; Tretyakov, S. Smart Radio Environments Empowered by Reconfigurable Intelligent Surfaces: How It Works, State of Research, and the Road Ahead. IEEE J. Sel. Areas Commun. 2020, 38, 2450–2525. [Google Scholar] [CrossRef]
  22. Selvaraj, M.; Vijay, R.; Anbazhagan, R.; Rengarajan, A. Reconfigurable Metasurface: Enabling Tunable Reflection in 6G Wireless Communications. Sensors 2023, 23, 9166. [Google Scholar] [CrossRef]
  23. Lin, Z.; Niu, H.; An, K.; Wang, Y.; Zheng, G.; Chatzinotas, S.; Hu, Y. Refracting RIS-Aided Hybrid Satellite-Terrestrial Relay Networks: Joint Beamforming Design and Optimization. IEEE Trans. Aeros. Electr. Systems. 2022, 58, 3717–3724. [Google Scholar] [CrossRef]
  24. He, Y.; Liu, Y.; Jiang, C.; Zhong, X. Multiobjective Anti-Collision for Massive Access Ranging in MF-TDMA Satellite Communication System. IEEE Internet Things J. 2022, 9, 14655–14666. [Google Scholar] [CrossRef]
  25. Qiu, C.; Wu, Q.; Hua, M.; Chen, W.; Ma, S.; Hou, F.; Ng, D.W.K.; Swindlehurst, A.L. Intelligent Reflecting Surface Empowered Self-Interference Cancellation in Full-Duplex Systems. IEEE Trans. Commun. 2024, 72, 2945–2958. [Google Scholar] [CrossRef]
  26. Tewes, S.; Heinrichs, M.; Staat, P.; Kronberger, R.; Sezgin, A. Full-Duplex Meets Reconfigurable Surfaces: RIS-Assisted SIC for Full-Duplex Radios. In Proceedings of the 2022 IEEE International Conference on Communications (ICC), Seoul, Republic of Korea, 16–20 May 2022. [Google Scholar] [CrossRef]
  27. Zhang, W.; Wen, Z.; Du, C.; Jiang, Y.; Zhou, B. Intelligent Reflecting Surface Empowered Self-Interference Cancellation in Full-Duplex Systems. IEEE Trans. Commun. 2023, 71, 5444–5454. [Google Scholar] [CrossRef]
  28. Fang, S.; Chen, G.; Xiao, P.; Wong, K.-K.; Tafazolli, R. Intelligent Omni Surface-Assisted Self-Interference Cancellation for Full-Duplex MISO System. IEEE Trans. Wirel. Commun. 2024, 23, 2268–2281. [Google Scholar] [CrossRef]
  29. Peng, Z.; Zhang, Z.; Pan, C.; Li, L.; Swindlehurst, A.L. Multiuser Full-Duplex Two-Way Communications via Intelligent Reflecting Surface. IEEE Trans. Signal Process. 2021, 69, 837–851. [Google Scholar] [CrossRef]
  30. Zhang, H.; Zeng, S.; Di, B.; Tan, Y.; Renzo, M.D.; Debbah, M.; Han, Z.; Poor, H.V.; Song, L. Intelligent Omni-Surfaces for Full-Dimensional Wireless Communications: Principle, Technology, and Implementation. IEEE Commun. Mag. 2022, 60, 39–45. [Google Scholar] [CrossRef]
  31. Liu, Y.; Mu, X.; Schober, R.; Poor, H.V. Simultaneously Transmitting and Reflecting (STAR)-RISs: A Coupled Phase-Shift Model. In Proceedings of the 2022 IEEE International Conference on Communications (ICC), Seoul, Republic of Korea, 16–20 May 2022. [Google Scholar] [CrossRef]
  32. Zhang, S.; Zhang, H.; Di, B.; Tan, Y.; Renzo, M.D.; Han, Z.; Poor, H.V.; Song, L. Intelligent Omni-Surfaces: Ubiquitous Wireless Transmission by Reflective-Refractive Metasurfaces. IEEE Trans. Wirel. Commun. 2022, 21, 219–233. [Google Scholar] [CrossRef]
  33. Wu, Q.; Lin, T.; Liu, M.; Zhu, Y. BIOS: An Omni RIS for Independent Reflection and Refraction Beamforming. IEEE Wirel. Commun. Lett. 2022, 11, 1062–1066. [Google Scholar] [CrossRef]
  34. Wu, Q.; Lin, T.; Zhu, Y. Channel Estimation for BIOS-Assisted Multi-User MIMO Systems: A Heterogeneous Two-Timescale Strategy. IEEE Trans. Wirel. Commun. 2024; early access. [Google Scholar] [CrossRef]
  35. Liu, K.; Zhang, Z.; Dai, L.; Hanzo, L. Compact User-Specific Reconfigurable Intelligent Surfaces for Uplink Transmission. IEEE Trans. Commun. 2022, 70, 680–692. [Google Scholar] [CrossRef]
  36. Sun, Y.; An, K.; Lin, Z.; Zhu, Y.; Al-Dhahir, N.; Wong, K.-K. Scalable Robust Beamforming for Multi-Layer Refracting RIS-Assisted HAP-SWIPT Networks. In Proceedings of the 2023 IEEE Global Communications Conference, Kuala Lumpur, Malaysia, 4–8 December 2023. [Google Scholar] [CrossRef]
  37. Tang, W.; Chen, M.Z.; Chen, X.; Dai, J.Y.; Han, Y.; Renzo, M.D.; Zeng, Y.; Jin, S.; Cheng, Q.; Cui, T.J. Wireless Communications with Reconfigurable Intelligent Surface: Path Loss Modeling and Experimental Measurement. IEEE Trans. Wirel. Commun. 2021, 20, 421–439. [Google Scholar] [CrossRef]
Figure 1. System model of the BIOS-assisted FD system.
Figure 1. System model of the BIOS-assisted FD system.
Sensors 24 04535 g001
Figure 2. SR performance of BIOS/IOS-assisted systems with different M y ( P s = 10 dBm, P u = 7 dBm, d TR = 3 λ , d BB = 1.5 λ ).
Figure 2. SR performance of BIOS/IOS-assisted systems with different M y ( P s = 10 dBm, P u = 7 dBm, d TR = 3 λ , d BB = 1.5 λ ).
Sensors 24 04535 g002
Figure 3. DL/UL rate performance of BIOS/IOS-assisted systems with different M y .
Figure 3. DL/UL rate performance of BIOS/IOS-assisted systems with different M y .
Sensors 24 04535 g003
Figure 4. SR performance of BIOS/IOS-assisted systems with different M y ( P s = 10 dBm, P u = 7 dBm, d TR = 3 λ , d BB = 1.5 λ ).
Figure 4. SR performance of BIOS/IOS-assisted systems with different M y ( P s = 10 dBm, P u = 7 dBm, d TR = 3 λ , d BB = 1.5 λ ).
Sensors 24 04535 g004
Figure 5. Residual SI power of BIOS-assisted FD systems with different M y .
Figure 5. Residual SI power of BIOS-assisted FD systems with different M y .
Sensors 24 04535 g005
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhou, Y.; Wu, Q.; Zhu, Y. Bilayer Intelligent Omni-Surface-Assisted Full-Duplex Systems: Simultaneous Self-Interference Cancellation and Sum Rate Maximization. Sensors 2024, 24, 4535. https://doi.org/10.3390/s24144535

AMA Style

Zhou Y, Wu Q, Zhu Y. Bilayer Intelligent Omni-Surface-Assisted Full-Duplex Systems: Simultaneous Self-Interference Cancellation and Sum Rate Maximization. Sensors. 2024; 24(14):4535. https://doi.org/10.3390/s24144535

Chicago/Turabian Style

Zhou, Yunxia, Qiucen Wu, and Yu Zhu. 2024. "Bilayer Intelligent Omni-Surface-Assisted Full-Duplex Systems: Simultaneous Self-Interference Cancellation and Sum Rate Maximization" Sensors 24, no. 14: 4535. https://doi.org/10.3390/s24144535

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop