Performance of low-density generator matrix codes at short block lengths

dc.contributor.author	Jin, Lei
dc.date.accessioned	2013-11-07T18:13:58Z
dc.date.available	2013-11-07T18:13:58Z
dc.date.created	2006
dc.date.issued	2006
dc.degree.level	Masters
dc.degree.name	M.A.Sc.
dc.description.abstract	It is often necessary to apply codes with short block lengths in many delay-sensitive applications. In this thesis, primarily driven by their complexity advantages, we investigate and explore the performance of low-density generator rnatrix (LDGM) codes [1] at short block lengths. We show that with proper constructions LDGM (codes may perform no worse than the state-of-the-art, low-density parity-check codes (LDPC) [2] but with lower complexity. Our construction of LDGM codes uses the Progressive Edge-Growth (PEG) algorithm [3], originally proposed for LDPC codes.
dc.format.extent	64 p.
dc.identifier.citation	Source: Masters Abstracts International, Volume: 45-05, page: 2603.
dc.identifier.uri	http://hdl.handle.net/10393/27378
dc.identifier.uri	http://dx.doi.org/10.20381/ruor-18677
dc.language.iso	en
dc.publisher	University of Ottawa (Canada)
dc.subject.classification	Engineering, Electronics and Electrical.
dc.title	Performance of low-density generator matrix codes at short block lengths
dc.type	Thesis

Files

Now showing 1 - 1 of 1