Irregular progressive edge-growth (PEG) Tanner graphs

Abstract

A method for constructing Tanner graphs possessing a large girth by progressively establishing edges between symbol and check nodes in an edge-by-edge manner was proposed. The approach was found to be efficient for generating good regular and irregular LDPC codes of short and moderate block lengths. A good degree of sequences of short binay LDPC codes were obtained using the approach combined with Monte-Carlo simulation of progressive edge-growth (PEG) codes.