z-logo
open-access-imgOpen Access
Max–min fairness based linear transceiver–relay design for MIMO interference relay channel
Author(s) -
Singh Vindheshwari P.,
Chaturvedi Ajit Kumar
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2017.0034
Subject(s) - relay , transceiver , mimo , interference (communication) , computer science , relay channel , channel (broadcasting) , telecommunications , computer network , electronic engineering , wireless , physics , engineering , power (physics) , quantum mechanics
In this work, the authors investigate a multi‐user multi‐input multi‐output (MIMO) interference relay system, where several transmitter nodes simultaneously communicate with their respective receiver nodes through half‐duplex MIMO amplify and forward (AF) relay nodes. For this system configuration, they address the problem of linear transceiver–relay design to achieve max–min fairness among all the users' data streams. Assuming perfect channel state information, this problem is formulated as the maximisation of the minimum signal‐to‐interference‐plus‐noise ratio (SINR) per stream among all the users subject to transmit power constraints at the transmitter and relay nodes. Since the formulated problem of jointly optimising all the transmitters, relays and receivers is non‐convex, a globally optimal solution cannot be easily obtained. Therefore, they propose a quasi‐optimal iterative algorithm to jointly optimise the transmitter precoders, relay precoding matrices and receiver filters for all the users and relays such that the minimum per stream received SINR is improved at each iteration. Simulation results show that the proposed algorithm improves fairness among data‐streams of all users and outperforms existing strategies in terms of minimum user rate and bit error rate.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here