Brendan Babb

Methods and systems for processing data are disclosed. An example method can comprise receiving first data. The method can comprise applying a first transform to the first data. The first transform can be evolved from a second transform. The first transform can be based on first coefficients and the second transform can be based on second coefficients. The first transform can be evolved without constraining a count of the first coefficients to be equal to a count of the second coefficients. The… Show more

Methods and systems for processing data are disclosed. An example method can comprise receiving first data. The method can comprise applying a first transform to the first data. The first transform can be evolved from a second transform. The first transform can be based on first coefficients and the second transform can be based on second coefficients. The first transform can be evolved without constraining a count of the first coefficients to be equal to a count of the second coefficients. The method can comprise providing the transformed first data. Show less

Methods and systems for processing data are disclosed. An example method can comprise receiving first data. The method can comprise applying a first transform to the first data. The first transform can be evolved from a second transform. The first transform can be based on first coefficients and the second transform can be based on second coefficients. The first transform can be evolved without constraining a count of the first coefficients to be equal to a count of the second coefficients. The… Show more

Methods and systems for processing data are disclosed. An example method can comprise receiving first data. The method can comprise applying a first transform to the first data. The first transform can be evolved from a second transform. The first transform can be based on first coefficients and the second transform can be based on second coefficients. The first transform can be evolved without constraining a count of the first coefficients to be equal to a count of the second coefficients. The method can comprise providing the transformed first data. Show less

Overcomes the problem of a triple bit error being interpreted as a single bit error that is then erroneously corrected and written back to memory as correct. Or a quadruple bit error interpreted as no errors. A manipulated error detection matrix by which check bits are generated and decoded so that errors that are detected are next to each other and occur within a nibble. The invention consists of a check bit generator which generates check bits in accordance with a nibble protect matrix… Show more

Overcomes the problem of a triple bit error being interpreted as a single bit error that is then erroneously corrected and written back to memory as correct. Or a quadruple bit error interpreted as no errors. A manipulated error detection matrix by which check bits are generated and decoded so that errors that are detected are next to each other and occur within a nibble. The invention consists of a check bit generator which generates check bits in accordance with a nibble protect matrix according to a Modified Hamming Code which is configured to provide detection of triple and quadruple bit errors occurring within a nibble. The check bits are compared to those in memory by a syndrome generator. An error corrector and an error detector decode syndrome bits. Show less

The present invention addresses the need in the art by providing a novel approach to the correction of errors in check bits in an encoded data word. The data word is read from memory and new check bits are generated and compared to the check bits from memory. If a single error is located in the check bits and not in the data word, the error-free data word is released and the the newly created correct check bits are released and written back into memory over the check bits that had an error. At… Show more

The present invention addresses the need in the art by providing a novel approach to the correction of errors in check bits in an encoded data word. The data word is read from memory and new check bits are generated and compared to the check bits from memory. If a single error is located in the check bits and not in the data word, the error-free data word is released and the the newly created correct check bits are released and written back into memory over the check bits that had an error. At the time of invention, most error detection and correction chips would never fix the error in the check bits. So each time the data was read it would find an error and be analyzed to see where the error was, correct it in the check bits but then only release the data word, which took up time. This new method outputs the correct data and check bits in the same cycle and in the same time it would take for data and check bits without an error, and also corrects it in memory. Show less

The present invention substantially overcomes many of the problems associated with prior art error detection codes by providing a novel approach to detecting and correcting multiple bit errors. The invention organizes the data word into a matrix of n by m bits, where n is the number of m bit groups. Parity bits are generated for each column and each row and used to detect single, double and triple bit errors.