國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Capacity of Gaussian vector broadcas...

Mohseni, Mehdi.

Capacity of Gaussian vector broadcast channels.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Capacity of Gaussian vector broadcast channels.
作者:	Mohseni, Mehdi.
面頁冊數:	118 p.
附註:	Adviser: John M. Cioffi.
附註:	Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5291.
Contained By:	Dissertation Abstracts International67-09B.
標題:	Engineering, Electronics and Electrical.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235297
ISBN:	9780542895128

Capacity of Gaussian vector broadcast channels.
Mohseni, Mehdi.

Capacity of Gaussian vector broadcast channels. - 118 p.

Adviser: John M. Cioffi.

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

In this dissertation, an alternative converse proof for the capacity region of the Gaussian vector broadcast channel is presented. First, the achievable region by the dirty paper coding (DPC) scheme is reviewed, and the multiple-access broadcast channel duality is revisited. By combining some ideas from earlier works on the problem with duality, primarily, the optimality of the DPC scheme is proven under a total transmit-power constraint. Afterward, by employing a more comprehensive notion of the multiple-access broadcast channel duality, the optimality proof for the DPC scheme is extended to general convex constraints on the transmit covariance matrix.

ISBN: 9780542895128Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Capacity of Gaussian vector broadcast channels.
LDR:03330nmm _2200277 _450 001 180681
005 20080111103816.5
008 090528s2006 eng d
020 $a 9780542895128
035 $a 00311707
040 $a UMI $c UMI
100 0 $a Mohseni, Mehdi. $3 264260
245 1 0 $a Capacity of Gaussian vector broadcast channels.
300 $a 118 p.
500 $a Adviser: John M. Cioffi.
500 $a Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5291.
502 $a Thesis (Ph.D.)--Stanford University, 2006.
520 # $a In this dissertation, an alternative converse proof for the capacity region of the Gaussian vector broadcast channel is presented. First, the achievable region by the dirty paper coding (DPC) scheme is reviewed, and the multiple-access broadcast channel duality is revisited. By combining some ideas from earlier works on the problem with duality, primarily, the optimality of the DPC scheme is proven under a total transmit-power constraint. Afterward, by employing a more comprehensive notion of the multiple-access broadcast channel duality, the optimality proof for the DPC scheme is extended to general convex constraints on the transmit covariance matrix.
520 # $a The broadcast channel is an information-theoretic model of a communication system whereby a transmitter communicates to a number of receivers. These receivers, because of their geographical locations or other practical limitations cannot cooperate in decoding their individual messages. Examples of such a channel model are downlink communication in a wireless cellular network or downstream transmission in a Digital Subscriber Line system. Certainly, a full understanding of the communication limits over broadcast channels provides practical insights on the design of more efficient wireless or wire-line networks.
520 # $a The capacity expression for the Gaussian vector broadcast channel is used subsequently to establish the capacity region for a family of parallel Gaussian vector broadcast channels with total average transmit-power constraint. It is shown that using independent code-books over the individual sub-channels is capacity achieving. Moreover, the problem of optimal power allocation over the sub-channels is studied from two major information-theoretic standpoints. In the first problem, the power allocation policy that uses the minimum total transmit power to achieve a given point in the capacity region is investigated. By transforming the underlying optimization problem to the Lagrange dual domain, an efficient numerical algorithm is proposed to find this power allocation policy. In the second problem, the policy that achieves a boundary point of the capacity region is studied. It is shown that this power allocation problem is essentially the same as the minimum power allocation problem in the dual domain. Based on this similarity, a numerical algorithm is developed to solve this power allocation problem.
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 Cioffi, John M., $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=3235297 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235297