Design and Standardization of Low-Density Parity-Check Codes for Space Applications

In the last decade, a family of 16 low-rate turbo codes were designed and standardized, and decoders were built for each of the three ground complexes of the Deep Space Network (DSN). These codes are now flying on several missions, including MRO, MESSENGER, and STEREO. A brief summary of the turbo code family is presented, along with a performance and complexity comparison to NASA’s legacy codes. In the last few years, exciting research developments have produced ten higher rate low-density parity-check (LDPC) codes for the high-data-rate missions anticipated in the coming decades. Originally invented by R. Gallager in his PhD thesis in 1960, this coding technique was largely forgotten for more than 30 years. The primary advance in LDPC codes is the discovery of an iterative decoding algorithm, now called Belief Propagation (BP) decoding, which offers near-optimum performance for large linear LDPC codes at a manageable complexity. The performance gains of LDPC codes were difficult to realize technologically in the early 1960s. Several decades of VLSI development have finally made the implementation of these codes practical. The renaissance of LDPC codes did not mark the end of turbo codes, however. LDPC codes have performance and complexity advantages over turbo codes at high code rates, but turbo codes are currently still the best solution for the lower code rates. This natural partition means that the standard family of turbo codes at rates 1/6, 1/4, 1/3, and 1/2 can live in harmony with a proposed standard of LDPC codes at rates 1/2, 2/3, 4/5, and 7/8. LDPC codes hold the promise of significantly lower decoding complexity and error-floors than turbo codes, while still achieving near-capacity performance. A summary is presented of the performance and complexity of the LDPC code family and related codes developed by NASA, along with a description of recent FPGA implementations at speeds in excess of 100 Msps. Synchronization aspects at low SNR are also discussed, and the status of infusion of this new technology in NASA missions is addressed. Standardization of LDPC codes by the CCSDS has proven challenging. In part, this is because the class of LDPC codes is very large, and their differences can be small. There is also a long list of desirable attributes, and no code is superior in all categories. The status of the standardization process is described, including a discussion of the advantages and disadvantages of the proposed candidates.

[1]  David J. C. MacKay,et al.  Comparison of constructions of irregular Gallager codes , 1999, IEEE Trans. Commun..

[2]  Dariush Divsalar,et al.  The Development of Turbo and LDPC Codes for Deep-Space Applications , 2007, Proceedings of the IEEE.

[3]  Roger J. Green,et al.  Simplified analysis of QAM BER impairment in hybrid AM/QAM lightwave systems , 1999, IEEE Trans. Commun..

[4]  Samuel Dolinar,et al.  Methodologies for designing LDPC codes using protographs and circulants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[5]  Dennis Lee,et al.  Integrated Performance of Next Generation High Data Rate Receiver and AR4JA LDPC Codec for Space Communications , 2008 .

[6]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[7]  Samuel Dolinar,et al.  A VLSI decomposition of the deBruijn graph , 1989, JACM.

[8]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[9]  S. Brink Convergence of iterative decoding , 1999 .

[10]  Dariush Divsalar,et al.  Code Performance as a Function of Block Size , 1998 .

[11]  Hesham El Gamal,et al.  Analyzing the turbo decoder using the Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[12]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[13]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[14]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[15]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[16]  J. Massey,et al.  Optimum Frame Synchronization , 1972, IEEE Trans. Commun..

[17]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[18]  C. Jones,et al.  Functions and Architectures for LDPC Decoding , 2007, 2007 IEEE Information Theory Workshop.

[19]  J. Thorpe Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[20]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.