Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
1999-12-21
2003-02-18
Mai, Tan V. (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
06523049
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention generally relates to an apparatus and method for digital addition used in memory array testing and more particularly relates to determining whether three or more defective bits are present in a sixty-six bit memory array.
2. Description of the Related Art
Digital addition processes provide a method for “carrying” when the capacity of a column is exceeded. For example, in a decimal system for adding two numbers, when the result of addition in a column exceeds nine, a one must be carried to the next column. Also, for every column except the lowest ordered one, provision must be made for receiving a number carried from the preceding lower order column. The carry operation occurs frequently in addition.
One of the simplest forms of adders is the ripple-carry adder in which a single carry from one column to the next is provided at each level, starting with the lowest order column. Although simple, the ripple-carry adder is relatively slow because of the relatively large number of levels or stages that are required. Since the circuits of one level cannot do their operations until those of the previous level have completed theirs, the time required for addition is generally determined by the number of levels.
One technique that has been employed to expedite addition separates the function of simple addition from that of the calculation of the carry bits. Probably the most common example today is the carry look-ahead adder. A carry look-ahead adder circuitry is obtained by considering the Boolean functions that define addition and applying algebra to them. In this process, two Boolean terms are usually introduced, called generate and propagate. The carry look-ahead method of addition has been standard for many years with minor changes.
It is desirable to provide digital circuitry that is able to perform these functions as fast as possible and without using great amounts of chip space. Conventional n-bit ripple carry adder circuitry is very slow and a carry-look-ahead adder is chip real estate intensive. It is further desirable to perform a greater than or equal to three of sixty-six calculation in less than 5 nanoseconds. More specifically, it is desirable to know if three or greater bits out of sixty-six is low (e.g., is defective) because a standard memory array has sixty-four Primary Data Lines (PDL) and two redundant lines. If three or more fails occur on a word line, then the two redundant PDLs cannot be used to perform the repair of the three defects. The repair then must be performed with a redundant word line.
SUMMARY OF THE INVENTION
In view of the foregoing and other problems of the conventional methods, it is, therefore, an object of the present invention to provide a circuit for indicating a status of a plurality of input signals. The circuit may include a plurality of pre-sum circuits that receive the plurality of input signals. Each pre-sum circuit may output two pre-sum output signals. The circuit may also include a plurality of first stage circuits. Each first stage circuit may receive two pre-sum output signals and outputting two first stage output signals. The circuit may also include a plurality of second stage circuits adapted to receive the first stage output signals. Each of the second stage circuits may output second stage output signals. A final stage circuit may be adapted to receive the second stage output signals and output two final stage output signals. The two final stage output signals represent the status of the plurality of input signals.
Other objects, advantages and salient features of the invention will become apparent from the following detailed description taken in conjunction with the annexed drawings, which disclose preferred embodiments of the invention.
REFERENCES:
patent: 4138731 (1979-02-01), Kamimoto et al.
patent: 4573137 (1986-02-01), Ohhashi
patent: 4752905 (1988-06-01), Nakagawa et al.
patent: 4758974 (1988-07-01), Fields et al.
patent: 4868778 (1989-09-01), Disbrow
patent: 4901270 (1990-02-01), Galbi et al.
patent: 4924423 (1990-05-01), Vassiliadis et al.
patent: 4974188 (1990-11-01), Dolecek
patent: 4991131 (1991-02-01), Yeh et al.
patent: 5027311 (1991-06-01), Zion
patent: 5095458 (1992-03-01), Lynch et al.
patent: 5122982 (1992-06-01), Cohn
patent: 5163020 (1992-11-01), Chau
patent: 5272662 (1993-12-01), Scriber et al.
patent: 5367691 (1994-11-01), Johnson
patent: 5402369 (1995-03-01), Main
patent: 5426598 (1995-06-01), Hagihara
patent: 5491653 (1996-02-01), Taborn et al.
patent: 5497342 (1996-03-01), Mou et al.
patent: 5619442 (1997-04-01), Opris
patent: 5877973 (1999-03-01), Kato et al.
patent: 5903484 (1999-05-01), Tsujihashi
Henkler, Esq. Richard A.
Mai Tan V.
McGinn & Gibb PLLC
LandOfFree
Circuit and method for determining greater than or equal to... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Circuit and method for determining greater than or equal to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuit and method for determining greater than or equal to... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3163800