摘要:
A method for adaptively controlling the error correction redundancy is presented. The method utilizes test information collected at the file characterization test to adaptively determine the quantity of error correction code bytes needed at a multitude of levels of the error correction scheme. The error correction needed at the sub-block level is determined from a measurement of the back ground noise floor. At the block level the file characterization is specific to zones identified by head, disk, sector and cylinder. The formatting efficiency of the drive is increased by adaptively linking the length of the error correction code to the location of the zone. By measuring the error rate (E/R) on a per zone basis and comparing this rate to the disk level E/R the ECC can be optimized on a per-zone basis. The method is implemented by modeling a probability distribution as a first polynomial having a basis, converting the first polynomial to a second polynomial having a different basis, and by defining a Hamming distance distribution from the second polynomial. In a preferred embodiment, modeling the probability distribution includes modeling as a Charlier polynomial, and converting to the second polynomial includes converting to a Krawtchouck polynomial, and using connection coefficients that are calculated recursively.
摘要:
An encoding system and associated method protect against miscorrection due to parity sector correction in, for example, an on-drive RAID system. The system adds a parity cluster block, which itself is a complete, C3-protected cluster. Having the cluster level, C4 level correction, by parity sectors, checked and verified by C3 checks that have high reliability level, as well as the capability for checking consistency of a cluster block, even in the presence of nulljaminull errors, makes this possibility unlikely. A scrub algorithm avoids read-modify-write operations by deferring the completion of the C2 and C3-ckecks until the storage device is idle.
摘要:
A system and associated method efficiently complete write commands in an ISF disk drive/RAID system with minimal disk accesses to the underlying disk drives. The system updates data in a parity-based disk array system by receiving a write command to write new data. The present system minimizes the number of disk accesses. The present system completes the same or comparable write commands in a total of four accesses to the disk drives. This is realized by combining the read-modify-write operation of updating one or more sectors in an ISF cluster with the read-modify-write operation associated with updating one or more sectors in a parity-based array system, such as a RAID-5 system.
摘要:
An error correction algebraic decoder and an associated method correct a combination of a B-byte burst of errors and t-byte random errors in a failed sector, by iteratively adding and removing an erasure (NnullB) times until the entire failed sector has been scanned, provided the following inequality is satisfied: (Bnull2t)null(Rnull1), where N denotes the number of bytes, B denotes the length of the burst of errors, t denotes the total number of random errors, and R denotes the number of check bytes in the failed sector. This results in a corrected sector at a decoding latency that is a generally linear function of the number of the check bytes R, as follows: Decoding Latencynull5R(NnullB).
摘要:
A method and an apparatus encodes and decodes blocks having a predetermined number of sectors of data bytes to detect and correct data bytes in error in each sector of a block. The method and the apparatus generates sector level check bytes for each sector in the block responsive to the data bytes in each sector according to a first level of an error correction code, and generates block level check bytes for a predetermined sector in the block responsive to the sector level check bytes of various sectors, including the predetermined sector, according to at least a second level of the error correction code. The method and apparatus processes the block to detect and correct data bytes in error in each sector within the capability of the sector level check bytes, to detect and correct data bytes in error in the at least two sectors that exceed the correction capability of the sector level check bytes but within the correction capability of the block level check bytes, or to indicate that the data bytes in error in the at least two sectors exceed the correction capability of each of the sector level check bytes and the block level check bytes. The method and apparatus improves signal quality for long streams of information having multiple sequential physical blocks of data bytes, such as audio visual information, with a low check byte overhead while being compatible with conventional 512 data byte sized sectors and conventional single sector error correction code processes.
摘要:
An error correction algebraic decoder uses a key equation solver for calculating the roots of finite field polynomial equations of degree up to six, and lends itself to efficient hardware implementation and low latency direction calculation. The decoder generally uses a two-step process. The first step is the conversion of quintic equations into sextic equations, and the second step is the adoption of an invertible Tschirnhausen transformation to reduce the sextic equations by eliminating the degree 5 term. The application of the Tschirnhausen transformation considerably decreases the complexity of the operations required in the transformation of the polynomial equation into a matrix. The second step defines a specific Gaussian elimination that separates the problem of solving quintic and sextic polynomial equations into a simpler problem of finding roots of a quadratic equation and a quartic equation.