![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/BC6BE596-AA4B-45E5-9920-907D24E87BBF | - |
| Identifier | https://doi.org/10.26233/heallink.tuc.72291 | - |
| Language | en | - |
| Extent | 47 pages | en |
| Title | Polar-code construction and decoding techniques | en |
| Title | Τεχνικές κατασκευής και αποκωδικοποίησης πολικών κωδίκων | el |
| Creator | Amiridi Magda | en |
| Creator | Αμιριδη Μαγδα | el |
| Contributor [Thesis Supervisor] | Karystinos Georgios | en |
| Contributor [Thesis Supervisor] | Καρυστινος Γεωργιος | el |
| Contributor [Committee Member] | Bletsas Aggelos | en |
| Contributor [Committee Member] | Μπλετσας Αγγελος | el |
| Contributor [Committee Member] | Liavas Athanasios | en |
| Contributor [Committee Member] | Λιαβας Αθανασιος | el |
| Publisher | Πολυτεχνείο Κρήτης | el |
| Publisher | Technical University of Crete | en |
| Academic Unit | Technical University of Crete::School of Electrical and Computer Engineering | en |
| Academic Unit | Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών | el |
| Content Summary | 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 |
| Type of Item | Διπλωματική Εργασία | el |
| Type of Item | Diploma Work | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2018-02-22 | - |
| Date of Publication | 2018 | - |
| Subject | Information theory | el |
| Bibliographic Citation | Magda Amiridi, "Polar-code construction and decoding techniques", Diploma Work, School of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2018 | en |
| Bibliographic Citation | Μάγδα Αμιρίδη, "Τεχνικές κατασκευής και αποκωδικοποίησης πολικών κωδίκων", Διπλωματική Εργασία, Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2018 | el |
Copyright © DIAS 2013
