1. Home page
  2. Search

Polar-code construction and decoding techniques

This item is provided by the institution :
Technical University of Crete   

Repository :
Institutional Repository Technical University of Crete   

see the original item page
in the repository's web site and access all digital files if the item*



Τεχνικές κατασκευής και αποκωδικοποίησης πολικών κωδίκων (EL)
Polar-code construction and decoding techniques (EN)
Αμιριδη Μαγδα (EL)
Amiridi Magda (EN)
Μπλετσας Αγγελος (EL)
Λιαβας Αθανασιος (EL)
Καρυστινος Γεωργιος (EL)
Bletsas Aggelos (EN)
Karystinos Georgios (EN)
Liavas Athanasios (EN)
bachelorThesis
2018
Polar codes, recently invented by Arikan, are the first provably capacity achieving codes for any binary input symmetric discrete memoryless channel with low encoding and decoding complexity. This thesis explores the practical implementation of polar codes which are complexity efficient and perform well for binary erasure channel (BEC) and binary symmetric channel (BSC). The explicit code construction is based on a characteristic called channel polarization which involves generating N extremal (perfect or completely noisy) channels from N independent uses of the same base channel. Information bits are sent over the noiseless channels while pilot bits, called frozen bits, are assigned to the noisy ones. Code design for BEC is based on the recursive relations presented in the original paper whereas for BSC we propose a heuristic and efficient algorithm and compare it to the method of recursive estimation of Bhattacharyya parameters of bit-channels. The encoding is implemented using a recursive butterfly structure with O(N logN) complexity, where N is the block length of the code. Two main low complexity decoders are compared in terms of bit error rate: successive cancellation decoder proposed by Arikan having complexity O(N logN) with susceptibility to error propagation and mediocre bit error rate performance at small or moderate code lengths and list decoder, proposed by Tal and Vardy, with complexity O(LN logN) where L is the list size. (EN)
Information theory (EL)
English
Πολυτεχνείο Κρήτης (EL)
Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών (EL)
Technical University of Crete (EN)
Technical University of Crete::School of Electrical and Computer Engineering (EN)
Technical University of Crete
Institutional Repository Technical University of Crete
School of Electrical and Computer Engineering - Diploma Works
Software Technology and Network Applications Laboratory - Diploma Works
Distributed Multimedia Information Systems and Applications Laboratory - Diploma Works



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)