Achievable Degrees of Freedom for Closed-form Solution to Interference Alignment and Cancellation in Gaussian Interference Multiple Access Channel

08/01/2019
by   Qu Xin, et al.
0

A combined technique of interference alignment (IA) and interference cancellation (IC), known as interference alignment and cancellation (IAC) scheme, has been proposed to improve the total achievable degrees of freedom (DoFs) over IA. Since it is NP-hard to solve the transceiver under a given tuple of DoFs or to maximize the total achievable DoFs in the general system configuration by IA (or IAC), the optimal transceiver cannot be obtained in polynomial time. Meanwhile, it has been known that a closed-form yet suboptimal transceiver can be designed for IAC by employing a symbol-to-symbol (STS) alignment structure. As its performance has not been known yet, we aim to derive the total DoFs that can be achieved by such suboptimal but closed-form IAC transceivers for Gaussian interference multiple access channels with K receivers and J users (transmitters), each with M antennas. Our analysis shows that the closed-form IAC transceivers under consideration can achieve a maximum total achievable DoFs of 2M, which turns out to be larger than those achieved in classical IA, e.g., 2MK/(K+1) DoFs by a specific configuration where each link has the same target DoFs. Moreover, considering the NP-hardness of deriving the maximum total achievable DoFs with the optimal IAC transceiver, its upper bound has been derived for comparison with the results of our closed-form IAC transceiver. Numerical results illustrate that its performance can be guaranteed within 20 access channels are relatively small, e.g., K <=4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2018

On the Optimality of Treating Interference as Noise for Interfering Multiple Access Channels

In this paper, we look at the problem of treating interference as noise ...
research
12/12/2017

On the Gaussian Multiple Access Wiretap Channel and the Gaussian Wiretap Channel with a Helper: Achievable Schemes and Upper Bounds

We study deterministic approximations of the Gaussian two-user multiple ...
research
08/27/2018

Novel Time Asynchronous NOMA schemes for Downlink Transmissions

In this work, we investigate the effect of time asynchrony in non-orthog...
research
01/22/2020

Reconfigurable Intelligent Surface assisted Two-Way Communications: Performance Analysis and Optimization

In this paper, we investigate the two-way communication between two user...
research
07/27/2018

Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution

In this letter, we study the optimal solution of the multiuser symbol-le...
research
08/15/2023

On the Degrees of Freedom and Eigenfunctions of Line-of-Sight Holographic MIMO Communications

We consider a line-of-sight communication link between two holographic s...

Please sign up or login with your details

Forgot password? Click here to reset