Structured Compute-and-Forward with phase precoding scheme: Beyond integers

  title={Structured Compute-and-Forward with phase precoding scheme: Beyond integers},
  author={Ehsan Ebrahimi Khaleghi and Jean-Claude Belfiore},
  journal={2015 International Symposium on Wireless Communication Systems (ISWCS)},
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 (GS-RIC) to achieve approximately the capacity of such channels and making Interference Alignment (IA) by solving a system of linear equations at destinations. We aim to adapt this protocol to GS-CIC. At high Signal-to-Noise Ratio (SNR), this protocol shows a… Expand


Compute-and-forward: Harnessing interference with structured codes
  • B. Nazer, M. Gastpar
  • Mathematics, Computer Science
  • 2008 IEEE International Symposium on Information Theory
  • 2008
This work views interference as creating linear equations of codewords and that a receiver's goal is to collect a full rank set of such equations, and develops a new relaying technique, compute-and-forward, which uses structured codes to reliably compute functions over channels. Expand
Compute-and-forward for the interference channel: Diversity precoding
A novel precoding technique based on the Golden Ratio is proposed to scale down the fadings experiences by the achievable sum-rate at high SNR. Expand
Phase precoded compute-and-forward with partial feedback
The phase precoded CoF with partial feedback is introduced and it is shown that it is greater than the original computation rate of CoF protocol without precoder. Expand
The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel
A new framework for lattice interference alignment, based on the compute-and-forward approach, is developed, which shows that decoding K linear combinations of the codewords can approach the sum capacity of the K-user Gaussian multiple-access channel up to a gap of no more than K/2 log K bits. Expand
Real Interference Alignment: Exploiting the Potential of Single Antenna Systems
It is proved that constellations can be aligned in a similar fashion as that of vectors in multiple antenna systems and space can be broken up into fractional dimensions. Expand
Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
This paper introduces the complex LLL algorithm for direct application to reducing the basis of a complex lattice which is naturally defined by a complex-valued channel matrix, and derives an upper bound on proximity factors, which not only shows the full diversity of complex L LL reduction-aided detectors, but also characterize the performance gap relative to the lattice decoder. Expand
A fast encoding method for lattice codes and quantizers
A solution to the inverse problem for the same lattices, namely, given an integer k, to find the kth code vector, and to the closely related problem of finding the index k of a given code vector. Expand
Capacity of Symmetric K-User Gaussian Very Strong Interference Channels
A "very strong" interference regime is derived for a symmetric K user Gaussian interference channel where the capacity region of the interference channel is the same as the capacity area of the channel with no interference. Expand
Two-way Communication Channels
This work wishes to determine what pairs of signalling rates R1 and R2 for the two directions can be approached with arbitrarily small error probabilities. Expand
A case where interference does not reduce capacity (Corresp.)
It is shown that, under certain conditions, two strongly interfering communication links with additive white Gaussian noise can achieve rates as high as would be achievable without this interference.