Fountain codes based on modulo and neural network

In this paper, a new approach to fountain codes named Chinese transform CT codes is proposed. The encoding of CT codes transforms finite original symbols into theoretically infinite encoding symbols, which are generated by integers selected uniformly from the set of primes that are then enveloped into packets by a chaotic position scrambling algorithm. When a sufficient amount of packets are received, there is a 100% chance that the original symbols can be recovered by using the CT decoding algorithm. Using the improved Hopfield neural network to decode the CT codes can significantly increase efficiency and thus advancing the practical use of CT codes. The experiments in this paper demonstrate the feasibility and availability of the encoding and decoding of CT codes.

[1]  Hong Sun,et al.  A neural-like network approach to residue-to-decimal conversion , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[2]  Petar Popovski,et al.  Design and Analysis of LT Codes with Decreasing Ripple Size , 2010, IEEE Transactions on Communications.

[3]  John J. Hopfield,et al.  Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit , 1986 .

[4]  Jorma T. Virtamo,et al.  Performance Analysis of Divided Random Linear Fountain , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[5]  Alexandros G. Dimakis,et al.  Repairable Fountain Codes , 2014, IEEE J. Sel. Areas Commun..

[6]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[7]  Hsie-Chia Chang,et al.  Modified Robust Soliton Distribution (MRSD) with Improved Ripple Size for LT Codes , 2013, IEEE Communications Letters.

[8]  Joachim Hagenauer,et al.  The turbo-fountain , 2006, Eur. Trans. Telecommun..

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[10]  S. Choomchuay,et al.  Algebraic geometry code decoding based on Chinese remainder theorem , 1998, IEEE. APCCAS 1998. 1998 IEEE Asia-Pacific Conference on Circuits and Systems. Microelectronics and Integrating Systems. Proceedings (Cat. No.98EX242).

[11]  Mehrdad Valipour,et al.  Left degree distribution shaping for LT codes over the binary erasure channel , 2014, 2014 27th Biennial Symposium on Communications (QBSC).

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