Steepest Gradient-Based Orthogonal Precoder for Integer-Forcing MIMO

@article{Hasan2020SteepestGO,
  title={Steepest Gradient-Based Orthogonal Precoder for Integer-Forcing MIMO},
  author={Mohammad Nur Hasan and Brian M. Kurkoski and Amin Sakzad and Emanuele Viterbo},
  journal={IEEE Transactions on Wireless Communications},
  year={2020},
  volume={19},
  pages={942-955}
}
In this paper, we develop an orthogonal precoding scheme for integer-forcing (IF) linear receivers using the steepest gradient algorithm. Although this scheme can be viewed as a special case of the unitary precoded integer-forcing (UPIF), it has two major advantages. First, the orthogonal precoding outperforms its unitary counterpart in terms of achievable rate, outage probability, and error rate. We verify this advantage via theoretical and numerical analyses. Second, it exhibits lower… 

Figures from this paper

Orthogonal Precoder for Integer-Forcing MIMO

TLDR
This paper focuses on orthogonal precoding for integer-forcing linear receiver and shows it has two advantages over unitary precoding: lower complexity and low complexity and it outperforms X-precoders which are designed specifically for QAM.

Vandermonde-Based Unitary Precoding Method for Integer-Forcing Design

TLDR
Simulation results show that the proposed scheme can achieve the performance similar to the benchmark schemes but with much lower complexity, and offers a good trade-off between performance and complexity.

Improvement of intelligibility and naturalness of speech in noise inspired by Lombard effect

of Doctoral Dissertation Improvement of intelligibility and naturalness of speech in noise inspired by Lombard effect For doctor degree of information science Ph.D. candidate: Thuanvan Ngo 1720010

Precise Performance Characterization of Precoded Integer Forcing Applied to Two Parallel Channels

  • Y. RegevU. Erez
  • Computer Science
    IEEE Transactions on Wireless Communications
  • 2021
TLDR
The present work provides a precise performance characterization when integer-forcing equalization is applied to two parallel channels and where precoding is done using the full-diversity rotation matrix cyclo2, and shows that this scheme achieves capacity up to a gap bounded by log 2.

References

SHOWING 1-10 OF 43 REFERENCES

Orthogonal Precoder for Integer-Forcing MIMO

TLDR
This paper focuses on orthogonal precoding for integer-forcing linear receiver and shows it has two advantages over unitary precoding: lower complexity and low complexity and it outperforms X-precoders which are designed specifically for QAM.

An efficient optimal algorithm for integer-forcing linear MIMO receivers design

TLDR
Simulation results show the optimality of the novel algorithm proposed and indicates that the new one is much more efficient than existing optimal algorithms.

Extension of the MIMO Precoder Based on the Minimum Euclidean Distance: A Cross-Form Matrix

TLDR
The new precoder, Equal-dm;n (E-dmin), is based on a non diagonal cross-form structure that significantly enhances the transmit diversity in the eigen-subchannels and demonstrates that the achieved diversity order is greater than that of precoders with diagonal structure for the same number of datastreams despite a tradeoff between rate and diversity.

Full Diversity Unitary Precoded Integer-Forcing

TLDR
It is shown that UPIF can achieve full-diversity under a constraint based on the shortest vector of a lattice generated by the precoding matrix P and that the proposed Type II UPIF outperform the MIMO precoding X-codes at high data rates.

Integer-Forcing MIMO Linear Receivers Based on Lattice Reduction

TLDR
A method based on Hermite-Korkine-Zolotareff (HKZ) and Minkowski lattice basis reduction algorithms to obtain the integer coefficients for the IF receiver is proposed and shows that the proposed method provides a lower bound on the ergodic rate, and achieves the full receive diversity.

Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint

TLDR
A Riemannian geometry approach for optimization of a real-valued cost function T of complex-valued matrix argument W, under the constraint that W is an n times n unitary matrix, is proposed.

Exact SMP Algorithms for Integer-Forcing Linear MIMO Receivers

TLDR
Two practical algorithms are constructed to solve SMP exactly for real and complex lattices respectively and achieve practically the same performance as Minkowski reduction for the IF linear receiver, as the Minkowsky-reduced basis approximates successive minima very closely.

Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection

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

Efficient Integer Coefficient Search for Compute-and-Forward

TLDR
An efficient search algorithm is proposed to find the optimal integer coefficient vectors over the ring of Gaussian integer and Eisenstein integers over the complex valued channel and it is proposed that this algorithm generalizes to the integer-forcing multiple-input multiple-output C-F receiver.

Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap

TLDR
It is shown that this communication architecture achieves the capacity of any Gaussian MIMO channel up to a gap that depends only on the number of transmit antennas.