Achievable degrees of freedom on K-user y channels

Kwangwon Lee, Namyoon Lee, Inkyu Lee

Research output: Contribution to journalArticle

67 Citations (Scopus)

Abstract

In this paper, we consider K-user Y channels where K users simultaneously exchange messages with each other via an intermediate relay. Degrees of freedom (DOF) of Y channels with multiple antennas is not known in general. Investigation of the feasibility conditions of signal space alignment for network coding is an initial step for addressing this open problem. We verify that when user i with M i antennas sends K-1 independent messages to the other users through a relay with N antennas and each message achieves the DOF of d, the total DOF of dK(K-1) is attained if M i d(K-1), N≥ dK(K-1)}/2 and N < min{ i+M j-d

Original languageEnglish
Article number6144762
Pages (from-to)1210-1219
Number of pages10
JournalIEEE Transactions on Wireless Communications
Volume11
Issue number3
DOIs
Publication statusPublished - 2012 Mar 1

Fingerprint

Degree of freedom
Antennas
Relay
Antenna
Network coding
Multiple Antennas
Network Coding
Open Problems
Alignment
Verify

Keywords

  • Degrees of freedom
  • interference alignment
  • network coding
  • Y channels

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Achievable degrees of freedom on K-user y channels. / Lee, Kwangwon; Lee, Namyoon; Lee, Inkyu.

In: IEEE Transactions on Wireless Communications, Vol. 11, No. 3, 6144762, 01.03.2012, p. 1210-1219.

Research output: Contribution to journalArticle

Lee, Kwangwon ; Lee, Namyoon ; Lee, Inkyu. / Achievable degrees of freedom on K-user y channels. In: IEEE Transactions on Wireless Communications. 2012 ; Vol. 11, No. 3. pp. 1210-1219.
@article{44af42eb9c92497ea15d24b235847dd2,
title = "Achievable degrees of freedom on K-user y channels",
abstract = "In this paper, we consider K-user Y channels where K users simultaneously exchange messages with each other via an intermediate relay. Degrees of freedom (DOF) of Y channels with multiple antennas is not known in general. Investigation of the feasibility conditions of signal space alignment for network coding is an initial step for addressing this open problem. We verify that when user i with M i antennas sends K-1 independent messages to the other users through a relay with N antennas and each message achieves the DOF of d, the total DOF of dK(K-1) is attained if M i d(K-1), N≥ dK(K-1)}/2 and N < min{ i+M j-d",
keywords = "Degrees of freedom, interference alignment, network coding, Y channels",
author = "Kwangwon Lee and Namyoon Lee and Inkyu Lee",
year = "2012",
month = "3",
day = "1",
doi = "10.1109/TWC.2012.012712.111194",
language = "English",
volume = "11",
pages = "1210--1219",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Achievable degrees of freedom on K-user y channels

AU - Lee, Kwangwon

AU - Lee, Namyoon

AU - Lee, Inkyu

PY - 2012/3/1

Y1 - 2012/3/1

N2 - In this paper, we consider K-user Y channels where K users simultaneously exchange messages with each other via an intermediate relay. Degrees of freedom (DOF) of Y channels with multiple antennas is not known in general. Investigation of the feasibility conditions of signal space alignment for network coding is an initial step for addressing this open problem. We verify that when user i with M i antennas sends K-1 independent messages to the other users through a relay with N antennas and each message achieves the DOF of d, the total DOF of dK(K-1) is attained if M i d(K-1), N≥ dK(K-1)}/2 and N < min{ i+M j-d

AB - In this paper, we consider K-user Y channels where K users simultaneously exchange messages with each other via an intermediate relay. Degrees of freedom (DOF) of Y channels with multiple antennas is not known in general. Investigation of the feasibility conditions of signal space alignment for network coding is an initial step for addressing this open problem. We verify that when user i with M i antennas sends K-1 independent messages to the other users through a relay with N antennas and each message achieves the DOF of d, the total DOF of dK(K-1) is attained if M i d(K-1), N≥ dK(K-1)}/2 and N < min{ i+M j-d

KW - Degrees of freedom

KW - interference alignment

KW - network coding

KW - Y channels

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

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

U2 - 10.1109/TWC.2012.012712.111194

DO - 10.1109/TWC.2012.012712.111194

M3 - Article

AN - SCOPUS:84863373526

VL - 11

SP - 1210

EP - 1219

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 3

M1 - 6144762

ER -