Performance Comparison of
Binary LDPC Decoding Algorithm

View Research

Low-Density Parity-Check (LDPC) codes are linear block codes that are quite simple. LDPC parity check matrices are sparse. That means a little portion of elements in the matrix are nonzero. Tanner Graphs are the graphical representation of LDPC codes. It leads to decoding algorithms that are fairly low complexity.

Leave a Reply