Performance analysis for collaborative decoding with least-reliable-bits exchange on AWGN channels

Collaborative decoding is an approach that can achieve diversity and combining gain by exchanging decoding information among a cluster of physically separated receivers. On AWGN channels, the least-reliable-bits (LRB) exchange scheme can achieve performance close to equal-gain combining (EGC) of all received symbols from all receivers, while reducing the amount of information that must be exchanged. In this paper, we analyze the error performance of collaborative decoding with the LRB exchange scheme when nonrecursive convolutional codes are used. The analysis is based on the observation that the extrinsic information generated in the collaborative decoding of these convolutional codes can be approximated by Gaussian random variables. A density-evolution model based on a single maximum a posteriori decoder is used to obtain the statistical characteristics of the extrinsic information. With the statistical knowledge of the extrinsic information, we develop an approximate upper bound for the error performance of the collaborative decoding process. Numerical results show that our analysis gives very good predictions of the bit error rate for collaborative decoding with LRB exchange. At high signal-to-noise ratios collaborative decoding with properly chosen parameters can achieve the same error performance as EGC of all received symbols from all receiving nodes.

[1]  Sergio Benedetto,et al.  Design of fixed-point iterative decoders for concatenated codes with interleavers , 2001, IEEE J. Sel. Areas Commun..

[2]  John M. Shea,et al.  Iterative decoding in a two-node distributed array , 2002, MILCOM 2002. Proceedings.

[3]  J.M. Shea,et al.  Improving the efficiency of reliability-based hybrid-ARQ with convolutional codes , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[4]  Guido Tartara,et al.  Probability density functions of soft information , 2002, IEEE Communications Letters.

[5]  John M. Shea,et al.  Distributed decoding of r ectangular parity-check code , 2002 .

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

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

[8]  Geoffrey J. McLachlan,et al.  Finite Mixture Models , 2019, Annual Review of Statistics and Its Application.

[9]  John M. Shea,et al.  Reliability-based hybrid ARQ and rate-compatible punctured convolutional (RCPC) codes , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[10]  Dariush Divsalar,et al.  Iterative turbo decoder analysis based on density evolution , 2001, IEEE J. Sel. Areas Commun..

[11]  Dariush Divsalar,et al.  Some new twists to problems involving the Gaussian probability integral , 1998, IEEE Trans. Commun..

[12]  Xin Li,et al.  Bit-interleaved rectangular parity-check coded modulation with iterative demodulation in a two-node distributed array , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[13]  Amir H. Banihashemi,et al.  Reliability-based schedule for bit-flipping decoding of low-density Parity-check codes , 2004, IEEE Transactions on Communications.

[14]  Xin Li,et al.  Reliability exchange schemes for iterative packet combining in distributed arrays , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..