Packet-loss resilient coding scheme with only XOR operations

• Main Authors: FENG, Gui Liang, DENG, Robert H., BAO, Feng
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2004
• Subjects: Reed-Solomon code; XOR operation; arbitrary positive integer; communication network; forward error correction; n-packet codeword; packet information sequence; packet-loss resilient coding scheme; software implementation; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/1087; https://ink.library.smu.edu.sg/context/sis_research/article/2086/viewcontent/Packet_loss_resilient_coding_scheme_with_only_XOR_.pdf
• Institution: Singapore Management University

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.