arXiv subjects

Eduard Jorswieck

Publications and source records attributed to Eduard Jorswieck.

At least 55 records · Page 3Linked to original sources

arXiv2023

SNR Maximization in Beyond Diagonal RIS-assisted Single and Multiple Antenna Links

Reconfigurable intelligent surface (RIS) architectures not limited to diagonal phase shift matrices have recently been considered to increase their flexibility in shaping the wireless channel. One of these beyond-diagonal RIS or BD-RIS architectures leads to a unitary and symmetric RIS matrix. In this letter, we consider the problem of maximizing the signal-to-noise ratio (SNR) in single and multiple antenna links assisted by a BD-RIS. The Max-SNR problem admits a closed-form solution based on the Takagi factorization of a certain complex and symmetric matrix. This allows us to solve the max-SNR problem for SISO, SIMO, and MISO channels.

cs.IT↗

arXiv2023

Spectral and Energy Efficiency Maximization of MISO STAR-RIS-assisted URLLC Systems

This paper proposes a general optimization framework to improve the spectral and energy efficiency (EE) of ultra-reliable low-latency communication (URLLC) simultaneous-transfer-and-receive (STAR) reconfigurable intelligent surface (RIS)-assisted interference-limited systems with finite block length (FBL). This framework can solve a large variety of optimization problems in which the objective and/or constraints are linear functions of the rates and/or EE of users. Additionally, the framework can be applied to any interference-limited system with treating interference as noise as the decoding strategy at receivers. We consider a multi-cell broadcast channel as an example and show how this framework can be specialized to solve the minimum-weighted rate, weighted sum rate, global EE and weighted EE of the system. We make realistic assumptions regarding the (STAR-)RIS by considering three different feasibility sets for the components of either regular RIS or STAR-RIS. Our results show that RIS can substantially increase the spectral and EE of URLLC systems if the reflecting coefficients are properly optimized. Moreover, we consider three different transmission strategies for STAR-RIS as energy splitting (ES), mode switching (MS), and time switching (TS). We show that STAR-RIS can outperform a regular RIS when the regular RIS cannot cover all the users. Furthermore, it is shown that the ES scheme outperforms the MS and TS schemes.

cs.IT↗

arXiv2023

Energy-efficient Rate Splitting for MIMO STAR-RIS-assisted Broadcast Channels with I/Q Imbalance

This paper proposes an energy-efficient scheme for multicell multiple-input, multiple-output (MIMO) simultaneous transmit and reflect (STAR) reconfigurable intelligent surfaces (RIS)-assisted broadcast channels by employing rate splitting (RS) and improper Gaussian signaling (IGS). Regular RISs can only reflect signals. Thus, a regular RIS can assist only when the transmitter and receiver are in the reflection space of the RIS. However, a STAR-RIS can simultaneously transmit and reflect, thus providing a 360-degrees coverage. In this paper, we assume that transceivers may suffer from I/Q imbalance (IQI). To compensate for IQI, we employ IGS. Moreover, we employ RS to manage intracell interference. We show that RIS can significantly improve the energy efficiency (EE) of the system when RIS components are carefully optimized. Additionally, we show that STAR-RIS can significantly outperform a regular RIS when the regular RIS cannot cover all the users. We also show that RS can highly increase the EE comparing to treating interference as noise.

cs.IT↗

arXiv2023

NOMA-based Improper Signaling for Multicell MISO RIS-assisted Broadcast Channels

In this paper, we study the performance of reconfigurable intelligent surfaces (RISs) in a multicell broadcast channel (BC) that employs improper Gaussian signaling (IGS) jointly with non-orthogonal multiple access (NOMA) to optimize either the minimum-weighted rate or the energy efficiency (EE) of the network. We show that although the RIS can significantly improve the system performance, it cannot mitigate interference completely, so we have to employ other interference-management techniques to further improve performance. We show that the proposed NOMA-based IGS scheme can substantially outperform proper Gaussian signaling (PGS) and IGS schemes that treat interference as noise (TIN) in particular when the number of users per cell is larger than the number of base station (BS) antennas (referred to as overloaded networks). In other words, IGS and NOMA complement to each other as interference management techniques in multicell RIS-assisted BCs. Furthermore, we consider three different feasibility sets for the RIS components showing that even a RIS with a small number of elements provides considerable gains for all the feasibility sets.

cs.IT↗

arXiv2023

Securing Data in Multimode Fibers by Exploiting Mode-Dependent Light Propagation Effects

Multimode fibers hold great promise to advance data rates in optical communications but come with the challenge to compensate for modal crosstalk and mode-dependent losses, resulting in strong distortions. The holographic measurement of the transmission matrix enables not only correcting distortions but also harnessing these effects for creating a confidential data connection between legitimate communication parties, Alice and Bob. The feasibility of this physical-layer-security-based approach is demonstrated experimentally for the first time on a multimode fiber link to which the eavesdropper Eve is physically coupled. Once the proper structured light field is launched at Alice's side, the message can be delivered to Bob, and, simultaneously, the decipherment for an illegitimate wiretapper Eve is destroyed. Within a real communication scenario, we implement wiretap codes and demonstrate confidentiality by quantifying the level of secrecy. Compared to an uncoded data transmission, the amount of securely exchanged data is enhanced by a factor of 538. The complex light transportation phenomena that have long been considered limiting and have restricted the widespread use of multimode fiber are exploited for opening new perspectives on information security in spatial multiplexing communication systems.

physics.app-ph↗

arXiv2023

Interference Leakage Minimization in RIS-assisted MIMO Interference Channels

We address the problem of interference leakage (IL) minimization in the $K$-user multiple-input multiple-output (MIMO) interference channel (IC) assisted by a reconfigurable intelligent surface (RIS). We describe an iterative algorithm based on block coordinate descent to minimize the IL cost function. A reformulation of the problem provides a geometric interpretation and shows interesting connections with envelope precoding and phase-only zero-forcing beamforming problems. As a result of this analysis, we derive a set of necessary (but not sufficient) conditions for a phase-optimized RIS to be able to perfectly cancel the interference on the $K$-user MIMO IC.

cs.IT↗

arXiv2023

Rate Region of MIMO RIS-assisted Broadcast Channels with Rate Splitting and Improper Signaling

In this paper, we study the achievable rate region of 1-layer rate splitting (RS) in the presence of hardware impairment (HWI) and improper Gaussian signaling (IGS) for a single-cell reconfigurable intelligent surface (RIS) assisted broadcast channel (BC). We assume that the transceivers may suffer from an imbalance in in-band and quadrature signals, which is known as I/Q imbalance (IQI). The received signal and noise can be improper when there exists IQI. Therefore, we employ IGS to compensate for IQI as well as to manage interference. Our results show that RS and RIS can significantly enlarge the rate region, where the role of RS is to manage interference while RIS mainly improves the coverage.

cs.IT↗

arXiv2022

Rate Splitting in MIMO RIS-assisted Systems with Hardware Impairments and Improper Signaling

In this paper, we propose an optimization framework for rate splitting (RS) techniques in multiple-input multiple-output (MIMO) reconfigurable intelligent surface (RIS)-assisted systems, possibly with I/Q imbalance (IQI). This framework can be applied to any optimization problem in which the objective and/or constraints are linear functions of the rates and/or transmit covariance matrices. Such problems include minimum-weighted and weighted-sum rate maximization, total power minimization for a target rate, minimum-weighted energy efficiency (EE) and global EE maximization. The framework may be applied to any interference-limited system with hardware impairments. For the sake of illustration, we consider a multicell MIMO RIS-assisted broadcast channel (BC) in which the base stations (BSs) and/or the users may suffer from IQI. Since IQI generates improper noise, we consider improper Gaussian signaling (IGS) as an interference-management technique that can additionally compensate for IQI. We show that RS when combined with IGS can substantially improve the spectral and energy efficiency of overloaded networks (i.e., when the number of users per cell is larger than the number of transmit/receive antennas).

cs.IT↗

arXiv2022

Legitimate against Illegitimate IRSs on MISO Wiretap Channels

The low-cost legitimate intelligent reflecting surfaces (IRSs) are applied to the wiretap channel in physical layer security to enhance the secrecy rate. In practice, the eavesdropper can also deploy an IRS, namely illegitimate IRS, to deteriorate the secrecy rate. This paper studies the interplay between a transmitter, a legitimate IRS, and an illegitimate IRS in a multiple-input single-output (MISO) wiretap channel. We formulate a max-min secrecy rate problem, where all the information is available at the transmitter and the receivers. We aim to design an efficient transmit beamforming and phase shifting strategy of the legitimate IRS, under the worst-case secrecy rate achieved based on optimizing the phase-shifting strategy of the illegitimate IRS. We propose three solution methods based on the gradient descent ascent (GDA), the alternate optimization (AO), and the mixed Nash equilibrium (NE) in zero-sum games in strategic form. Simulation results show that for the continuous phase-shifting strategies, AO usually does not guarantee convergence, although it may achieve better performance than GDA in some iterations. GDA usually converges to a stationary point. Discrete phase-shifting strategies improve the convergence behavior of AO and GDA, while there is a single mixed NE with the highest secrecy rate.

eess.SP↗

arXiv2022

Resource allocation for reconfigurable intelligent surface aided broadcast channels

A two-user downlink network aided by a reconfigurable intelligent surface is considered. The weighted sum signal to interference plus noise ratio maximization and the sum rate maximization models are presented, where the precoding vectors and the RIS matrix are jointly optimized. Since the optimization problem is non-convex and difficult, new approximation models are proposed. The upper bounds of the corresponding objective functions are derived and maximized. Two new algorithms based on the alternating direction method of multiplier are proposed. It is proved that the proposed algorithms converge to the KKT points of the approximation models as long as the iteration points converge. Simulation results show the good performances of the proposed models compared to state of the art algorithms.

eess.SP↗

arXiv2021

On the Reception Process of Molecular Communication-Based Drug Delivery

One of the important applications of molecular communication is the targeted drug delivery process in which the drug molecules are released toward the target (receiver) in a way that the side effects are minimized in the human body. As the total number of released molecules increases, the receiver cannot receive all of the transmitted drug molecules. Therefore, the molecules would be accumulated in the system which results in side effects in the body. In order to diagnose the appropriate transmission rate of the drug molecules, it is important to investigate the reception process of the receiver. In this paper, a reception model is studied using queuing theory. In the proposed model, the rejection rate of the drug molecules due to different reasons, such as random movement of the molecules, as well as the rejection rate due to active receptors are taken into account. Moreover, an interval consisting of the lower and upper bounds for the number of released molecules is presented based on the proposed model in order to determine the range of allowable dosage of the drug molecules. It is shown that the queuing theory can be successfully employed in accurate modeling of the reception process of the receiver in drug delivery applications.

cs.IT↗

arXiv2021

Preallocation-based Combinatorial Auction for Efficient Fair Channel Assignments in Multi-Connectivity Networks

We consider a general multi-connectivity framework, intended for ultra-reliable low-latency communications (URLLC) services, and propose a novel, preallocation-based combinatorial auction approach for the efficient allocation of channels. We compare the performance of the proposed method with several other state-of-the-art and alternative channel-allocation algorithms. The two proposed performance metrics are the capacity-based and the utility-based context. In the first case, every unit of additional capacity is regarded as beneficial for any tenant, independent of the already allocated quantity, and the main measure is the total throughput of the system. In the second case, we assume a minimal and maximal required capacity value for each tenant, and consider the implied utility values accordingly. In addition to the total system performance, we also analyze fairness and computational requirements in both contexts. We conclude that at the cost of higher but still plausible computational time, the fairness-enhanced version of the proposed preallocation based combinatorial auction algorithm outperforms every other considered method when one considers total system performance and fairness simultaneously, and performs especially well in the utility context. Therefore, the proposed algorithm may be regarded as candidate scheme for URLLC channel allocation problems, where minimal and maximal capacity requirements have to be considered.

cs.GT↗

arXiv2021

AoI Minimization in Energy Harvesting and Spectrum Sharing Enabled 6G Networks

Spectrum sharing is a method to solve the problem of frequency spectrum deficiency. This paper studies a novel AI based spectrum sharing and energy harvesting system in which the freshness of information (AoI) is guaranteed. The system includes a primary user with access rights to the spectrum and a secondary user. The secondary user is an energy harvesting sensor that intends to use the primary user spectrum opportunistically. The problem is formulated as partially observable Markov decision processes (POMDPs) and solved using two methods: a deep Q-network (DQN) and dueling double deep Q-Network (D3QN) to achieve the optimal policy. The purpose is to choose the best action adaptively in every time slot based on its situation in both overlay and underlay modes to minimize the average AoI of the secondary user. Finally, simulation experiments are performed to evaluate the effectiveness of the proposed scheme compared to the overlay mode. According to the results, the average AoI in the proposed system is less than that of the existing models, including only overlay mode. The average user access improved from 30% in the overlay mode to 45% in the DQN and 48% in the D3QN.

eess.SY↗

arXiv2021

On the Optimality of the Stationary Solution of Secrecy Rate Maximization for MIMO Wiretap Channel

To achieve perfect secrecy in a multiple-input multiple-output (MIMO) Gaussian wiretap channel (WTC), we need to find its secrecy capacity and optimal signaling, which involves solving a difference of convex functions program known to be non-convex for the non-degraded case. To deal with this, a class of existing solutions have been developed but only local optimality is guaranteed by standard convergence analysis. Interestingly, our extensive numerical experiments have shown that these local optimization methods indeed achieve global optimality. In this paper, we provide an analytical proof for this observation. To achieve this, we show that the Karush-Kuhn-Tucker (KKT) conditions of the secrecy rate maximization problem admit a unique solution for both degraded and non-degraded cases. Motivated by this, we also propose a low-complexity algorithm to find a stationary point. Numerical results are presented to verify the theoretical analysis.

cs.IT↗

arXiv2021

Achievable Physical-Layer Secrecy in Multi-Mode Fiber Channels using Artificial Noise

Reliable and secure communication is an important aspect of modern fiber optic communication. In this work we consider a multi-mode fiber (MMF) channel wiretapped by an eavesdropper. We assume the transmitter knows the legitimate channel, but statistical knowledge of the eavesdropper's channel only. We propose a transmission scheme with artificial noise (AN) for such a channel. In particular, we formulate the corresponding optimization problem which aims to maximize the average secrecy rate and develop an algorithm to solve it. We apply this algorithm to actual measured MMF channels. As real fiber measurements show, for a 55 mode MMF we can achieve positive average secrecy rates with the proper use of AN. Furthermore, the gain compared to standard precoding and power allocation schemes is illustrated.

cs.IT↗

arXiv2021

Is NOMA Efficient in Multi-Antenna Networks? A Critical Look at Next Generation Multiple Access Techniques

In this paper, we take a critical and fresh look at the downlink multi-antenna NOMA literature. Instead of contrasting NOMA with OMA, we contrast NOMA with two other baselines. The first is conventional Multi-User Linear Precoding (MULP). The second is Rate-Splitting Multiple Access (RSMA) based on multi-antenna Rate-Splitting (RS) and SIC. We show that there is some confusion about the benefits of NOMA, and we dispel the associated misconceptions. First, we highlight why NOMA is inefficient in multi-antenna settings based on basic multiplexing gain analysis. We stress that the issue lies in how the NOMA literature has been hastily applied to multi-antenna setups, resulting in a misuse of spatial dimensions and therefore loss in multiplexing gains and rate. Second, we show that NOMA incurs a severe multiplexing gain loss despite an increased receiver complexity due to an inefficient use of SIC receivers. Third, we emphasize that much of the merits of NOMA are due to the constant comparison to OMA instead of comparing it to MULP and RS baselines. We then expose the pivotal design constraint that multi-antenna NOMA requires one user to fully decode the messages of the other users. This design constraint is responsible for the multiplexing gain erosion, rate loss, and inefficient use of SIC receivers in multi-antenna settings. Our results confirm that NOMA should not be applied blindly to multi-antenna settings, highlight the scenarios where MULP outperforms NOMA and vice versa, and demonstrate the inefficiency, performance loss and complexity disadvantages of NOMA compared to RS. The first takeaway message is that, while NOMA is not beneficial in most multi-antenna deployments. The second takeaway message is that other non-orthogonal transmission frameworks, such as RS, exist which fully exploit the multiplexing gain and the benefits of SIC to boost the rate in multi-antenna settings.

cs.IT↗

arXiv2020

Sum Secret Key Rate Maximization for TDD Multi-User Massive MIMO Wireless Networks

Physical-layer key generation (PKG) based on channel reciprocity has recently emerged as a new technique to establish secret keys between devices. Most works focus on pairwise communication scenarios with single or small-scale antennas. However, the fifth generation (5G) wireless communications employ massive multiple-input multiple-output (MIMO) to support multiple users simultaneously, bringing serious overhead of reciprocal channel acquisition. This paper presents a multi-user secret key generation in massive MIMO wireless networks. We provide a beam domain channel model, in which different elements represent the channel gains from different transmit directions to different receive directions. Based on this channel model, we analyze the secret key rate and derive a closed-form expression under independent channel conditions. To maximize the sum secret key rate, we provide the optimal conditions for the Kronecker product of the precoding and receiving matrices and propose an algorithm to generate these matrices with pilot reuse. The proposed optimization design can significantly reduce the pilot overhead of the reciprocal channel state information acquisition. Furthermore, we analyze the security under the channel correlation between user terminals (UTs), and propose a low overhead multi-user secret key generation with non-overlapping beams between UTs. Simulation results demonstrate the near optimal performance of the proposed precoding and receiving matrices design and the advantages of the non-overlapping beam allocation.

cs.IT↗

arXiv2020

Cross Layer Resource Allocation in H-CRAN with Spectrum and Energy Cooperation

5G and beyond wireless networks are the upcoming evolution for the current cellular networks to provide the essential requirement of future demands such as high data rate, low energy consumption, and low latency to provide seamless communication for the emerging applications. Heterogeneous cloud radio access network (H-CRAN) is envisioned as a new trend of 5G that uses the advantages of heterogeneous and cloud radio access networks to enhance both the spectral and energy efficiency. In this paper, building on the notion of effective capacity (EC), we propose a framework in non-orthogonal multiple access (NOMA)-based H-CRAN to meet these demands simultaneously. Our proposed approach is to maximize the effective energy efficiency (EEE) while considering spectrum and power cooperation between macro base station (MBS) and radio remote heads (RRHs). To solve the formulated problem and to make it more tractable, we transform the original problem into an equivalent subtractive form via Dinkelbach algorithm. Afterwards, the combinational framework of distributed stable matching and successive convex algorithm (SCA) is then adopted to obtain the solution of the equivalent problem. Hereby, we propose an efficient resource allocation scheme to maximize energy efficiency while maintaining the delay quality of service (QoS) requirements for the all users. The simulation results show that the proposed algorithm can provide a non-trivial trade-off between delay and energy efficiency in NOMA H-CRAN systems in terms of EC and EEE and the spectrum and power cooperation improves EEE of the proposed network. Moreover, our proposed solution complexity is much lower than the optimal solution and it suffers a very limited gap compared to the optimal method.

eess.SP↗