Layered space-time index coding

Yu-Chih (Jerry) Huang, Yi Hong, Emanuele Viterbo, Lakshmi Natarajan

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Multicasting K independent messages via multiple-input multiple-output channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBC), including perfect STBC, is proposed. We analyze the proposed LSTIC and show that it provides minimum determinant gains that are exponential with the amount of information contained in the side information for any possible side information. When constructed over a perfect STBC, the proposed LSTIC is itself a perfect STBC and hence many desired properties are preserved. To illustrate, we construct LSTIC over the following well-known STBCs: Golden code; 3 × 3, 4 × 4, and 6 × 6 perfect STBCs; and Alamouti code. Simulation results show that the obtained side information gain can be well predicted by our analysis.

Original languageEnglish
Article number8369135
Pages (from-to)142-158
Number of pages17
JournalIEEE Transactions on Information Theory
Volume65
Issue number1
DOIs
Publication statusPublished - 1 Jan 2019

Keywords

  • broadcast channels
  • Index coding
  • MIMO channel
  • side information
  • space-time block codes

Cite this

Huang, Yu-Chih (Jerry) ; Hong, Yi ; Viterbo, Emanuele ; Natarajan, Lakshmi. / Layered space-time index coding. In: IEEE Transactions on Information Theory. 2019 ; Vol. 65, No. 1. pp. 142-158.
@article{528939a7ca7f400c801b06743ebe334e,
title = "Layered space-time index coding",
abstract = "Multicasting K independent messages via multiple-input multiple-output channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBC), including perfect STBC, is proposed. We analyze the proposed LSTIC and show that it provides minimum determinant gains that are exponential with the amount of information contained in the side information for any possible side information. When constructed over a perfect STBC, the proposed LSTIC is itself a perfect STBC and hence many desired properties are preserved. To illustrate, we construct LSTIC over the following well-known STBCs: Golden code; 3 × 3, 4 × 4, and 6 × 6 perfect STBCs; and Alamouti code. Simulation results show that the obtained side information gain can be well predicted by our analysis.",
keywords = "broadcast channels, Index coding, MIMO channel, side information, space-time block codes",
author = "Huang, {Yu-Chih (Jerry)} and Yi Hong and Emanuele Viterbo and Lakshmi Natarajan",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/TIT.2018.2842144",
language = "English",
volume = "65",
pages = "142--158",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
number = "1",

}

Layered space-time index coding. / Huang, Yu-Chih (Jerry) ; Hong, Yi; Viterbo, Emanuele; Natarajan, Lakshmi.

In: IEEE Transactions on Information Theory, Vol. 65, No. 1, 8369135, 01.01.2019, p. 142-158.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Layered space-time index coding

AU - Huang, Yu-Chih (Jerry)

AU - Hong, Yi

AU - Viterbo, Emanuele

AU - Natarajan, Lakshmi

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Multicasting K independent messages via multiple-input multiple-output channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBC), including perfect STBC, is proposed. We analyze the proposed LSTIC and show that it provides minimum determinant gains that are exponential with the amount of information contained in the side information for any possible side information. When constructed over a perfect STBC, the proposed LSTIC is itself a perfect STBC and hence many desired properties are preserved. To illustrate, we construct LSTIC over the following well-known STBCs: Golden code; 3 × 3, 4 × 4, and 6 × 6 perfect STBCs; and Alamouti code. Simulation results show that the obtained side information gain can be well predicted by our analysis.

AB - Multicasting K independent messages via multiple-input multiple-output channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBC), including perfect STBC, is proposed. We analyze the proposed LSTIC and show that it provides minimum determinant gains that are exponential with the amount of information contained in the side information for any possible side information. When constructed over a perfect STBC, the proposed LSTIC is itself a perfect STBC and hence many desired properties are preserved. To illustrate, we construct LSTIC over the following well-known STBCs: Golden code; 3 × 3, 4 × 4, and 6 × 6 perfect STBCs; and Alamouti code. Simulation results show that the obtained side information gain can be well predicted by our analysis.

KW - broadcast channels

KW - Index coding

KW - MIMO channel

KW - side information

KW - space-time block codes

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

U2 - 10.1109/TIT.2018.2842144

DO - 10.1109/TIT.2018.2842144

M3 - Article

VL - 65

SP - 142

EP - 158

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

M1 - 8369135

ER -