© The Institution of Engineering and Technology
The receiver with message propagation (MP) decoder algorithm realises the decoding of traditional Luby transform (LT) encoded packages when there is only one unknown packet adjacent to the encoded package. Error packets can be recovered by decoding with jointing product code composed of shifted Luby transform (SLT)-encoded package and error packets. In this study, error correction scheme based on single feedback of SLT-encoded package was adopted for the recovery of received partial error packets over the erasure channel. The scheme of an MP decoder with an error correction code was proposed, and expand shifted robust soliton distribution (ESRSD) appropriate for the scheme feature was designed. Experimental results indicate that the scheme effectively improves the efficiency of the decoder. Compared with the traditional shifted robust soliton distribution, the ESRSD has better decoding performance for the LT code.
References
-
-
1)
-
4. Chen, Y.Y., Liu, W.: ‘Compressed fountain codes based on new random degree distribution’, J. Electron. Inf. Technol., 2012, 34, (5), pp. 1185–1190.
-
2)
-
10. Guosen, Y., Uppal, M., Xiaodong, W.: ‘Doped LT decoding with application to wireless broadcast service’. Proc. Int. Conf. Communications (ICC), Kyoto, Japan, June 2011, pp. 1–5.
-
3)
-
9. Sørensen, J.H., Popovski, P., Ostergaard, J.: ‘Feedback in LT codes for prioritized and non-prioritized data’. Proc. Int. Conf. Vehicular Technology Conference (VTC Fall), Quebec City, Canada, September 2012, pp. 1–5.
-
4)
-
7. Andrew, H., Sachin, A., Davi, S.: ‘Trachtenberg Ari. Rateless coding with feedback’. Proc. Int. Conf. INFOCOM 2009, Rio de Janeiro, Brazil, April 2009, pp. 1791–1799.
-
5)
-
11. Lei, Z., Jianxin, L., Jingyu, W., Qi, Q.: ‘Diversified SLT codes based on feedback for communication over wireless networks’. Proc. Int. Conf. Global Information Infrastructure Symp., Trento, Italy, October 2013, pp. 1–6.
-
6)
-
8. Sorensen, J.H., Koike-Akino, T., Orlik, P.: ‘Rateless feedback codes’. Proc. Int. Conf. Information Theory Proceedings, Cambridge, England, July 2012, pp. 1767–1771.
-
7)
-
17. Beimel, A., Dolev, S., Singer, N.: ‘RT oblivious erasure correcting’, IEEE Trans. Netw., 2007, 15, (6), pp. 1321–1332 (doi: 10.1109/TNET.2007.896540).
-
8)
-
13. Sorensen, J.H., Popovski, P., Ostergaard, J.: ‘Design and analysis of LT codes with decreasing ripple size’, IEEE Trans. Commun., 2012, 60, (11), pp. 3191–3197 (doi: 10.1109/TCOMM.2012.091112.110864).
-
9)
-
J.W. Byers ,
M. Luby ,
M. Mitzenmacher
.
A digital fountain approach to asynchronous reliable multicast.
IEEE J. Sel. Areas Commun.
,
8 ,
1528 -
1540
-
10)
-
J. Hagenauer ,
E. Offer ,
L. Papke
.
Iterative decoding of binary block and convolutional codes.
IEEE Trans. Inf. Theory
,
429 -
445
-
11)
-
6. Agarwal, S., Hagedorn, A., Trachtenberg, A.: ‘Adaptive rateless coding under partial information’. Proc. Int. Conf. Information Theory and Applications Workshop, San Diego, America, January 2008, pp. 5–11.
-
12)
-
3. Luby, M.: ‘Lt codes’. Proc. 43rd Symp. Foundations of Computer Science, 2002, pp. 271–282 (doi: 10.1109/SFCS.2002.1181950).
-
13)
-
2. MacKay, D.J.C.: ‘Fountain codes’, Communications, 2005, 152, (6), pp. 1062–1068.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2014.0246
Related content
content/journals/10.1049/iet-com.2014.0246
pub_keyword,iet_inspecKeyword,pub_concept
6
6