Pseudo-random construction and reduced complexity decoding for low density parity check codes /

The bipartite graph of an LDPC code is typically constructed at random. The memory required to store the randomly constructed parity-check matrix at the decoder can be prohibitive in some applications. When a system has a set of different LDPC codes, each of the parity-check matrices need to be stor...

Full description

Bibliographic Details

Main Author:	Prabhakar, Abhiram
Format:	Thesis eBook
Language:	English
Published:	[Place of publication not identified] : [publisher not identified] ; 2001.
Subjects:	Major electrical engineering.
Online Access:	Link to OAKTrust copy