JPL Technical Report Server

Construction of protograph LDPC codes with linear minimum distance

Show simple item record Divsalar, Dariush Dolinar, Sam Jones, Christopher 2006-10-05T22:28:33Z 2006-10-05T22:28:33Z 2006-07-09
dc.identifier.citation IEEE International Symposium on Information Theory, Seattle, Washington, July 9-14, 2006. en
dc.identifier.clearanceno 06-1638
dc.description.abstract A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very highdegree node in the base protograph. A family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted. en
dc.description.sponsorship NASA/JPL en
dc.format.extent 397670 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US en
dc.publisher Pasadena, CA : Jet Propulsion Laboratory, National Aeronautics and Space Administration, 2006. en
dc.subject Low-density parity-check (LDPC) en
dc.title Construction of protograph LDPC codes with linear minimum distance en
dc.type Preprint en

Files in this item

This item appears in the following Collection(s)

Show simple item record



My Account