Discrete-time Gaussian interfere-relay channel

Kiryang Moon, Do Sik Yoo, Seong-Jun Oh

Research output: Contribution to journalArticle

Abstract

In practical wireless relay communication systems, nondestination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.

Original languageEnglish
Article number7575796
Pages (from-to)299-310
Number of pages12
JournalJournal of Communications and Networks
Volume18
Issue number3
DOIs
Publication statusPublished - 2016 Jun 1

Fingerprint

Bandwidth
Routing algorithms
Communication systems

Keywords

  • Capacity
  • Gaussian interference channel
  • relay
  • relaychannel capacity.

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

Discrete-time Gaussian interfere-relay channel. / Moon, Kiryang; Yoo, Do Sik; Oh, Seong-Jun.

In: Journal of Communications and Networks, Vol. 18, No. 3, 7575796, 01.06.2016, p. 299-310.

Research output: Contribution to journalArticle

Moon, Kiryang ; Yoo, Do Sik ; Oh, Seong-Jun. / Discrete-time Gaussian interfere-relay channel. In: Journal of Communications and Networks. 2016 ; Vol. 18, No. 3. pp. 299-310.
@article{622480abb27e4b5d8ea4295974c78ca8,
title = "Discrete-time Gaussian interfere-relay channel",
abstract = "In practical wireless relay communication systems, nondestination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.",
keywords = "Capacity, Gaussian interference channel, relay, relaychannel capacity.",
author = "Kiryang Moon and Yoo, {Do Sik} and Seong-Jun Oh",
year = "2016",
month = "6",
day = "1",
doi = "10.1109/JCN.2016.000045",
language = "English",
volume = "18",
pages = "299--310",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "3",

}

TY - JOUR

T1 - Discrete-time Gaussian interfere-relay channel

AU - Moon, Kiryang

AU - Yoo, Do Sik

AU - Oh, Seong-Jun

PY - 2016/6/1

Y1 - 2016/6/1

N2 - In practical wireless relay communication systems, nondestination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.

AB - In practical wireless relay communication systems, nondestination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.

KW - Capacity

KW - Gaussian interference channel

KW - relay

KW - relaychannel capacity.

UR - http://www.scopus.com/inward/record.url?scp=84990237453&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990237453&partnerID=8YFLogxK

U2 - 10.1109/JCN.2016.000045

DO - 10.1109/JCN.2016.000045

M3 - Article

AN - SCOPUS:84990237453

VL - 18

SP - 299

EP - 310

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 3

M1 - 7575796

ER -