Skip to main content

Systematic Rate-independent Reed-Solomon (SR-RS) Erasure Correction Scheme
draft-shen-rmt-bb-fec-srrscode-01

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors BZ Shen , Erik Stauffer , Kamlesh Rath
Last updated 2013-05-23 (Latest revision 2012-11-19)
RFC stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Formats
Stream WG state (None)
Document shepherd (None)
IESG IESG state Expired
Consensus boilerplate Unknown
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

Abstract

This document specifies a systematic rate-independent Reed-Solomon (SR-RS) Erasure correction scheme. The two properties, systematic and rate-independent, are fulfilled by Lagrange polynomial interpolation. When the number of output symbols is fixed this scheme essentially generates a Reed-Solomon (RS) code. Therefore, based on the MDS (maximum distance separable) property of RS code, this erasure correction scheme is optimal (ideal). Also in this document, a two-step fast recovering (decoding) algorithm using fast Walsh-Hadamard transform is presented for the proposed erasure correction scheme. This algorithm achieves the time complexity O(n*log2(n)), or linear if penalization implementation, such as multi-core processor, is allowed. Contents 1. Introduction...................................................3 2. Source file segmentation.......................................3 2.1. Transmit block............................................4 2.1.1. Working Blocks.......................................4 2.2. Parameter Selection.......................................4 2.3. Overview of systematic rate-independent encoding ........5 2.4. Parameters and functions used in SR-RS encoding...........6 2.5. SR-RS encoding............................................7 3. SR-RS decoder..................................................8 3.1. Overview of SR-RS decoding................................8 3.2. SR-RS decoding principle..................................9 3.3. A realization of the decoding principle: two-step SR-RS decoding (informative)........................................10 3.4. Fast decoding (informative)..............................11 3.4.1. Hadamard matrices...................................11 3.4.2. Walsh-Hadamard transform............................11 3.4.3. Fast Walsh-Hadamard transform.......................12 3.4.4. Fast SR-RS decoding using fast WHT..................13 4. Protocol IEs..................................................15 4.1. FEC Payload IEs..........................................15 4.2. Common...................................................15 4.3. Scheme Specific..........................................16 5. Conventions used in this document.............................16 6. Security Considerations.......................................17 7. IANA Considerations...........................................17 8. References....................................................17 8.1. Normative References.....................................17 8.2. Informative References...................................17 9. Acknowledgments...............................................17

Authors

BZ Shen
Erik Stauffer
Kamlesh Rath

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)