A new capacity upper bound for "relay-with-delay" channel

  • Authors:

  • Amir Salimi;Mahtab Mirmohseni;Mohammad-Reza Aref

  • Affiliations:

  • Coding and Cryptography Laboratory, E. E. Department, K. N. Toosi University of Technology, Tehran, Iran;ISSL Laboratory, E. E. Department, Sharif University of Technology, Tehran, Iran;ISSL Laboratory, E. E. Department, Sharif University of Technology, Tehran, Iran

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we prove a new capacity upper bound for a class of relay channels known as Relay-With-Delay channels. The proposed bound is general and holds for any arbitrary amount of delay. We have shown that the previously introduced bounds can be considered as special cases of our proposed upper bound. The new introduced bound is, in some cases, tighter than the previously established bounds. It is also notable that the proposed bound coincides with the previously known capacity of "Relay-With-Delay" channels.