[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.3837/tiis.2012.03.005

Capacity Bound for Discrete Memoryless User-Relaying Channel

Moon, Ki-Ryang (College of Information and Communications, Korea University)
Yoo, Do-Sik (School of Electronic and Electrical Engineering, Hongik University)
Oh, Seong-Jun (College of Information and Communications, Korea University)

Publication Information

KSII Transactions on Internet and Information Systems (TIIS) / v.6, no.3, 2012 , pp. 855-868 More about this Journal

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.

Keywords

User-relay; relay channel; channel capacity; channel state information; CSI; Cognitive radio;

Citations & Related Records

Times Cited By Web Of Science : 0 (Related Records In Web of Science)

Reference

1	T.M. Cover and A.A. El Gamal, "Capacity theorems for the relay channel," IEEE Transactions on Information Theory, vol.25, no.5, pp.572-584, Sept.1979. DOI
2	J.N. Laneman, D.N.C. Tse and G.W. Wornell, "Cooperative diversity in wireless networks: Efficient protocols and outage behavior," IEEE Transactions on Information Theory, vol.50, no.12, pp.3062-3080, Dec.2004. DOI ScienceOn
3	J.N. Laneman and G.W. Wornell, "Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks," IEEE Transactions on Information Theory, vol.49, no.10, pp.2415-2425, Oct.2003. DOI ScienceOn
4	J. Cai, X. Shen, J.W. Mark and A.S. Alfa, "Semi-distributed user relaying algorithm for amplify-and-forward wireless relay networks," IEEE Transactions on Wireless Communications, vol.7, no.4, pp.1348-1357, Apr.2008. DOI
5	J. Cai, A.S. Alfa, P. Ren, X. Shen and J.W. Mark, "Packet level performance analysis in wireless user-relaying networks," IEEE Transactions on Wireless Communications, vol.7, no.12, pp.5336-5345, Dec.2008. DOI
6	C.E. Shannon, "Channels with the side information at the transmitter," IBM Journal of Research and Development, vol.2, no.4, pp.289-293, Oct.1958. DOI
7	S. Sigurjonsson and Y.H. Kim, "On multiple user channels with state information at the transmitters," IEEE Interactional Symposium on Information Theory, pp.72-76, Sept.2005.
8	A. Zaidi, L. Vandendorpe and P. Duhamel, "Lower bounds on the capacity regions of the relay channel and the cooperative relay-broadcast channel with non-causal side information," in Proc. of IEEE International Conference on Communication, pp.6005-6011, Jun.2007.
9	B. Akhbari, M. Mirmohseni and M.R. Aref, "Compress-and-forward strategy for relay channel with causal and non-causal channel state information," IET Communications, vol.4, no.10, pp.1174-1186, Jul.2010. DOI ScienceOn
10	A. Zaidi, S. P. Kotagiri and J. N. Laneman, "Cooperative relaying with state available non-causally at the relay," IEEE Trans. on Information Theory, vol.56, no.5, pp.2272-2298, May.2010. DOI