KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

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)
  • Received : 2011.10.19
  • Accepted : 2012.02.13
  • Published : 2012.03.30
Download PDF
⟨ Previous Next ⟩

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

References

  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. https://doi.org/10.1109/TIT.1979.1056084
  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. https://doi.org/10.1109/TIT.2004.838089
  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. https://doi.org/10.1109/TIT.2003.817829
  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. https://doi.org/10.1109/TWC.2008.060909
  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. https://doi.org/10.1109/T-WC.2008.070960
  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. https://doi.org/10.1147/rd.24.0289
  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. https://doi.org/10.1049/iet-com.2009.0399
  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. https://doi.org/10.1109/TIT.2010.2043782