Improved Progressive Edge-Growth Algorithm for Fast Encodable LDPC Codes

The Progressive Edge-Growth (PEG) algorithm is known to construct Low-Density Parity-Check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. Low-Density Parity-Check (LDPC) codes, which were first proposed in the early 1960's and re-discovered in 1996, have recently attracted much attention due to their capacity-approaching performance and low decoding complexity. Since, their re-discovery, there are many methods such as the message-passing decoding and the linear program decoding that have been proposed for the decoding algorithm.

Provided by: Springer Science+Business Media Topic: Networking Date Added: May 2012 Format: PDF

Find By Topic