CaltechTHESIS
  A Caltech Library Service

Coding beyond the computational cutoff rate

Citation

Collins, Oliver (1989) Coding beyond the computational cutoff rate. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-02012007-132507

Abstract

This thesis presents a collection of new codes, algorithms, and hardware, which can all be used to reduce the required energy per information bit to noise spectral density ratio on the Gaussian channel. First comes a feedback technique from an outer to an inner code. The basic idea is to perform a second maximum likelihood decoding operation of the inner code that incorporates side information. Next comes a new kind of algebraic outer code which we get from combining Reed Solomon codes with themselves. The most important results, however, deal with the construction of long constraint length Viterbi decoders. One chapter presents a hardware design of a constraint length 15, rate 1/6 decoder. The last chapter gives some results on the partitioning of a deBruijn graph which make the number of interconnections in the design physically realizable.

Item Type:Thesis (Dissertation (Ph.D.))
Degree Grantor:California Institute of Technology
Major Option:Electrical Engineering
Thesis Availability:Restricted to Caltech community only
Thesis Committee:
  • McEliece, Robert J. (chair)
Defense Date:11 May 1989
Record Number:CaltechETD:etd-02012007-132507
Persistent URL:http://resolver.caltech.edu/CaltechETD:etd-02012007-132507
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:441
Collection:CaltechTHESIS
Deposited By: Imported from ETD-db
Deposited On:13 Feb 2007
Last Modified:26 Dec 2012 02:29

Thesis Files

[img] PDF (Collins_o_1989.pdf) - Final Version
Restricted to Caltech community only
See Usage Policy.

1631Kb

Repository Staff Only: item control page