By Topic

Packet-loss resilient coding scheme with only XOR operations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Feng, G.L. ; Univ. of Louisiana, Lafayette, LA, USA ; Deng, R.-H. ; Bao, F.

Application of forward error correction to recover lost packets in higher layers of communication networks is receiving increasing attention. Most of the previous proposals for packet loss recovery use symbol-oriented Reed-Solomon codes operating in symbol erasure-correction mode. A Reed-Solomon code is optimal in the sense that it is maximal distance separable; however, the decoding speed of a Reed-Solomon code is slow since it involves operations over GF(2m) using lookup tables. A packet-oriented (n, k)/(m, l) packet-loss resilient code based on an (n, k) Reed-Solomon code over GF(2m) is given. The code accepts k-packet information sequences and encodes them into n-packet codewords, where each packet consists of m l-bit tuples with l an arbitrary positive integer. The code is designed for efficient operation in software implementations. By letting l be a multiple of the size of the words of the underlying computer, almost all of the decoding operations are XORs of the computer words. Simulation results indicate that the decoding speed of the code is 10-30 times faster than that of the symbol-oriented Reed-Solomon code.

Published in:

Communications, IEE Proceedings-  (Volume:151 ,  Issue: 4 )