東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Channel coding: Non-asymptotic funda...

Polyanskiy, Yury.

FindBook

Google Book

Amazon

博客來

Channel coding: Non-asymptotic fundamental limits.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Channel coding: Non-asymptotic fundamental limits./
作者:	Polyanskiy, Yury.
面頁冊數:	362 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-01, Section: B, page: .
Contained By:	Dissertation Abstracts International72-01B.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3435966
ISBN:	9781124348964

Channel coding: Non-asymptotic fundamental limits.
Polyanskiy, Yury.

Channel coding: Non-asymptotic fundamental limits. - 362 p.

Source: Dissertation Abstracts International, Volume: 72-01, Section: B, page: .

Thesis (Ph.D.)--Princeton University, 2010.

Noise is an inalienable property of all communication systems appearing in nature. Such noise acts against the very purpose of communication, that is delivery of a data to the destination with minimal possible distortion. This creates a problem that has been addressed by various disciplines over the past century. In particular, information theory studies the question of the maximum possible rate achievable by an ideal system under certain assumptions regarding the noise generation and structural design constraints. The study of such questions, initiated by Claude Shannon in 1948, has typically been carried out in the asymptotic limit of an infinite number of signaling degrees of freedom (blocklength). Such a regime corresponds to the regime of laws of large numbers, or more generally ergodic limits, in probability theory. However, with the ever increasing demand for ubiquitous access to real time data, such as audio and video streaming for mobile devices, as well as the advent of modern sparse graph codes, one is interested in describing fundamental limits non-asymptotically, i.e. for blocklengths of the order of 1000. Study of these practically motivated questions requires new tools and techniques, which are systematically developed in this work. Knowledge of the behavior of the fundamental limits in the non-asymptotic regime enables the analysis of many related questions, such as the energy efficiency, effects of dynamically varying channel state, assessment of the suboptimality of modern codes, benefits of feedback, etc. As a result it is discovered that in several instances classical (asymptotics-based) conclusions do not hold under this more refined approach.

ISBN: 9781124348964Subjects--Topical Terms:

1669109
Applied Mathematics.

Channel coding: Non-asymptotic fundamental limits.
LDR:02624nam 2200301 4500 001 1392696
005 20110218114650.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124348964
035 $a (UMI)AAI3435966
035 $a AAI3435966
040 $a UMI $c UMI
100 1 $a Polyanskiy, Yury. $3 1671161
245 1 0 $a Channel coding: Non-asymptotic fundamental limits.
300 $a 362 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-01, Section: B, page: .
500 $a Advisers: H. Vincent Poor; Sergio Verdu.
502 $a Thesis (Ph.D.)--Princeton University, 2010.
520 $a Noise is an inalienable property of all communication systems appearing in nature. Such noise acts against the very purpose of communication, that is delivery of a data to the destination with minimal possible distortion. This creates a problem that has been addressed by various disciplines over the past century. In particular, information theory studies the question of the maximum possible rate achievable by an ideal system under certain assumptions regarding the noise generation and structural design constraints. The study of such questions, initiated by Claude Shannon in 1948, has typically been carried out in the asymptotic limit of an infinite number of signaling degrees of freedom (blocklength). Such a regime corresponds to the regime of laws of large numbers, or more generally ergodic limits, in probability theory. However, with the ever increasing demand for ubiquitous access to real time data, such as audio and video streaming for mobile devices, as well as the advent of modern sparse graph codes, one is interested in describing fundamental limits non-asymptotically, i.e. for blocklengths of the order of 1000. Study of these practically motivated questions requires new tools and techniques, which are systematically developed in this work. Knowledge of the behavior of the fundamental limits in the non-asymptotic regime enables the analysis of many related questions, such as the energy efficiency, effects of dynamically varying channel state, assessment of the suboptimality of modern codes, benefits of feedback, etc. As a result it is discovered that in several instances classical (asymptotics-based) conclusions do not hold under this more refined approach.
590 $a School code: 0181.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
690 $a 0364
690 $a 0544
690 $a 0984
710 2 $a Princeton University. $3 645579
773 0 $t Dissertation Abstracts International $g 72-01B.
790 1 0 $a Poor, H. Vincent, $e advisor
790 1 0 $a Verdu, Sergio, $e advisor
790 $a 0181
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3435966