Capacity Theorems for the Finite-State Broadcast Channel with Feedback

被引：2

作者：

Dabora, Ron ^{[1
]}

Goldsmith, Andrea ^{[1
]}

机构：

[1] Stanford Univ, Dept Elect Engn, Wireless Syst Lab, Stanford, CA 94305 USA

来源：

2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6 | 2008年

关键词：

D O I：

10.1109/ISIT.2008.4595281

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set or finite cardinatity. We study the achievable rates in two scenarios where feedback (and cooperation) is available. One scenario is the general finite-state broadcast channel (FSBC) where both receivers send feedback to the transmitter, and in addition one receiver sends his channel outputs to the other receiver through a cooperation link. The second scenario is the degraded FSBC where only the strong receiver sends feedback to the transmitter. We find the capacity regions for both cases. In both scenarios we consider non-indecomposable as well as a class of indecomposable FSBCs.

引用

页码：1716 / 1720

页数：5

共 12 条

[1]

Cover TM, 2006, Elements of Information Theory

[2]

DABORA R, 2008, INF THEOR W IN PRESS

[3]

ELGAMAL A, 1978, IEEE T INFORM THEORY, V24, P379, DOI 10.1109/TIT.1978.1055885

[4]

Gallager R. G., 1974, Problems Peredachi Inf., V10, P3

[5]

Gallager R. G., 1968, INFORM THEORY RELIAB

[6]

HOLLIDAY T, 2006, IEEE TR IT, V52

[7] THE BASIC THEOREMS OF INFORMATION THEORY [J].

MCMILLAN, B .

ANNALS OF MATHEMATICAL STATISTICS, 1953, 24 (02) :196-219

[8]

OZAROW LH, 1979, THESIS MIT CAMBRIDGE

[9]

PERMUTER H, 2007, IEEE T INFORM UNPUB

[10]

PERMUTER H, IEEE T IT UNPUB

← 1 2 →