Sorry, you need to enable JavaScript to visit this website.

The paper discusses different aspects in favor of using in-band full-duplex frontends for integrated sensing and communication (ISAC), considered for deployment of future 5G/6G infrastructure. Possible scenarios for practical utilization of the technology are discussed with additional focus on self-interference cancellation issue. An possible system implementation on abstract level is presented for cellular communication scenario.


We propose a novel method to optimize the structure of factor graphs for graph-based inference. As an example inference task, we consider symbol detection on linear inter-symbol interference channels. The factor graph framework has the potential to yield low-complexity symbol detectors. However, the sum-product algorithm on cyclic factor graphs is suboptimal and its performance is highly sensitive to the underlying graph. Therefore, we optimize the structure of the underlying factor graphs in an end-to-end manner using machine learning.


Although Intelligent Reflective Surfaces (IRSs) are a cost-effective technology promising high spectral efficiency in future wireless networks, obtaining optimal IRS beamformers is a challenging problem with several practical limitations. Assuming fully-passive, sensing- free IRS operation, we introduce a new data-driven Zeroth-order Stochastic Gradient Ascent (ZoSGA) algorithm for sumrate optimization in an IRS-aided downlink setting.


An reconfigurable intelligent surface (RIS) can be used to establish line-of-sight (LoS) communication when the direct path is compromised, which is a common occurrence in a millimeter wave (mmWave) network. In this paper, we focus on the uplink channel estimation of a such network. We formulate this as a sparse signal recovery problem, by discretizing the angle of arrivals (AoAs) at the base station (BS). On-grid and off-grid AoAs are considered separately. In the on-grid case, we propose an algorithm to estimate the direct and RIS channels.


Mobile base stations on board unmanned aerial vehicles (UAVs)
promise to deliver connectivity to those areas where the
terrestrial infrastructure is overloaded, damaged, or absent. A
fundamental problem in this context involves determining a
minimal set of locations in 3D space where such aerial base
stations (ABSs) must be deployed to provide coverage to a set of
users. While nearly all existing approaches rely on average
characterizations of the propagation medium, this work


The paper studies the motion control for mobile relays imple-
menting cooperative beamforming to aid the communication
between a source-destination pair. We consider an urban com-
munication scenario, where the channels exhibit spatiotempo-
ral correlations and thus can be learned. The relays move in a
time-slotted fashion within a three-dimensional cube. During
every slot, the relays beamform optimally to maximize the
Signal-to-Interference+Noise Ratio (SINR) at the destination


Wireless channels are considered that change over time but remain constant for a certain (coherence) period. This behavior is perfectly captured by block fading channels and affects the performance of the corresponding wireless communication systems. Desired closed-form characterizations of optimal transmission schemes remain unknown in many cases. This paper approaches this issue from a fundamental, algorithmic point of view by studying whether or not it is in principle possible to construct or find such optimal transmission


Wireless communication systems are inherently vulnerable to adversarial attacks since malevolent jammers might jam and disrupt the legitimate transmission intentionally. Of particular interest are so-called denial-of-service (DoS) attacks in which the jammer is able to completely disrupt the communication. Accordingly, it is of crucial interest for the legitimate users to detect such DoS attacks. Turing machines provide the fundamental limits of today’s digital computers and therewith of the traditional signal processing. It has been