Packet-loss resilient coding scheme with only XOR operations
Packet-loss resilient coding scheme with only XOR operations
复制标题
仅具有 XOR 运算的丢包弹性编码方案
DOI：
10.1049/ip-com:20040423
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
F. Bao
中科院分区：
文献类型：
--
作者：
G. Feng;R. Deng;F. Bao
应用前向纠错来恢复通信网络高层中丢失的分组正受到越来越多的关注。大多数以前的建议用于分组丢失恢复使用符号导向的里德-所罗门码操作在符号擦除校正模式。Reed-Solomon码在它是最大距离可分离的意义上是最佳的;然而，Reed-Solomon码的解码速度很慢，因为它涉及使用查找表在GF（2 m）上的操作。基于GF（2 m）上的（n，k）Reed-Solomon码，给出了一种面向分组的（n，k）/（m，l）抗分组丢失码.该代码接受k-分组信息序列并将它们编码成n-分组码字，其中每个分组由m个l比特元组组成，l是任意正整数。该代码被设计用于在软件实现中的高效操作。通过让l是底层计算机的字的大小的倍数，几乎所有的解码操作都是计算机字的XOR。仿真结果表明，该码的译码速度比面向符号的Reed-Solomon码快10-30倍。
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.