Recursive Convolutional Codes for Time-Invariant LDPC Convolutional Codes

被引:4
作者
Roy, Eric [1 ]
Cardinal, Christian [1 ]
Haccoun, David [1 ]
机构
[1] Ecole Polytech Montreal, Dept Elect Engn, Quebec City, PQ, Canada
来源
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2010年
关键词
Low-Density Parity-Check Codes; capacity; convolutional codes; doubly-orthogonal conditons; iterative decoding; COMPLEXITY;
D O I
10.1109/ISIT.2010.5513622
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we present an attractive alternative to construct time-invariant Low-Density Parity-Check Convolutional Codes (LDPC-CC) of coding rate-b/c from a simple recursive systematic convolutional encoder design. The proposed Recursive Convolutional Doubly-Orthogonal (RCDO) encoders have a corresponding Tanner graph for which the girth is controlled by the doubly-orthogonal conditions that are imposed onto the set of generators that represent the encoder. Therefore, RCDO encoders can be decoded using simply a cascade of the same threshold decoder. The convergence behavior of the iterative decoder is then controlled by the position and by the number of forward and feedback connections that constitute the encoder. RCDO encoders give rise to a class of capacity approaching codes that use simple encoder and decoder structures.
引用
收藏
页码:834 / 838
页数:5
相关论文
共 13 条
[1]  
[Anonymous], 2003, 42154 JPL INP
[2]   Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes [J].
Cardinal, C ;
Haccoun, D ;
Gagnon, F .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (08) :1274-1282
[3]   Convolutional self doubly orthogonal codes for iterative decoding without interleaving [J].
Cardinal, C ;
Haccoun, D ;
Gagnon, F ;
Batani, N .
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, :280-280
[4]  
Cardinal C, 2008, IEEE VTS VEH TECHNOL, P1176
[5]   Tradeoff of complexity and latency of iterative decoding for orthogonal convolutional codes [J].
He, Y. -C. ;
Haccoun, D. ;
Cardinal, C. .
IET COMMUNICATIONS, 2008, 2 (03) :440-448
[6]   An analysis of the orthogonality structures of convolutional codes for iterative decoding [J].
He, YC ;
Haccoun, D .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3247-3261
[7]   Regular and irregular progressive edge-growth tanner graphs [J].
Hu, XY ;
Eleftheriou, E ;
Arnold, DM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398
[8]  
Johannesson R., 1999, FUNDAMENTALS CONVOLU
[9]  
Lin S., 2004, Error Control Coding
[10]  
MacKay D.J. C., Online database of low-density parity check codes