Simulator for Encoding and Decoding of Polar Codes in Various Channels

The aim of this work is to conduct a research on algorithms for processing of the polar codes. The area of polar codes holds a specific place in the information coding field of study. This is a fast-developing branch of knowledge, which recently found a practical application and continuously being improved by identifying enhancements of the existing approaches and compositions with other algorithms with proven results. The idea of this work is to focus on the main steps of information processing within polar codes: construction of the code work, encoding, and decoding. The last step is the most crucial as the efficiency of the coding algorithms is mostly measured by its ability to recover the initial message, which can be corrupted during the transmission through the noise channel. As this graduation thesis is the continuation of the previous years’ study, it is important to highlight that this year we focus on the use of concatenated codes construction, which implies enhanced encoding and decoding algorithms. This approach was recently shown in the polar codes studies and not yet been implemented. As a part of the research, the experiments will be handled for comparing the efficiency of the improved algorithms within the previous years’ results. The separate chapter of this report will show the results of the conducted experiments. The structure of this work is the following: firstly, the preliminary definitions are given for important terms that will be further used in this work. Secondly, the literature and related sources review is provided, which includes algorithms for encoding and decoding steps of polar codes. Then, the implementation details of the selected algorithms are described with the needed details of program code. And lastly, the handled experiments are described, which are followed by the conclusion on the conducted work within this research.