Abstract
In this paper, we consider the discrete memoryless user relaying channel (DMURC) in which a user-relay switches its operational mode symbol-by-symbol. In particular, we obtain upper and lower bounds on the channel capacity for the general DMURC and then show that these the upper and lower bounds coincide for degraded DMURC. It is also shown that the capacity of the degraded DMURC can be achieved using two separate codebooks corresponding to the two UR states. While the UR is assumed to switch states symbol-by-symbol, the results in this paper is the same as when the UR switches states packet-by-packet.
| Original language | English |
|---|---|
| Pages (from-to) | 855-868 |
| Number of pages | 14 |
| Journal | KSII Transactions on Internet and Information Systems |
| Volume | 6 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2012 Mar 1 |
Fingerprint
Keywords
- Channel capacity
- Channel state information
- Cognitive radio
- CSI
- Relay channel
- User-relay
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
Cite this
Capacity bound for discrete memoryless user-relaying channel. / Moon, Ki Ryang; Yoo, Do Sik; Oh, Seong-Jun.
In: KSII Transactions on Internet and Information Systems, Vol. 6, No. 3, 01.03.2012, p. 855-868.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Capacity bound for discrete memoryless user-relaying channel
AU - Moon, Ki Ryang
AU - Yoo, Do Sik
AU - Oh, Seong-Jun
PY - 2012/3/1
Y1 - 2012/3/1
N2 - In this paper, we consider the discrete memoryless user relaying channel (DMURC) in which a user-relay switches its operational mode symbol-by-symbol. In particular, we obtain upper and lower bounds on the channel capacity for the general DMURC and then show that these the upper and lower bounds coincide for degraded DMURC. It is also shown that the capacity of the degraded DMURC can be achieved using two separate codebooks corresponding to the two UR states. While the UR is assumed to switch states symbol-by-symbol, the results in this paper is the same as when the UR switches states packet-by-packet.
AB - In this paper, we consider the discrete memoryless user relaying channel (DMURC) in which a user-relay switches its operational mode symbol-by-symbol. In particular, we obtain upper and lower bounds on the channel capacity for the general DMURC and then show that these the upper and lower bounds coincide for degraded DMURC. It is also shown that the capacity of the degraded DMURC can be achieved using two separate codebooks corresponding to the two UR states. While the UR is assumed to switch states symbol-by-symbol, the results in this paper is the same as when the UR switches states packet-by-packet.
KW - Channel capacity
KW - Channel state information
KW - Cognitive radio
KW - CSI
KW - Relay channel
KW - User-relay
UR - http://www.scopus.com/inward/record.url?scp=84859636849&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84859636849&partnerID=8YFLogxK
U2 - 10.3837/tiis.2012.03.005
DO - 10.3837/tiis.2012.03.005
M3 - Article
AN - SCOPUS:84859636849
VL - 6
SP - 855
EP - 868
JO - KSII Transactions on Internet and Information Systems
JF - KSII Transactions on Internet and Information Systems
SN - 1976-7277
IS - 3
ER -