pith. sign in

arxiv: 1109.5336 · v1 · pith:SJ76NFRDnew · submitted 2011-09-25 · 💻 cs.IT · math.IT

Achievable Rates for K-user Gaussian Interference Channels

classification 💻 cs.IT math.IT
keywords codesalgebraicgaussianinterferencerateschannelachievableachieve
0
0 comments X
read the original abstract

The aim of this paper is to study the achievable rates for a $K$ user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel (G-IFC) into a discrete input-output noiseless channel, and subsequently algebraic codes are developed to achieve good rates over this new alphabet. In this context, a quantity called efficiency is introduced which reflects the effectiveness of the algebraic coding strategy. The paper first addresses the problem of finding high efficiency algebraic codes. A combination of these codes with Construction-A lattices is then used to achieve non trivial rates for the original Gaussian interference channel.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.