The development of turbo and LDPC codes for deep-space applications

被引:82
作者
Andrews, Kenneth S. [1 ]
Divsalar, Dariush [1 ]
Dolinar, Sam [1 ]
Hamkins, Jon [1 ]
Jones, Christopher R. [1 ]
Pollara, Fabrizio [1 ]
机构
[1] CALTECH, Pasadena, CA 91109 USA
基金
美国国家航空航天局;
关键词
bounds; Consultative Committee for Space Data Systems (CCSDS); error-correction coding; low-density parity-check (LDPC) code; protograph; spacecraft; space vehicle communication; turbo code;
D O I
10.1109/JPROC.2007.905132
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The development of error-correcting codes has been closely coupled with deep-space exploration since the early days of both. Since the discovery of turbo codes in 1993, the research community has invested a great deal of work on modern iteratively decoded codes, and naturally NASA's Jet Propulsion Laboratory (JPL) has been very much involved. This paper describes the research, design, implementation, and standardization work that has taken place at JPL for both turbo and low-density parity-check (LDPC) codes. Turbo code development proceeded from theoretical analyses of polynomial selection, weight distributions imposed by interleaver designs, decoder error floors, and iterative decoding thresholds. A family of turbo codes was standardized and implemented and is currently in use by several spacecraft. JPL's LDPC codes are built from protographs and circulants, selected by analyses of decoding thresholds and methods to avoid loops in the code graph. LDPC encoders and decoders have been implemented in hardware for planned spacecraft, and standardization is under way.
引用
收藏
页码:2142 / 2156
页数:15
相关论文
共 74 条
[1]  
ABBASFAR A, 2004, P IEEE INT S INF THE
[2]  
Andrews K, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P2300
[3]  
ANDREWS K, 2002, 42148 CA IPN
[4]  
ANDREWS K, 1999, THESIS CORNELL U ITH
[5]  
[Anonymous], TM SYNCHR CHANN COD
[6]  
[Anonymous], 1988, PROBABILISTIC REASON, DOI DOI 10.1016/C2009-0-27609-4
[7]  
[Anonymous], LOW DENS PAR CHECK C
[8]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[9]   AVERAGE PERFORMANCE OF PARALLEL CONCATENATED BLOCK-CODES [J].
BENEDETTO, S ;
MONTORSI, G .
ELECTRONICS LETTERS, 1995, 31 (03) :156-158
[10]   Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding [J].
Benedetto, S ;
Divsalar, D ;
Montorsi, G ;
Pollara, F .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :909-926