Abstract:
A SERIES OF SELF-CHECKING ERROR CHECKING CIRCUITS ARE DISCLOSED FOR CHECKING K-OUT-OF-N CODED DATA LINES. THE N LINES ARE BROKEN INTO TWO, PREFERABLY EQUAL, GROUPS. A LOGIC EQUATION IS DERIVED FOR EACH GROUP OF LINES WHEREBY, WITH ANY K-OUT-OF-N CODED DATA SIGNALS APPLIED TO THE INPUT, AT LEAST TWO COMPLEMENTARY OUTPUT SIGNALS ARE PRODUCED. ANY ERROR APPEARING IN THE RECEIVED CODE WILL BE INDICATED AS SUCH BY NON-COMPLEMENTARY OUTPUTS FROM
THE CHECKER IN THE OUTPUT OF THE CHECKER. MALFUNCTIONS OR FAILURES IN THE CHECKING CIRCUIT ARE CHECKED BY CERTAIN LEGITIMATE CODE SIGNALS WHICH SIMILARLY CAUSE AN ERROR REPRESENTATION IN NON-COMPLEMENTARY OUTPUTS AT THE OUTPUT OF THE CHECKER.
Abstract:
The present invention relates to a highly-efficient system for performing single-error correction when utilized with a memory system including a memory equipped with error-detection circuitry for use with rotationally-encoded, single-error correction, double-error detection Hamming coded data wherein said memory system circuitry includes means for developing syndrome bits, the patterns of which indicate faulty operation. Hardware is included for first identifying the specific byte which contains the error and still further hardware is provided to locate the particular bit which is erroneous. By efficient use of the rotational characteristic of the present coding scheme, correction is made only when necessary and only that hardware necessary to correct a single byte is provided in the correction circuitry.
Abstract:
The error tolerant arithmetic logical unit is divided into vertical bit-planes which are relatively independent, being coupled mainly for the purposes of shifts and carry propagation. The system tolerates failures and still functions correctly by reconfiguring the unit through the control of interplane connections. By inserting a spare bit-plane into the system and switching between bit-planes to bypass a failed plane, the effect of the failed plane or of a failure in a position of control logic can be eliminated.
Abstract:
A method and apparatus for detecting errors occurring as a result of faulty memory operation. By storing every data word in an addressable memory at an address therein having a parity with a fixed predetermined relationship to the parity of the said data word, errors occurring in the memory may be detected. By incorporating an extra bit in the memory word, the error can be isolated and by incorporating two extra bits, double word readout errors may be detected.
Abstract:
A read-only storage system wherein each data word is stored twice, once in its true form and once in its complement form. Said two data words are further stored at complementary addresses and means are provided upon readout of any data word for detecting a system error. Said means being further operative to automatically access an address complementary to the one currently being utilized for reading out the same data word in the complementary form at said complementary address.
Abstract:
An SEC/DED error detection and data translation mechanism is described. By the use of unique circuit design features, the same logical circuitry is capable of automatically taking Hamming encoded data from memory and parity encoding same for transmission elsewhere in the system as well as forming the necessary syndromes for purposes of error detection and correction. The same circuitry is capable of receiving encoded data from elsewhere in the system, first checking for any parity error and, if parity is proper, will generate the necessary Hamming check bits for storing in the memory together with the data information. The disclosed circuitry, by means of the unique partitioning thereof, separates the error detection and correction functions. It also generates parity bits essentially in parallel with error detection after a memory read cycle with the result that the data is propagated through the correction circuitry only when a single data bit error is detected.
Abstract:
A SERIES OF SELF-CHECKING ERROR CHECKING CIRCUITS ARE DISCLOSED FOR CHECKING TWO-RAIL LOGIC CODED DATA LINES. THE DATA LINES ARE ARRANGED AS N PAIRS OF TWO-RAIL GROUPS. ONE FORM OF THE CHECKER COMPRISES N-1 BASIC TWO OUTPUT BLOCKS CONNECTED IN A GENERAL TREE CONFIGURATION ACROSS THE TWO-RAIL DATA LINES. EACH OF SAID BASIC BLOCKS HAS TWO NORMALLY COMPLEMENTARY OUTPUT LINES AND THE LAST STAGE OF THE CHECKER IS A SINGLA BASIC BLOCK. IF AN INVAID CODE IS RECEIVED, THE TWO OUTPUTS WILL BE IDENTICAL. MALFUNCTIONS OR FAILURES IN THE CHECKING CIRCUIT ARE CHECKED BY CERTAIN LEGITIMATE CODE SIGNALS WHICH SIMILARLY CAUSE AN ERROR REPRESENTATION IN THE OUTPUT OF THE CHECKER WHEREBY BOTH OUTPUTS WILL BE IDENTICAL.