• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Capacity Bound for Discrete Memoryless User-Relaying Channel

Vol. 6, No.3, March 23, 2012
10.3837/tiis.2012.03.005, Download Paper (Free):

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.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Ki-Ryang Moon, Do-Sik Yoo and Seong-Jun Oh, "Capacity Bound for Discrete Memoryless User-Relaying Channel," KSII Transactions on Internet and Information Systems, vol. 6, no. 3, pp. 855-868, 2012. DOI: 10.3837/tiis.2012.03.005

[ACM Style]
Moon, K., Yoo, D., and Oh, S. 2012. Capacity Bound for Discrete Memoryless User-Relaying Channel. KSII Transactions on Internet and Information Systems, 6, 3, (2012), 855-868. DOI: 10.3837/tiis.2012.03.005