Low-Complexity Integer-Forcing Methods for Block Fading MIMO Multiple-Access Channels

TL;DR

This paper introduces low-complexity integer-forcing techniques for block fading MIMO multiple-access channels, achieving near-optimal rates with practical implementation using root LDPC codes.

Contribution

It proposes sub-optimal, low-complexity algorithms for selecting integer coefficients in integer-forcing receivers for block fading MIMO channels, enhancing practicality.

Findings

Performance close to optimal in achievable rates

Low-complexity algorithms for coefficient selection

Effective implementation with root LDPC codes

Abstract

Integer forcing is an alternative approach to conventional linear receivers for multiple-antenna systems. In an integer-forcing receiver, integer linear combinations of messages are extracted from the received matrix before each individual message is recovered. Recently, the integer-forcing approach was generalized to a block fading scenario. Among the existing variations of the scheme, the ones with the highest achievable rates have the drawback that no efficient algorithm is known to find the best choice of integer linear combination coefficients. In this paper, we propose several sub-optimal methods to find these coefficients with low complexity, covering both parallel and successive interference cancellation versions of the receiver. Simulation results show that the proposed methods attain a performance close to optimal in terms of achievable rates for a given outage probability. Moreover, a low-complexity implementation using root LDPC codes is developed, showing that the benefits of the proposed methods also carry on to practice.