國立高雄大學圖資館 |

Language: English

Back

Relay without delay.

Hassanpour, Navid.

Relay without delay.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Relay without delay.
Author:	Hassanpour, Navid.
Description:	54 p.
Notes:	Adviser: Thomas Cover.
Notes:	Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5278.
Contained By:	Dissertation Abstracts International67-09B.
Subject:	Engineering, Electronics and Electrical.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235229
ISBN:	9780542894299

Relay without delay.
Hassanpour, Navid.

Relay without delay. - 54 p.

Adviser: Thomas Cover.

Thesis (Ph.D.)--Stanford University, 2006.

In this thesis, the classical max-flow min-cut bound is shown to be inapplicable to the relay without delay. A general new upper bound on the capacity of the discrete memoryless relay without delay is established and shown to coincide with a lower bound achieved by a combination of instantaneous relaying and block Markov encoding, yielding capacity results for several classes of relay without delay channels. By using a discrete memoryless example, it is shown that instantaneous relaying by itself can be optimal and can achieve rates higher than the classical max-flow min-cut bound.

ISBN: 9780542894299Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Relay without delay.
LDR:02661nmm _2200301 _450 001 180670
005 20080111103812.5
008 090528s2006 eng d
020 $a 9780542894299
035 $a 00311695
040 $a UMI $c UMI
100 0 $a Hassanpour, Navid. $3 264249
245 1 0 $a Relay without delay.
300 $a 54 p.
500 $a Adviser: Thomas Cover.
500 $a Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5278.
502 $a Thesis (Ph.D.)--Stanford University, 2006.
520 # $a In this thesis, the classical max-flow min-cut bound is shown to be inapplicable to the relay without delay. A general new upper bound on the capacity of the discrete memoryless relay without delay is established and shown to coincide with a lower bound achieved by a combination of instantaneous relaying and block Markov encoding, yielding capacity results for several classes of relay without delay channels. By using a discrete memoryless example, it is shown that instantaneous relaying by itself can be optimal and can achieve rates higher than the classical max-flow min-cut bound.
520 # $a Instantaneous relaying and complete decode and forward at the relay are shown to be optimal for the additive white Gaussian noise relay without delay, for ranges of parameters.
520 # $a Relay without delay is defined as a relay channel where each transmitted relay symbol can depend on the relay's current symbols as well as the past. This is in contrast to the classical relay channel which is an information theoretical model of a three node communication system where a relay, using only its past received symbols, helps a transmitter to send information to a receiver. The capacity of the relay channel is known only for a few special cases.
520 # $a Therefore, introducing delay as an additional design factor in a relay channel makes higher rates achievable using simpler relaying strategies.
520 # $a These schemes achieve rates which are higher than the max-flow min-cut bound on the capacity of the classical Gaussian relay channel. Unlike the general classical Gaussian relay channel, whose capacity is not known for any range of channel characteristics, the capacity of the Gaussian relay without delay is known for all but a limited set of parameters.
590 $a School code: 0212.
650 # 0 $a Engineering, Electronics and Electrical. $3 226981
690 $a 0544
710 0 # $a Stanford University. $3 212607
773 0 # $g 67-09B. $t Dissertation Abstracts International
790 $a 0212
790 1 0 $a Cover, Thomas, $e advisor
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235229 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235229