Achievable Rates for K-User Gaussian Interference Channels
From MaRDI portal
Achievable Rates for $K$-User Gaussian Interference Channels
Abstract: The aim of this paper is to study the achievable rates for a 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.
Cited in
(8)- On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
- Decentralized K-User Gaussian Multiple Access Channels
- On Achievable Rate Regions for the Gaussian Interference Channel
- The Degrees-of-Freedom of the K-User Gaussian Interference Channel Is Discontinuous at Rational Channel Coefficients
- Optimal Achievable Rates for Interference Networks With Random Codes
- On the Capacity of the K-User Cyclic Gaussian Interference Channel
- On the Achievable Sum Rate for MIMO Interference Channels
- On the Achievable Rate Regions for Interference Channels With Degraded Message Sets
This page was built for publication: Achievable Rates for $K$-User Gaussian Interference Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271811)
