By Topic

A new capacity upper bound for “Relay-With-Delay” channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Salimi, A. ; E. E. Dept., K.N. Toosi Univ. of Technol., Tehran, Iran ; Mirmohseni, M. ; Aref, M.

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.

Published in:

Information Theory, 2009. ISIT 2009. IEEE International Symposium on

Date of Conference:

June 28 2009-July 3 2009