Publication Type

Conference Proceeding Article

Version

submittedVersion

Publication Date

8-2004

Abstract

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.

Keywords

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

Discipline

Information Security

Research Areas

Cybersecurity

Publication

IEE Proceedings: Communications

Volume

151

Issue

4

First Page

322

Last Page

328

ISSN

1350-2425

Identifier

10.1049/ip-com:20040423

Publisher

IEEE

City or Country

Piscataway, NJ

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1049/ip-com:20040423

Download

Share

COinS