Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models

Thesis (MEng)--Stellenbosch University, 2016.

Saved in:
Bibliographic Details
Main Author: Singels, Rian
Other Authors: Du Preez, J. A.
Format: Thesis
Language:en_ZA
Published: Stellenbosch : Stellenbosch University 2016
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867614045258907648
access_status_str Open Access
author Singels, Rian
author2 Du Preez, J. A.
author_browse Du Preez, J. A.
Singels, Rian
author_facet Du Preez, J. A.
Singels, Rian
author_sort Singels, Rian
collection Thesis
dc_rights_str_mv Stellenbosch University
description Thesis (MEng)--Stellenbosch University, 2016.
format Thesis
id oai:scholar.sun.ac.za:10019.1/98576
institution Stellenbosch University (South Africa)
language en_ZA
last_indexed 2026-06-10T12:45:46.810Z
license_str Other — see source repository
provenance_str_mv Harvested via OAI-PMH from SUNScholar — Stellenbosch University Repository
publishDate 2016
publishDateRange 2016
publishDateSort 2016
publisher Stellenbosch : Stellenbosch University
publisherStr Stellenbosch : Stellenbosch University
record_format dspace
source_str SUNScholar — Stellenbosch University Repository
spelling oai:scholar.sun.ac.za:10019.1/98576 The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models Singels, Rian Du Preez, J. A. Wolhuter, R. Stellenbosch University. Faculty of Engineering. Dept. of Electrical and Electronic Engineering. Probabilistic graphical models UCTD Graphical modeling (Statistics) Algorithm, probabilistic graphs Binary system (Mathematics) Symmetrical components (Electric engineering) Thesis (MEng)--Stellenbosch University, 2016. ENGLISH ABSTRACT: Raptor codes are Forward Error Correction (FEC) codes that fall under the class of Fountain codes. This class of code can reach data-transmission rates close to the capacity of the Binary Erasure Channels (BECs). It has consequently been researched and refined for deterministic decoding over these channels. Raptor codes are ideal for communication over the internet as the internet is a realisation of the BEC. This work investigates the use of Raptor codes for probabilistic decoding, assessing their performance over the Binary Symmetric Channel (BSC) and the Binary Additive White Gaussian Noise Channel (BAWGNC). Extensive consideration is given to the Belief Propagation (BP) algorithm and Probabilistic Graphical Models (PGMs) - tools of inference that are essential to the decoding of FECs codes. Focus is given to the application of the Factor Graph (FG), the Cluster graph (CG), and the Junction Tree (JT). Furthermore, attention is given to how the BP-update rules may be transformed in order to avoid computation over large distributions. The way in which two graph-altering algorithms may improve the decoding success rate, i.e., the Tree-structure Expectation Propagation (TEP) and the Inactivation Decoding (ID) algorithms, is also shown. These algorithms are simulated and the results analysed. AFRIKAANSE OPSOMMING: Raptor-kodes is ’n tipe voorwaarde-foutkorreksiekode wat as ’n Fontein-kode geklassifiseer word. Hierdie klas van kodes kan datatransmissie-tempos na aan die kapasiteit van die binêre afskawing-kanale bereik. Dit is gevolglik nagevors en verfyn vir bepalingsdekodering oor hierdie klas van kanale. Raptor-kodes is ideaal vir kommunikasie oor die internet aangesien die internet ’n realisasie van die binêre afskawing-kanaal verteenwoordig. Hierdie werk ondersoek die gebruik van Raptor-kodes vir waarskynlikheidsdekodering en evalueer sy prestasie oor die binêre simmetriese kanaal en die binêre-toevoeging wit Gaussiese ruis-kanaal. Uitgebreide oorweging is gebied aan die oortuigingsvoortplanting-algoritme en waarskeinlikheidsgrafiese modelle; instrumente van afleiding wat noodsaaklik vir die dekodering van voorwaarde-foutkorreksie-kodes is. Fokus word gebied aan die toepassing van die faktorgrafiek, die bundelgrafiek, en die aansluitingsboom. Verder word dit behandel hoe die oortuigingsvoortplantingaanpassingsreëls omskep kan word ten einde berekening oor groot uitkerings te vermy. Dit word ook behandel hoe twee grafiekverandering-algoritmes die dekodering-suksessyfer kan verbeter, dit wil sê, die boom-gewysde verwagtingsvoortplanting- en deaktiveringsdekodering-algoritmes. Hierdie algoritmes is gesimuleer en die resultate is ontleed. 2016-03-09T14:35:49Z 2016-03-09T14:35:49Z 2016-03 Thesis http://hdl.handle.net/10019.1/98576 en_ZA Stellenbosch University xix, 149 pages application/pdf Stellenbosch : Stellenbosch University
spellingShingle Probabilistic graphical models
UCTD
Graphical modeling (Statistics)
Algorithm, probabilistic graphs
Binary system (Mathematics)
Symmetrical components (Electric engineering)
Singels, Rian
The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models
title The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models
title_full The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models
title_fullStr The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models
title_full_unstemmed The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models
title_short The application of Probabilistic Graphical Models to Raptor codes over Binary Input Memoryless Symmetric Channel models
title_sort application of probabilistic graphical models to raptor codes over binary input memoryless symmetric channel models
topic Probabilistic graphical models
UCTD
Graphical modeling (Statistics)
Algorithm, probabilistic graphs
Binary system (Mathematics)
Symmetrical components (Electric engineering)
url http://hdl.handle.net/10019.1/98576
work_keys_str_mv AT singelsrian theapplicationofprobabilisticgraphicalmodelstoraptorcodesoverbinaryinputmemorylesssymmetricchannelmodels
AT singelsrian applicationofprobabilisticgraphicalmodelstoraptorcodesoverbinaryinputmemorylesssymmetricchannelmodels