Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Polar-code construction and decoding techniques

Amiridi Magda

Simple record


URIhttp://purl.tuc.gr/dl/dias/BC6BE596-AA4B-45E5-9920-907D24E87BBF-
Identifierhttps://doi.org/10.26233/heallink.tuc.72291-
Languageen-
Extent47 pagesen
TitlePolar-code construction and decoding techniquesen
TitleΤεχνικές κατασκευής και αποκωδικοποίησης πολικών κωδίκωνel
CreatorAmiridi Magdaen
CreatorΑμιριδη Μαγδαel
Contributor [Thesis Supervisor]Karystinos Georgiosen
Contributor [Thesis Supervisor]Καρυστινος Γεωργιοςel
Contributor [Committee Member]Bletsas Aggelosen
Contributor [Committee Member]Μπλετσας Αγγελοςel
Contributor [Committee Member]Liavas Athanasiosen
Contributor [Committee Member]Λιαβας Αθανασιοςel
PublisherΠολυτεχνείο Κρήτηςel
PublisherTechnical University of Creteen
Academic UnitTechnical University of Crete::School of Electrical and Computer Engineeringen
Academic UnitΠολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστώνel
Content SummaryPolar 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 ItemDiploma Worken
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2018-02-22-
Date of Publication2018-
SubjectInformation theoryel
Bibliographic CitationMagda Amiridi, "Polar-code construction and decoding techniques", Diploma Work, School of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2018en
Bibliographic CitationΜάγδα Αμιρίδη, "Τεχνικές κατασκευής και αποκωδικοποίησης πολικών κωδίκων", Διπλωματική Εργασία, Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2018el

Available Files

Services

Statistics