Linear-time encoding and decoding of low-density parity-check codes

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.advisor Kaski, Petteri
dc.contributor.advisor Hollanti, Camilla
dc.contributor.author Simberg, Mikael
dc.date.accessioned 2015-01-21T07:11:46Z
dc.date.available 2015-01-21T07:11:46Z
dc.date.issued 2015-01-20
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/14969
dc.description.abstract Low-density parity-check (LDPC) codes had a renaissance when they were rediscovered in the 1990’s. Since then LDPC codes have been an important part of the field of error-correcting codes, and have been shown to be able to approach the Shannon capacity, the limit at which we can reliably transmit information over noisy channels. Following this, many modern communications standards have adopted LDPC codes. Error-correction is equally important in protecting data from corruption on a hard-drive as it is in deep-space communications. It is most commonly used for example for reliable wireless transmission of data to mobile devices. For practical purposes, both encoding and decoding need to be of low complexity to achieve high throughput and low power consumption. This thesis provides a literature review of the current state-of-the-art in encoding and decoding of LDPC codes. Message- passing decoders are still capable of achieving the best error-correcting performance, while more recently considered bit-flipping decoders are providing a low-complexity alternative, albeit with some loss in error-correcting performance. An implementation of a low-complexity stochastic bit-flipping decoder is also presented. It is implemented for Graphics Processing Units (GPUs) in a parallel fashion, providing a peak throughput of 1.2 Gb/s, which is significantly higher than previous decoder implementations on GPUs. The error-correcting performance of a range of decoders has also been tested, showing that the stochastic bit-flipping decoder provides relatively good error-correcting performance with low complexity. Finally, a brief comparison of encoding complexities for two code ensembles is also presented. en
dc.format.extent 108 + 12
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.title Linear-time encoding and decoding of low-density parity-check codes en
dc.type G2 Pro gradu, diplomityö en
dc.contributor.school Perustieteiden korkeakoulu fi
dc.subject.keyword bit-flipping en
dc.subject.keyword coding theory en
dc.subject.keyword error-correcting codes en
dc.subject.keyword graphics processing unit en
dc.subject.keyword linear time complexity en
dc.subject.keyword low-density parity-check codes en
dc.identifier.urn URN:NBN:fi:aalto-201501221159
dc.programme.major Teknillinen fysiikka fi
dc.programme.mcode F3005 fi
dc.type.ontasot Master's thesis en
dc.type.ontasot Diplomityö fi
dc.contributor.supervisor Kaski, Petteri
dc.programme Teknillisen fysiikan ja matematiikan koulutusohjelma fi


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse

My Account