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

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.advisorKaski, Petteri
dc.contributor.advisorHollanti, Camilla
dc.contributor.authorSimberg, Mikael
dc.contributor.schoolPerustieteiden korkeakoulufi
dc.contributor.supervisorKaski, Petteri
dc.date.accessioned2015-01-21T07:11:46Z
dc.date.available2015-01-21T07:11:46Z
dc.date.issued2015-01-20
dc.description.abstractLow-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.extent108 + 12
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/14969
dc.identifier.urnURN:NBN:fi:aalto-201501221159
dc.language.isoenen
dc.programmeTeknillisen fysiikan ja matematiikan koulutusohjelmafi
dc.programme.majorTeknillinen fysiikkafi
dc.programme.mcodeF3005fi
dc.rights.accesslevelopenAccess
dc.subject.keywordbit-flippingen
dc.subject.keywordcoding theoryen
dc.subject.keyworderror-correcting codesen
dc.subject.keywordgraphics processing uniten
dc.subject.keywordlinear time complexityen
dc.subject.keywordlow-density parity-check codesen
dc.titleLinear-time encoding and decoding of low-density parity-check codesen
dc.typeG2 Pro gradu, diplomityöen
dc.type.okmG2 Pro gradu, diplomityö
dc.type.ontasotMaster's thesisen
dc.type.ontasotDiplomityöfi
dc.type.publicationmasterThesis
local.aalto.idinssi50522
local.aalto.openaccessyes
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
master_Simberg_Mikael_2015.pdf
Size:
1.18 MB
Format:
Adobe Portable Document Format