Citation
Abstract
We introduce a new class of low-density parity-check (LDPC) codes constructed from a template called a protograph. The protograph serves as a blueprint for constructing LDPC codes of arbitrary size whose performance can be predicted by analyzing the protograph. We apply standard density evolution techniques to predict the performance of large protograph codes. Finally, we use a randomized search algorithm to find good protographs.
Keywords
LCPC codes
protographs
Details
- Volume
- 42-154
- Published
- August 15, 2003
- Pages
- 1–7
- File Size
- 101.9 KB