東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Performance analysis of network sour...

Yang, Jun.

Linked to FindBook

Google Book

Amazon

博客來

Performance analysis of network source coding algorithms.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Performance analysis of network source coding algorithms./
Author:	Yang, Jun.
Description:	190 p.
Notes:	Source: Dissertation Abstracts International, Volume: 66-06, Section: B, page: 3335.
Contained By:	Dissertation Abstracts International66-06B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3180435
ISBN:	9780542205316

Performance analysis of network source coding algorithms.
Yang, Jun.

Performance analysis of network source coding algorithms. - 190 p.

Source: Dissertation Abstracts International, Volume: 66-06, Section: B, page: 3335.

Thesis (Ph.D.)--University of Southern California, 2005.

The field of network source coding treats data compression in any environment comprising more than one encoder, more than one decoder, or both. Examples of network source codes include multi-resolution, multiple descriptions, multiple access, side information, and broadcast codes. Recent results developed in the literature include theoretical analysis and code design algorithms for both lossless and lossy algorithm in a variety of network environments. An asymptotically optimal lossy source coding algorithm will approach the rate-distortion limit as the encoding block length tends to infinity. For such an algorithm, when coding complexity is taken into account, the performance is measured by the redundancy of the algorithm which is defined as the difference between its expected performance and the rate-distortion function of the source.

ISBN: 9780542205316Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Performance analysis of network source coding algorithms.
LDR:02631nmm 2200289 4500 001 1820869
005 20061103114931.5
008 130610s2005 eng d
020 $a 9780542205316
035 $a (UnM)AAI3180435
035 $a AAI3180435
040 $a UnM $c UnM
100 1 $a Yang, Jun. $3 893514
245 1 0 $a Performance analysis of network source coding algorithms.
300 $a 190 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-06, Section: B, page: 3335.
500 $a Adviser: Zhen Zhang.
502 $a Thesis (Ph.D.)--University of Southern California, 2005.
520 $a The field of network source coding treats data compression in any environment comprising more than one encoder, more than one decoder, or both. Examples of network source codes include multi-resolution, multiple descriptions, multiple access, side information, and broadcast codes. Recent results developed in the literature include theoretical analysis and code design algorithms for both lossless and lossy algorithm in a variety of network environments. An asymptotically optimal lossy source coding algorithm will approach the rate-distortion limit as the encoding block length tends to infinity. For such an algorithm, when coding complexity is taken into account, the performance is measured by the redundancy of the algorithm which is defined as the difference between its expected performance and the rate-distortion function of the source.
520 $a Motivated by the recent results in the redundancy of source coding for block codes and trellis codes, this dissertation has investigated the distortion redundancy of multi-resolution coding algorithms for successively refinable sources, the redundancy of multiple description coding algorithms in the case of no excess rate for the joint description, as well as the redundancy of coding time-descrete stationary Gaussian source after transformation and the redundancy estimation of universal trellis coding algorithms. Results in causal encoding of Markov source with its application to feedback networks are also included.
520 $a The given theoretical investigations into network source code performance will provide valuable insight into code design. On the other hand, the redundancy analysis that we developed is a practical generalization of the Shannon source coding theorem to the more concrete cases.
590 $a School code: 0208.
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
710 2 0 $a University of Southern California. $3 700129
773 0 $t Dissertation Abstracts International $g 66-06B.
790 1 0 $a Zhang, Zhen, $e advisor
790 $a 0208
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3180435