Related papers: The Deterministic Time-Linearity of Service Provid…
In this work, we carry out a unified performance analysis of a dual-hop fixed gain relay system over asymmetric links composed of both radio-frequency (RF) and unified free-space optics (FSO) under the effect of pointing errors. The RF link…
We theoretically and numerically investigate the scattering behavior of a periodic parity-time (PT)-symmetric waveguide network composed of a finite number of unit cells. Specifically, we put forward rigorous and formally exact expressions…
The $\alpha$-$\eta$-$\kappa$-$\mu$ is one of the most generalized and flexible channel models having an excellent fit to experimental data from diverse propagation environments. The existing statistical results on the envelope of…
The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable…
Channel charting is an unsupervised learning method that aims at mapping wireless channels to a so-called chart, preserving as much as possible spatial neighborhoods. In this paper, a model-based deep learning approach to this problem is…
Memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol insertions and deletions in addition to random errors are considered. Such channels are information stable, hence their Shannon…
A delay-constrained scheduling problem for point-to-point communication is considered: a packet of $B$ bits must be transmitted by a hard deadline of $T$ slots over a time-varying channel. The transmitter/scheduler must determine how many…
Stochastic linear modelling proposed in Tissot, M\'emin & Cavalieri (J. Fluid Mech., vol. 912, 2021, A51) is based on classical conservation laws subject to a stochastic transport. Once linearised around the mean flow and expressed in the…
In this paper, we consider an overlay cognitive radio network, in which a secondary transmitter (ST) is willing to relay the information of a primary transmitter toward a primary receiver. In return, ST can access the licensed band to send…
In this work, we present a combinatorial, deterministic single-pass streaming algorithm for the problem of maximizing a submodular function, not necessarily monotone, with respect to a cardinality constraint (SMCC). In the case the function…
The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. This paper addresses the problem of extending the network…
In this paper, we consider uplink transmissions involving multiple users communicating with a base station over a fading channel. We assume that the base station does not coordinate the transmissions of the users and hence the users employ…
We consider the problem of multi-user spectrum access in wireless networks. The bandwidth is divided into K orthogonal channels, and M users aim to access the spectrum. Each user chooses a single channel for transmission at each time slot.…
Time-varying fast fading channels present a major challenge in the design of wireless communication systems. Pilot Symbol Assisted Modulation (PSAM) has been introduced to mitigate the effects of fading and allow coherent demodulation. Our…
The classical writing on dirty paper capacity result establishes that full interference pre-cancellation can be attained in Gelfand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the idealized…
In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity…
The effective rate of Fluctuating Beckmann (FB) fading channel is analysed. The moment generating function (MGF) of the instantaneous signal-to-noise (SNR) is used first to derive the effective rate for arbitrary values of the fading…
Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this…
Stochastic gradient descent in continuous time (SGDCT) provides a computationally efficient method for the statistical learning of continuous-time models, which are widely used in science, engineering, and finance. The SGDCT algorithm…
We consider a one-dimensional stationary time series of fixed duration $T$. We investigate the time $t_{\rm m}$ at which the process reaches the global maximum within the time interval $[0,T]$. By using a path-decomposition technique, we…