Paritetne kode z nizko gostoto

Abstract

Keywords

Data

Language:	Slovenian
Year of publishing:	2010
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[G. Kralj]
UDC:	004(043.2)
COBISS:	7671892
Views:	839
Downloads:	241
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	[Low-density parity-check codes]
Secondary abstract:	Transmition of data over various communication systems is lossy, because of all the noise affecting the communication channel. One of the most useful ways to achieve reliable transmision are error correcting codes. Recently, low-density parity-check codes became very popular. These codes can come arbitrarily close to the Shannon limit and because of the technology development their coding and decoding algorithms are reasonably fast. In this graduation thesis, low density parity check (LDPC) codes are studied. The progressive edge growth (PEG) algorithm for generating such codes is presented and iterative decoding algorithm (SPA) is described. For the communication channel model, additive white Gaussian noise channel is used. In the last section of the thesis, efficiency of the presented decoding algorithm is examined for matrices of various dimensions, that were generated with algorithm PEG. The rate of bit errors or the number of iterations for correct decoding was counted for different levels of noise. Results show that in the tested cases, parity check codes of larger dimensions perform better than the parity check codes of lower dimensions.
Secondary keywords:	error correcting codes;low-density parity-check codes;sum-product algorithm;additive white Gaussian noise;computer science;diploma;
File type:	application/pdf
Type (COBISS):	Undergraduate thesis
Thesis comment:	Univerza v Ljubljani, Fakulteta za računalništvo in informatiko
Pages:	60 str.
ID:	23890621