Back to Search
Start Over
Capacity of a class of deterministic relay channels
- Source :
- IEEE Transactions on Information Theory. March, 2008, Vol. 54 Issue 3, p1328, 2 p.
- Publication Year :
- 2008
-
Abstract
- The capacity of a class of deterministic relay channels with transmitter input X, receiver output Y, relay output [Y.sub.1] = f(X, Y), and separate noiseless communication link of capacity [R.sub.0] from the relay to the receiver, is shown to be C([R.sub.o]) = sup min{I(X:Y) + [R.sub.0], I(X:[Y.sub.1])}/p(x) Roughly speaking, every hit from the relay is worth one bit to the receiver until saturation at capacity. Index Terms--Capacity, deterministic relay channel, primitive relay channel.
- Subjects :
- United States
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 54
- Issue :
- 3
- Database :
- Gale General OneFile
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.176373916