東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Analysis and design of turbo-like codes.

Jin, Hui.

Linked to FindBook

Google Book

Amazon

博客來

Analysis and design of turbo-like codes.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Analysis and design of turbo-like codes./
Author:	Jin, Hui.
Description:	162 p.
Notes:	Adviser: Robert J. McEliece.
Contained By:	Dissertation Abstracts International62-05B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3015085
ISBN:	049325501X

Analysis and design of turbo-like codes.
Jin, Hui.

Analysis and design of turbo-like codes. - 162 p.

Adviser: Robert J. McEliece.

Thesis (Ph.D.)--California Institute of Technology, 2001.

One main contribution of both theoretical and practical interests in this thesis is the introduction of (regular and irregular) “repeat-accumulate” codes. RA codes are shown to be a serious competitor against turbo codes and LDPC codes.

ISBN: 049325501XSubjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Analysis and design of turbo-like codes.
LDR:02631nam 2200289 a 45 001 932382
005 20110505
008 110505s2001 eng d
020 $a 049325501X
035 $a (UnM)AAI3015085
035 $a AAI3015085
040 $a UnM $c UnM
100 1 $a Jin, Hui. $3 1256126
245 1 0 $a Analysis and design of turbo-like codes.
300 $a 162 p.
500 $a Adviser: Robert J. McEliece.
500 $a Source: Dissertation Abstracts International, Volume: 62-05, Section: B, page: 2431.
502 $a Thesis (Ph.D.)--California Institute of Technology, 2001.
520 $a One main contribution of both theoretical and practical interests in this thesis is the introduction of (regular and irregular) “repeat-accumulate” codes. RA codes are shown to be a serious competitor against turbo codes and LDPC codes.
520 $a Fifty years after Shannon determined the capacity of memoryless channels, we finally know of practical encoding and decoding algorithms that closely approach this limit. This remarkable feat was first achieved by the invention of turbo codes in 1993 [5]. Since then, turbo codes have essentially revolutionized the coding field and became one of the central research problems in recent years. While there has been a great deal of excellent theoretical work on turbo codes, it is fair to say practice still leads theory by a considerable margin.
520 $a This thesis endeavors to fill some of that gap. The main body of the thesis concerns coding theorems for general turbo codes. By “coding theorems” we mean in a classical Shannon sense: for a code ensemble, there exists a code threshold, if the channel noise is below that, the error probability of optimal decoder goes to zero as the code length approaches infinity. We first prove coding theorems for some simple serial turbo code ensembles on the AWGN channel. Then we generalize the results for a broader class of turbo-like codes on any memoryless channel. To closely estimate the noise threshold in the coding theorems, we develop a method based on “typical pairs decoding.” This method is powerful enough to reproduce Shannon's original coding theorems on any memoryless binary-input symmetric channels. Finally we introduce a class of codes of linear encoding and decoding complexity with performance provably close to Shannon's limit.
590 $a School code: 0037.
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
710 2 0 $a California Institute of Technology. $3 726902
773 0 $t Dissertation Abstracts International $g 62-05B.
790 $a 0037
790 1 0 $a McEliece, Robert J., $e advisor
791 $a Ph.D.
792 $a 2001
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3015085