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

@article{Khaleghi2015StructuredCW, 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)}, year={2015}, pages={41-45} }

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

#### References

SHOWING 1-10 OF 15 REFERENCES

Compute-and-forward: Harnessing interference with structured codes

- 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

- Computer Science, Mathematics
- 2014 Iran Workshop on Communication and Information Theory (IWCIT)
- 2014

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

- Mathematics, Computer Science
- 2014 IEEE International Symposium on Information Theory
- 2014

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

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2014

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

- Physics, Computer Science
- IEEE Transactions on Information Theory
- 2014

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

- Mathematics, Computer Science
- IEEE Transactions on Signal Processing
- 2009

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

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1983

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

- Physics, Computer Science
- IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
- 2008

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

- Computer Science
- 1961

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.)

- Computer Science
- IEEE Trans. Inf. Theory
- 1975

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.