Using multi-dimensional parity-check codes to obtain diversity in Rayleigh fading channels

We investigate the use of a class of multi-dimensional parity-check (MDPC) codes as a simple and spectrally efficient means to obtain diversity in Rayleigh fading channels. We demonstrate that the MDPC codes can provide a maximum of 4 degrees of diversity, requiring only a minimal amount of added redundancy. We also propose two techniques, namely parallel and serial code concatenation, to improve the performance of the MDPC codes in Rayleigh fading channels. In the parallel concatenation technique, multiple MDPC codes are parallel concatenated to improve the performance in low signal-to-noise ratio regions. In the serial concatenation technique, a standard convolutional code is employed as an outer code to increase the maximum degree of diversity and provide further coding gain.

[1]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

[2]  John M. Shea,et al.  Multi-dimensional parity-check codes for bursty channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[3]  Daniel J. Costello,et al.  A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.

[4]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

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

[6]  John M. Shea,et al.  Concatenated codes based on multidimensional parity-check codes and turbo codes , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[7]  Dariush Divsalar,et al.  Transfer function bounds on the performance of turbo codes Pasadena , 1995 .

[8]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[9]  John M. Shea Improving the performance of turbo codes through concatenation with rectangular parity check codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).