Fast solving of systems of linear equations in decoding of LDPC codes
| dc.contributor.advisor | Skachek, Vitaly, juhendaja | |
| dc.contributor.advisor | Kudryashov, Boris, juhendaja | |
| dc.contributor.advisor | Bocharova, Irina, juhendaja | |
| dc.contributor.author | Kangur, Uku | |
| dc.contributor.other | Tartu Ülikool. Loodus- ja täppisteaduste valdkond | et |
| dc.contributor.other | Tartu Ülikool. Arvutiteaduse instituut | et |
| dc.date.accessioned | 2023-11-01T14:22:01Z | |
| dc.date.available | 2023-11-01T14:22:01Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | In this thesis, a method is proposed, which is suitable for fast solving of sparse systems of linear equations over finite extension fields for the purpose of improving the speed of decoding related tasks for LDPC codes. The aim of the study is to optimize the Gaussian elimination algorithm for sparse systems of equations, which would solve the problem more efficiently than the standard approach. The proposed method is implemented in the Java language. Its performance is analyzed and tested experimentally. | et |
| dc.identifier.uri | https://hdl.handle.net/10062/93924 | |
| dc.language.iso | eng | et |
| dc.publisher | Tartu Ülikool | et |
| dc.rights | openAccess | et |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | System of linear equations | et |
| dc.subject | finite fields | et |
| dc.subject | sparse matrices | et |
| dc.subject | finite extension fields | et |
| dc.subject | LDPC decoding | et |
| dc.subject.other | bakalaureusetööd | et |
| dc.subject.other | informaatika | et |
| dc.subject.other | infotehnoloogia | et |
| dc.subject.other | informatics | et |
| dc.subject.other | infotechnology | et |
| dc.title | Fast solving of systems of linear equations in decoding of LDPC codes | et |
| dc.type | Thesis | et |