The trellis complexity of block and convolutional codes

The trellis complexity of block and convolutional codes

NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document. This thesis concerns the computational complexity of high performance decoding algorithms. The primary objective is to design the most efficient maximum-likelihood (ML) decoders for...

Full description

Bibliographic Details
Main Author: Lin, Wei
Format: Others
Published: 1997
Online Access:https://thesis.library.caltech.edu/171/1/Lin_w_1997.pdf
Lin, Wei (1997) The trellis complexity of block and convolutional codes. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/5130-4858. https://resolver.caltech.edu/CaltechETD:etd-01142008-075936 <https://resolver.caltech.edu/CaltechETD:etd-01142008-075936>

Internet

https://thesis.library.caltech.edu/171/1/Lin_w_1997.pdf
Lin, Wei (1997) The trellis complexity of block and convolutional codes. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/5130-4858. https://resolver.caltech.edu/CaltechETD:etd-01142008-075936 <https://resolver.caltech.edu/CaltechETD:etd-01142008-075936>

Similar Items