Coding Techniques for Linear Block Codes With Applications to Fault Identification
Wu, Yingquan
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/80887
Description
Title
Coding Techniques for Linear Block Codes With Applications to Fault Identification
Author(s)
Wu, Yingquan
Issue Date
2004
Doctoral Committee Chair(s)
Christoforos N. Hadjicostis
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Language
eng
Abstract
When channel reliability information is available, soft-decision decoding becomes attractive for many applications, since maximum-likelihood (ML) soft-decision decoding offers (roughly) 3 dB additional gain over algebraic decoding. Since ML soft-decision decoding is an NP-hard problem, we concentrate our efforts on exploring computationally efficient suboptimal soft-decision decoding methods, based on iterative recoding, a methodology that attempts to systematically search through reliable information (basis) bits while applying recoding to correct errors among the remaining unreliable redundancy bits. We first determine the optimal ordering of test error patterns when given an information basis, and then characterize the optimality of the so-called most reliable basis. We next develop two techniques, namely preprocessing and diversification, which significantly improve the traditional iterative recoding method. We also carry out analysis of the asymptotic behavior of the proposed decoding algorithm under the AWGN channel model in the high SNR regime. As a by-product of this analysis, we also precisely characterize the asymptotic behavior of the state-of-the-art Chase and GMD decoding algorithms for the AWGN channel model.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
