A nonlinear approach to interference alignment

  title={A nonlinear approach to interference alignment},
  author={Peyman Razaghi and G. Caire},
  journal={2011 IEEE International Symposium on Information Theory Proceedings},
  • P. RazaghiG. Caire
  • Published 1 June 2011
  • Computer Science
  • 2011 IEEE International Symposium on Information Theory Proceedings
Cadambe and Jafar (CJ) alignment strategy for the K-user scalar frequency-selective fading Gaussian channel, with encoding over blocks of 2n+1 random channel coefficients (subcarriers) is considered. The linear zero-forcing (LZF) strategy is compared with a novel approach based on lattice alignment and lattice decoding (LD). Despite both LZF and LD achieve the same degrees of freedom, it is shown that LD can achieve very significant improvements in terms of error rates at practical SNRs with… 

Figures from this paper

A comparison of decoding techniques for Interference Alignment

  • Vasileios NtranosG. Caire
  • Computer Science
    2012 5th International Symposium on Communications, Control and Signal Processing
  • 2012
This paper investigates the performance of the standard linear zero-forcing receiver, of linear integer forcing receivers, and of (non-linear) joint decoding implemented by lattice decoding with MMSE generalized decision feedback preprocessing and shows that the latter provides a significant improvement in terms of uncoded symbol error rate, averaged over the fading channel statistics.

Interference alignment with diversity for the 2 × 2 X network with four antennas

This paper proves that the proposed LJJ scheme achieves the maximum possible sum DoF of 16/3 and also proves that, using any fixed finite constellation with appropriate rotation at each Tx, the proposed scheme achieves a diversity gain of at least four.

Interference Alignment With Diversity for the 2 $\,\times\,$ 2 X-Network With Four Antennas

This paper proves that the proposed LJJ scheme achieves the maximum possible sum DoF of 16/3 and also proves that, using any fixed finite constellation with appropriate rotation at each Tx, the proposed scheme achieves a diversity gain of at least four.

Combining interference alignment and Alamouti codes for the 3-user MIMO interference channel

A scheme is proposed that combines the interference-cancellation capability of Alamouti codes with the subspace-overlapping property of interference alignment to achieve a sum-rate of three symbols/channel use and significantly improves the bit-error rate performance compared to zero-forcing techniques.

Interference alignment with diversity for the 2 × 2 X-Network with three antennas

  • A. GanesanB. S. Rajan
  • Computer Science, Business
    2014 IEEE International Symposium on Information Theory
  • 2014
A new STBC for a three transmit antenna single user MIMO system and the LJJ scheme, which is extended to the 2×2 X-Network with three antennas at each node, achieves the maximum possible sum DoF of 4.

Semi-blind interference alignment over correlated wireless channels

This paper mathematically analyze the impact of channel correlation and numerically show that S-BIA is more robust against the channel correlation than ordinary multiple-input multiple-output (MIMO) systems.

Analysis of lattice codes for the many-to-one interference channel

This paper considers the case of joint maximum-likelihood decoding of the desired signal and the sum of interfering signals, derives the union bound for the error probability in terms of the theta series of these lattices, and shows that it is related to the flatness factor.

Designing an overlay hybrid cognitive radio including channel estimation issues

La radio intelligente (RI) a ete proposee pour ameliorer l’utilisation du spectre radiofrequence. Pour cela, il s’agit de donner un acces opportuniste aux utilisateurs non licencies (nommes



Ergodic Interference Alignment

This paper develops a new communication strategy, ergodic interference alignment, for the K-user interference channel with time-varying fading, and shows how to generalize this strategy beyond Gaussian channel models.

Interference alignment at finite SNR: General message sets

A new achievability technique called ergodic interference alignment is extended to include more general message sets, including the multicast case where each transmitter has a message destined for more than one receiver.

Interference Alignment and Spatial Degrees of Freedom for the K User Interference Channel

  • V. CadambeS. Jafar
  • Computer Science
    2008 IEEE International Conference on Communications
  • 2008
We show that the sum capacity of the K user frequency selective (or time-varying) interference channel is C(SNR) = (K/2) log(SNR) +o(log(SNR)) meaning that the channel has a total of K/2 degrees of

On maximum-likelihood detection and the search for the closest lattice point

A novel algorithm is developed that is inspired by the Pohst enumeration strategy and is shown to offer a significant reduction in complexity compared to the Viterbo-Boutros sphere decoder and is supported by intuitive arguments and simulation results in many relevant scenarios.

Opportunistic beamforming using dumb antennas

This paper proposes a scheme that induces random fading when the environment has little scattering and/or the fading is slow, and focuses on the downlink of a cellular system.

The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels

A central theme emerges: the use of lattice codes for alignment of interfering signals on the signal level in the Gaussian interference channel to within a constant number of bits.

The two-user Gaussian interference channel: a deterministic view

The main result is that the deterministic channel uniformly approximates the Gaussian channel, the capacity regions differing by a universal constant.

A layered lattice coding scheme for a class of three user Gaussian interference channels

The layered lattice coding is shown to achieve more than one degree of freedom for a class of interference channels and also achieves rates which are better than the rates obtained using the Han-Kobayashi coding scheme.

Combinatiorial algorithms for wireless information flow

A polynomial-time algorithm is developed that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection, and uses a notion of linear independence between channels to calculate the capacity inPolynomial time.

Algebraic lattice alignment for K-user interference channels

A new achievable region for the K-user symmetric interference channel using algebraic interference alignment is developed using lattice codebooks to transform the interference channel into an equivalent noiseless discrete-alphabet additive interference channel.