On the design of a low-complexity joint bit-packet coding scheme for AWGN channels

In this paper, a low-complexity joint design of bit-level and packet-level coding is investigated. In the proposed design structure, a low-complexity iterative decoding algorithm is considered, which is capable of using the Gaussian approximation method for analysing the decoding performance. When the performance of the bit-level coding is given, we analyse the asymptotic convergence of the packet-level coding, which is utilised for optimising the rate of the packet-level code. Based on our proposed optimisation method, an optimal code rate for the scheme can be theoretically acquired. Our numerical results show that the proposed low-complexity joint bit-packet coding scheme has an attractive performance.

[1]  Ming Xiao,et al.  Efficient packet combining based on packet-level coding , 2011 .

[2]  Mikel Hernaez,et al.  On the design of a novel joint network-channel coding scheme for the multiple access relay channel , 2013, IEEE Journal on Selected Areas in Communications.

[3]  Baoming Bai,et al.  On Short Forward Error-Correcting Codes for Wireless Communication Systems , 2007, 2007 16th International Conference on Computer Communications and Networks.

[4]  C. T. Bhunia,et al.  Modified packet combining using error forecasting decoding to control error , 2005, Third International Conference on Information Technology and Applications (ICITA'05).

[5]  Chandan Tilak Bhunia,et al.  Packet Reversed Packet Combining Scheme: A Thorough Analysis , 2012, 2012 Ninth International Conference on Information Technology - New Generations.

[6]  Gerald Matz,et al.  Joint network-channel coding in the multiple-access relay channel: Beyond two sources , 2012, 2012 5th International Symposium on Communications, Control and Signal Processing.

[7]  Chandan Tilak Bhunia.  Packet Reversed Packet Combining Scheme , 2007, 7th IEEE International Conference on Computer and Information Technology (CIT 2007).

[8]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix , 2005, IEEE Transactions on Information Theory.

[9]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[10]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[11]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[12]  Jørn Justesen,et al.  Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.

[13]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[14]  Bo Rong,et al.  Joint network channel fountain scheme for reliable communication in wireless networks , 2014, 2014 International Conference on Computing, Networking and Communications (ICNC).