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

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.