Queen's University - Utility Bar

QSpace at Queen's University >
Theses, Dissertations & Graduate Projects >
Queen's Theses & Dissertations >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1974/6996

This item is restricted and will be released 2017-01-30.
Title: BELIEF PROPAGATION DECODING OF FINITE-LENGTH POLAR CODES
Authors: RAJAIE, TARANNOM

Files in This Item:

File Description SizeFormat
Rajaie_Tarannom_201201_MASC.pdf903.55 kBAdobe PDFView/Open
Keywords: Successive Cncellation
channel polarization
Polar codes
information theory
Decoding complexity
Belief Propagation
Issue Date: 1-Feb-2012
Series/Report no.: Canadian theses
Abstract: Polar codes, recently invented by Arikan, are the first class of codes known to achieve the symmetric capacity for a large class of channels. The symmetric capacity is the highest achievable rate subject to using the binary input letters of the channel with equal probability. Polar code construction is based on a phenomenon called channel polarization. The encoding as well as the decoding operation of polar codes can be implemented with O(N logN) complexity, where N is the blocklength of the code. In this work, we study the factor graph representation of finite-length polar codes and their effect on the belief propagation (BP) decoding process over Binary Erasure Channel (BEC). Particularly, we study the parity-check-based (H-Based) as well as the generator based (G-based) factor graphs of polar codes. As these factor graphs are not unique for a code, we study and compare the performance of Belief Propagation (BP) decoders on number of well-known graphs. Error rates and complexities are reported for a number of cases. Comparisons are also made with the Successive Cancellation (SC) decoder. High errors are related to the so-called stopping sets of the underlying graphs. we discuss the pros and cons of BP decoder over SC decoder for various code lengths.
Description: Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2012-01-31 17:10:59.955
URI: http://hdl.handle.net/1974/6996
Appears in Collections:Queen's Theses & Dissertations
Electrical and Computer Engineering Graduate Theses

Items in QSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

  DSpace Software Copyright © 2002-2008  The DSpace Foundation - TOP