Related papers: Asymmetric Compute-and-Forward with CSIT
-In this work, we focus on the K--user Gaussian Symmetric Complex-valued Interference Channels (GS-CIC). The Compute-and-Forward (CoF) protocol in wireless networks have been employed for Gaussian Symmetric Real-valued Interference Channels…
Recent information theoretic results suggest that precoding on the multi-user downlink MIMO channel with delayed channel state information at the transmitter (CSIT) could lead to data rates much beyond the ones obtained without any CSIT,…
The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference toward achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. While there…
Building on the well-established connection between the Hilbert transform and derivative operators, and motivated by recent developments in complex-step differentiation, we introduce the Complex-Step Integral Transform (CSIT): a generalized…
Compute-and-forward (CF) harnesses interference in a wireless networkby allowing relays to compute combinations of source messages. The computed message combinations at relays are correlated, and so directly forwarding these combinations to…
A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…
To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…
In many wireless systems, the channel state information at the transmitter (CSIT) can not be learned until after a transmission has taken place and is thereby outdated. In this paper, we study the benefits of delayed CSIT on a block-fading…
The Compute-and-Forward protocol in quasi-static channels normally employs lattice codes based on the rational integers $\mathbb{Z}$, Gaussian integers $\mathbb{Z}\left[i\right]$ or Eisenstein integers $\mathbb{Z}\left[\omega\right]$, while…
In this work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal…
Conventional MU-MIMO techniques, e.g. Linear Zero-Forced Beamforming (LZFB), require sufficiently accurate channel state information at the transmitter (CSIT) in order to realize spectral efficient transmission (degree of freedom gains). In…
This paper proposes an adaptive multi-mode transmission strategy to improve the spectral efficiency achieved in the multiple-input multiple-output (MIMO) broadcast channel with delayed and quantized channel state information. The adaptive…
Most multiuser precoding techniques require accurate transmitter channel state information (CSIT) to maintain orthogonality between the users. Such techniques have proven quite fragile in time-varying channels because the CSIT is inherently…
In this paper, we propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior…
In this paper, we consider a $n_t\times n_r$ multiple-input multiple-output (MIMO) channel subjected to block fading. Reliability (in terms of achieved diversity order) and rate (in number of symbols transmitted per channel use) are of…
We consider the compute-and-forward paradigm with limited feedback. Without feedback, compute-and-forward is typically realized with lattice codes over the ring of integers, the ring of Gaussian integers, or the ring of Eisenstein integers,…
Lattice codes used under the Compute-and-Forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): The receiver successively decodes integer linear combinations of the messages until it can…
Communication in the presence of bounded timing asynchronism which is known to the receiver but cannot be easily compensated is studied. Examples of such situations include point-to-point communication over inter-symbol interference (ISI)…
We consider a Gaussian multiple access channel with $K$ transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper.…
Reinforcement algorithms refer to the schemes where the results of the previous trials and a reward-punishment rule are used for parameter setting in the next steps. In this paper, we use the concept of reinforcement algorithms to develop…