Caltech Library System

About | Browse | Search | Caltech Student Instructions

Type of Document	Dissertation
Author	Jin, Hui
Author's Email Address	hui AT systems.caltech.edu
URN	etd-08222001-151244
Persistent URL	http://resolver.caltech.edu/CaltechETD:etd-08222001-151244
Title	Analysis and design of turbo-like codes
Degree	PhD
Option	Electrical Engineering
Advisory Committee	Advisor Name Title Robert J McEliece Committee Chair Dariush Divsalar Committee Member Jehoshua (Shuki) Bruck Committee Member Michelle Effros Committee Member Samuel Dolinar Committee Member
Keywords	low-density parity-check codes iterative decoding turbo codes coding theorems repeat accumulate codes bounding techniques
Date of Defense	2001-05-07
Availability	unrestricted
Abstract 50 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 by Berrou, Glavieux, and Thitimajshima in 1993 cite{BGT93}. 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. This thesis endeavors to fill some of that gap. The main body of the thesis concerns coding theorems for general turbo codes. We first prove coding theorems for some simple (yet interesting) 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 when calculate is feasible, 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. Last we introduce a linearly encodable and decodable code, after carefule design, with performance provably close to Shannon's limit. One main contribution here of both theoretical and practical interests is the introduction of "repeat-accumulate" (RA) codes. RA codes are structurally simple enough that a rigorous theoretical analysis is possible, yet random enough that powerful performance under iterative decoding can be obtained. The generalization, irregular RA codes, are shown to be a serious competitor against turbo codes and LDPC codes.
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access    HJinthesis.pdf 1.15 Mb 00:05:18 00:02:43 00:02:23 00:01:11 00:00:06   HJinthesis.ps 2.25 Mb 00:10:26 00:05:22 00:04:41 00:02:20 00:00:12