EXIT Functions for Randomly Punctured Systematic Codes

In this paper, the extrinsic information transfer (EXIT) functions of randomly punctured systematic codes (RP-SCs) are analyzed. We consider the systematic encoder to consist of a non-systematic code (NC) and a parallel path for the systematic bits; puncturing of the systematic and the parity bits is then carried out separately. We show that the decoding model for measuring the EXIT characteristics of a RP-SC can be transformed into a decoding model of the underlying NC. For the special case where the a priori/ communication channels are modeled by binary erasure channels, it becomes obvious that the EXIT functions of any RP-SC can be analytically derived from the EXIT functions of the underlying NC. This theoretical result is verified by a comparison to simulated EXIT functions.

[1]  Fulvio Babich,et al.  On Rate-Compatible Punctured Turbo Codes Design , 2005, EURASIP J. Adv. Signal Process..

[2]  Steven W. McLaughlin,et al.  Rate-compatible puncturing of low-density parity-check codes , 2004, IEEE Transactions on Information Theory.

[3]  Faramarz Fekri,et al.  Results on punctured LDPC codes , 2004, Information Theory Workshop.

[4]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[5]  Jörg Kliewer,et al.  On the achievable extrinsic information of inner decoders in serial concatenation , 2006, 2006 IEEE International Symposium on Information Theory.

[6]  Ragnar Thobaben,et al.  Design considerations for iteratively-decoded source-channel coding schemes , 2006 .

[7]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[8]  S. Brink.  Rate one-half code for approaching the Shannon limit by 0.1 dB , 2000 .

[9]  Lars K. Rasmussen,et al.  Multiple parallel concatenated codes with optimal puncturing and energy distribution , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[10]  N. Dütsch.  Code Optimization for Lossless Turbo Source Coding , 2005 .

[11]  Johannes B. Huber,et al.  Bounds on information combining , 2005, IEEE Transactions on Information Theory.

[12]  Emina Soljanin,et al.  Punctured turbo code ensembles , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[13]  R. Thobaben.  A new transmitter concept for iteratively-decoded source-channel coding schemes , 2007, 2007 IEEE 8th Workshop on Signal Processing Advances in Wireless Communications.

[14]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.