Integer-Forcing Linear Receiver Design with Slowest Descent Method

03/01/2020
by   Lili Wei, et al.
0

Compute-and-forward (CPF) strategy is one category of network coding in which a relay will compute and forward a linear combination of source messages according to the observed channel coefficients, based on the algebraic structure of lattice codes. Recently, based on the idea of CPF, integer forcing (IF) linear receiver architecture for MIMO system has been proposed to recover different integer combinations of lattice codewords for further original message detection. In this paper, we consider the problem of IF linear receiver design with respect to the channel conditions. Instead of exhaustive search, we present practical and efficient suboptimal algorithms to design the IF coefficient matrix with full rank such that the total achievable rate is maximized, based on the slowest descent method. Numerical results demonstrate the effectiveness of our proposed algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 8

research
03/01/2020

Compute-and-Forward Network Coding Design over Multi-Source Multi-Relay Channels

Network coding is a new and promising paradigm for modern communication ...
research
10/03/2022

On Lattice-Code based Multiple Access: Uplink Architecture and Algorithms

This paper studies a lattice-code based multiple-access (LCMA) framework...
research
05/05/2018

Ring Compute-and-Forward over Block-Fading Channels

The Compute-and-Forward protocol in quasi-static channels normally emplo...
research
10/01/2021

A Unified Discretization Approach to Compute-Forward: From Discrete to Continuous Inputs

Compute-forward is a coding technique that enables receiver(s) in a netw...
research
06/08/2018

Performance Limits of Lattice Reduction over Imaginary Quadratic Fields with Applications to Compute-and-Forward

In this work, we first examine both Hermite's constant and Minkowski's t...
research
05/14/2018

Some Properties of Successive Minima and Their Applications

A lattice is a set of all the integer linear combinations of certain lin...
research
12/14/2017

Achievability Performance Bounds for Integer-Forcing Source Coding

Integer-forcing source coding has been proposed as a low-complexity meth...

Please sign up or login with your details

Forgot password? Click here to reset