| 摘要 |
PURPOSE: To make a ROM, including an m×(n+1) array consisting of 1-bit storage cells, inspect itself. CONSTITUTION: The bit of a previously selected quotient column is loaded in (n+1) columns of a memory. Then, the bits of cells 12' of respective successive rows of a ROM 10' are sent out in order to different one of (n+1) inputs of a two-way multi-input shift register 18' from right to left to perform 1st polynomial division as to all the contents of the memory. Then, the bits are sent out sequentially in the left-to-right direction from respective successive rows to the shift register 18' to perform 2nd polynomial division as to (m×n) contents of the memory 10'. When the bits of the respective rows are sent in the shift register 18' during the 2nd polynomial division, this shift register generates the bits of a quotient, which are exclusively ORed with different one of the bits of the quotient stored in a memory of an (n+1)th column, so that an error in the memory can be found. A residue is left in the register as the result of the 2nd polynomial division, and this residue also indicates an error of the memory. |
