Low-Density Parity-Check Codes with Erasures and Puncturing

In this thesis, we extend applications of Low-Density Parity-Check (LDPC) codes to a combination of constituent sub-channels, which is a mixture of Gaussian channels with erasures. This model, for example, represents a common channel in magnetic recordings where thermal asperities in the system are...

Full description

Bibliographic Details
Main Author: Ha, Jeongseok Ha
Format: Others
Language:en_US
Published: Georgia Institute of Technology 2005
Subjects:
Online Access:http://hdl.handle.net/1853/5296
id ndltd-GATECH-oai-smartech.gatech.edu-1853-5296
record_format oai_dc
spelling ndltd-GATECH-oai-smartech.gatech.edu-1853-52962013-01-07T20:11:17ZLow-Density Parity-Check Codes with Erasures and PuncturingHa, Jeongseok HaErasuresLow-density parity-check codesPuncturingGaussian processesCoding theoryData encryption (Computer science)In this thesis, we extend applications of Low-Density Parity-Check (LDPC) codes to a combination of constituent sub-channels, which is a mixture of Gaussian channels with erasures. This model, for example, represents a common channel in magnetic recordings where thermal asperities in the system are detected and represented at the decoder as erasures. Although this channel is practically useful, we cannot find any previous work that evaluates performance of LDPC codes over this channel. We are also interested in practical issues such as designing robust LDPC codes for the mixture channel and predicting performance variations due to erasure patterns (random and burst), and finite block lengths. On time varying channels, a common error control strategy is to adapt the coding rate according to available channel state information (CSI). An effective way to realize this coding strategy is to use a single code and puncture it in a rate-compatible fashion, a so-called rate-compatible punctured code (RCPC). We are interested in the existence of good puncturing patterns for rate-changes that minimize performance loss. We show the existence of good puncturing patterns with analysis and verify the results with simulations. Universality of a channel code across a broad range of coding rates is a theoretically interesting topic. We are interested in the possibility of using the puncturing technique proposed in this thesis for designing universal LDPC codes. We also consider how to design high rate LDPC codes by puncturing low rate LDPC codes. The new design method can take advantage of longer effect block lengths, sparser parity-check matrices, and larger minimum distances of low rate LDPC codes.Georgia Institute of Technology2005-03-04T16:44:16Z2005-03-04T16:44:16Z2003-12-01Dissertation1709795 bytesapplication/pdfhttp://hdl.handle.net/1853/5296en_US
collection NDLTD
language en_US
format Others
sources NDLTD
topic Erasures
Low-density parity-check codes
Puncturing
Gaussian processes
Coding theory
Data encryption (Computer science)
spellingShingle Erasures
Low-density parity-check codes
Puncturing
Gaussian processes
Coding theory
Data encryption (Computer science)
Ha, Jeongseok Ha
Low-Density Parity-Check Codes with Erasures and Puncturing
description In this thesis, we extend applications of Low-Density Parity-Check (LDPC) codes to a combination of constituent sub-channels, which is a mixture of Gaussian channels with erasures. This model, for example, represents a common channel in magnetic recordings where thermal asperities in the system are detected and represented at the decoder as erasures. Although this channel is practically useful, we cannot find any previous work that evaluates performance of LDPC codes over this channel. We are also interested in practical issues such as designing robust LDPC codes for the mixture channel and predicting performance variations due to erasure patterns (random and burst), and finite block lengths. On time varying channels, a common error control strategy is to adapt the coding rate according to available channel state information (CSI). An effective way to realize this coding strategy is to use a single code and puncture it in a rate-compatible fashion, a so-called rate-compatible punctured code (RCPC). We are interested in the existence of good puncturing patterns for rate-changes that minimize performance loss. We show the existence of good puncturing patterns with analysis and verify the results with simulations. Universality of a channel code across a broad range of coding rates is a theoretically interesting topic. We are interested in the possibility of using the puncturing technique proposed in this thesis for designing universal LDPC codes. We also consider how to design high rate LDPC codes by puncturing low rate LDPC codes. The new design method can take advantage of longer effect block lengths, sparser parity-check matrices, and larger minimum distances of low rate LDPC codes.
author Ha, Jeongseok Ha
author_facet Ha, Jeongseok Ha
author_sort Ha, Jeongseok Ha
title Low-Density Parity-Check Codes with Erasures and Puncturing
title_short Low-Density Parity-Check Codes with Erasures and Puncturing
title_full Low-Density Parity-Check Codes with Erasures and Puncturing
title_fullStr Low-Density Parity-Check Codes with Erasures and Puncturing
title_full_unstemmed Low-Density Parity-Check Codes with Erasures and Puncturing
title_sort low-density parity-check codes with erasures and puncturing
publisher Georgia Institute of Technology
publishDate 2005
url http://hdl.handle.net/1853/5296
work_keys_str_mv AT hajeongseokha lowdensityparitycheckcodeswitherasuresandpuncturing
_version_ 1716473985439367168