Low-Density Parity-Check codes

Gregor Kralj (2010) Low-Density Parity-Check codes. EngD thesis.

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.

Item Type:

Thesis (EngD thesis)

Keywords:

- Error Correcting Codes, - Low-Density Parity-Check Codes, - Sum-Product Algorithm, - Additive white Gaussian noise.

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Arjana Žitnik		Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=7671892)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

1065

Date Deposited:

16 Apr 2010 08:46

Last Modified:

13 Aug 2011 00:37

URI:

http://eprints.fri.uni-lj.si/id/eprint/1065

Actions (login required)

View Item