東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Turbo codes for data compression and...

Zhao, Ying.

FindBook

Google Book

Amazon

博客來

Turbo codes for data compression and joint source-channel coding .

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Turbo codes for data compression and joint source-channel coding ./
作者:	Zhao, Ying.
面頁冊數:	112 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-12, Section: B, page: 7293.
Contained By:	Dissertation Abstracts International67-12B.
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3247688

Turbo codes for data compression and joint source-channel coding .
Zhao, Ying.

Turbo codes for data compression and joint source-channel coding . - 112 p.

Source: Dissertation Abstracts International, Volume: 67-12, Section: B, page: 7293.

Thesis (Ph.D.)--University of Delaware, 2007.

We exploit the power of turbo-like codes (mainly turbo codes) in the fields of source coding and joint source channel coding, with the objective of achieving performance close to the theoretical limits. Turbo codes are well known for their near Shannon limit performance in noisy channels. However, those "random-like" codewords also allow for compression rates close to the theoretical limits when applied to source coding.Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Turbo codes for data compression and joint source-channel coding .
LDR:02205nmm 2200289 4500 001 1833830
005 20071114145409.5
008 130610s2007 eng d
035 $a (UMI)AAI3247688
035 $a AAI3247688
040 $a UMI $c UMI
100 1 $a Zhao, Ying. $3 1043919
245 1 0 $a Turbo codes for data compression and joint source-channel coding .
300 $a 112 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-12, Section: B, page: 7293.
500 $a Adviser: Javier Garcia-Frias.
502 $a Thesis (Ph.D.)--University of Delaware, 2007.
520 $a We exploit the power of turbo-like codes (mainly turbo codes) in the fields of source coding and joint source channel coding, with the objective of achieving performance close to the theoretical limits. Turbo codes are well known for their near Shannon limit performance in noisy channels. However, those "random-like" codewords also allow for compression rates close to the theoretical limits when applied to source coding.
520 $a Besides the particular case of single sources, we are more interested in the general case of compression and joint source channel coding of correlated sources, which is of interest in many practical applications such as sensor networks. Different correlation models between the sources and different channel environments (independent or multiple-access AWGN/fading channels) have been considered in this dissertation. The resulting performance is always very close to the theoretical limits. Moreover, the encoding process is independent for each source and the correlation model can be estimated in the decoder site without a priori knowledge. Especially for joint source-channel coding, the simplicity at the encoder sites facilitates the implementation of the proposed scheme in practical applications, and the use of a single encoder stage in each source prevents error propagation.
590 $a School code: 0060.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Information Science. $3 1017528
650 4 $a Computer Science. $3 626642
690 $a 0544
690 $a 0723
690 $a 0984
710 2 0 $a University of Delaware. $3 1017826
773 0 $t Dissertation Abstracts International $g 67-12B.
790 1 0 $a Garcia-Frias, Javier, $e advisor
790 $a 0060
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3247688