Browse Prior Art Database

Errors Per Interleave Test for Error Correction Code

IP.com Disclosure Number: IPCOM000108200D
Original Publication Date: 1992-May-01
Included in the Prior Art Database: 2005-Mar-22
Document File: 2 page(s) / 79K

Publishing Venue

IBM

Related People

Frey, DE: AUTHOR

Abstract

A method for ensuring that the detect capability of an error correcting code algorithm provides the necessary protection for product quality is described. (Image Omitted)

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Errors Per Interleave Test for Error Correction Code

       A method for ensuring that the detect capability of an
error correcting code algorithm provides the necessary protection for
product quality is described.

                            (Image Omitted)

      If the total length of bytes (information bytes plus encoding
bytes) in a Reed Solomon, or similar error correcting code, could be
arbitrarily large, then the probability of error could be effectively
zero.  In practice, this is not the case, and limits exist on the
probability of error (miscorrection and/or undetection). Every
implementation of error correcting code carries with it a probability
of error based on assumptions of design characteristics.  When the
assumptions are wrong, the calculated probability of error is wrong.
The Errors Per Interleave Test is a methodology that can be used to
prove or disprove that design assumptions are valid and that required
protection against error exists.

      Detection and correction capability can be increased
significantly in error correcting code by placing the data into
interleaves.  The figure shows 16 sequential bytes of data.  Even
addressed bytes are in one interleave, and odd addressed bytes are in
a second interleave.  If a Reed Solomon code, capable of correcting a
2-byte burst and detecting a 3-byte burst per interleave, is applied
to each of these interleaves, then this implementation can correct a
4-byte burst and detect a 6-byte burst between the two interleaves.
Interleaves can be intertwined numerous ways like this in order to
produce optimum error correcting code for a given application.

      The Errors Per Interleave Test is a means to verify that, given
all worst-case cond...