Multi-dimensional data protection and mirroring method for...

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S781000

Reexamination Certificate

active

07103824

ABSTRACT:
The invention discloses a data validation, mirroring and error/erasure correction method for the dispersal and protection of one and two-dimensional data at the micro level for computer, communication and storage systems. Each of 256 possible 8-bit data bytes are mirrored with a unique 8-bit ECC byte. The ECC enables 8-bit burst and 4-bit random error detection plus 2-bit random error correction for each encoded data byte. With the data byte and ECC byte configured into a 4 bit×4 bit codeword array and dispersed in either row, column or both dimensions the method can perform dual 4-bit row and column erasure recovery. It is shown that for each codeword there are 12 possible combinations of row and column elements called couplets capable of mirroring the data byte. These byte level micro-mirrors outperform conventional mirroring in that each byte and its ECC mirror can self-detect and self-correct random errors and can recover all dual erasure combinations over four elements. Encoding at the byte quanta level maximizes application flexibility. Also disclosed are fast encode, decode and reconstruction methods via boolean logic, processor instructions and software table look-up with the intent to run at line and application speeds. The new error control method can augment ARQ algorithms and bring resiliency to system fabrics including routers and links previously limited to the recovery of transient errors. Image storage and storage over arrays of static devices can benefit from the two-dimensional capabilities. Applications with critical data integrity requirements can utilize the method for end-to-end protection and validation. An extra ECC byte per codeword extends both the resiliency and dimensionality.

REFERENCES:
patent: 3868632 (1975-02-01), Hong et al.
patent: 4513420 (1985-04-01), Collins et al.
patent: 5128810 (1992-07-01), Halford
patent: 5271012 (1993-12-01), Blaum et al.
patent: 5283791 (1994-02-01), Halford
patent: 5347637 (1994-09-01), Halford
patent: 5485474 (1996-01-01), Rabin
patent: 5579475 (1996-11-01), Blaum et al.
patent: 6088330 (2000-07-01), Bruck et al.
patent: 6128277 (2000-10-01), Bruck et al.
patent: 6138125 (2000-10-01), DeMoss
patent: 6158026 (2000-12-01), Kawahara
patent: 6360348 (2002-03-01), Yang
patent: 6557123 (2003-04-01), Wiencko, Jr. et al.
patent: 2004/0114484 (2004-06-01), Sako et al.
patent: 563491 (1993-10-01), None
David Mazières; V22.0480-005 lecture notes, No. 13 “Error detection/Quiz review”; available at www.scs.stanford.edu
yu/04sp
otes/I13.pdf.
Dariush Dabiri and Ian F. Blake; Fast Parallel Algorithms forDecoding Reed-Solomon Codes Based on Remainder Polynomials; IEEE Transactions on Information Theory, vol. 41, No. 4, Jul. 1995; pp. 873-885.
Elwyn Belekamp,Algebraic Coding Theory, 1968, pp. 90-91, 139-141, and 144 (book).
Patterson et al., University of Califronia—Berkeley,A case for Redundant Array of Inexpensive Disks(RAID), 1987, (paper).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Multi-dimensional data protection and mirroring method for... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multi-dimensional data protection and mirroring method for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-dimensional data protection and mirroring method for... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3600334

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.