Patent US4649803A successfully refreshed from Google Patents.
Patent US4996689A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4996689A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of generating tests for a combinational logic circuit

Assignee: NXP BV
•
Filing: 1989-02-01
•
Granted: 1991-02-26
•
Expires: 2009-02-01
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In the present invention a method for generating tests for a combinational logic circuit of the PLA type is disclosed. The method is suited to generate tests to determine the input signals, the mid-term output signals of the AND gates, and the output signals, for stuck-at-0 and stuck-at-1 conditions.

Inventors

  • 👤 Muhammad A. Samad

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 18:58
CPC Classifications
G; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/3183; G01R31/318371; G01R31/318321

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 365 words
A method of generating tests for a combinational logic circuit having a plurality of logic circuits of one type and a plurality of logic circuits of another type, said combinational logic circuit having a plurality of inputs which are supplied to said plurality of logic circuits of one type as input thereto, said plurality of logic circuits of one type producing a plurality of first outputs which are supplied to said plurality of logic circuits of another type as inputs thereto, said plurality of logic circuits of another type producing a plurality of outputs which are the outputs of said combinational logic circuit, said method comprising the steps of: (a) selecting one of said inputs to said combinational logic circuits and setting said one input to a logic state; (b) determining a list of the logic circuits of one type affected by the input selected by step (a); (c) choosing one of the logic circuits of one type from the list of step (b); (d) setting other inputs to the logic circuit of one type chosen in step (c), to a logic state such that only the logic state of the one input of step (a) is propagated therethrough; (e) determining a list of the logic circuits of another type affected by the first output of the logic circuit of one type from step (c); (f) choosing one of the logic circuits of another type from the list of step (e); (g) setting the other inputs to the logic circuit of another type chosen, to a logic state such that only the logic state of the first output of step (e) is propagated therethrough; (h) choosing another logic circuit of another type from the list of step (e), if step (g) results in conflicting logic states, and returning to step (g); (i) choosing another logic circuit of one type from the list of step (b), if all of the logic circuits of the another type on the list of step (e) results in conflicting logic states, and returning to step (d); and (j) choosing another input to said combinational logic circuit and setting said another input to a logic state and returning to step (b).
Claim 2
Independent Claim 365 words
A method of generating tests for a combinational logic circuit having a plurality of logic circuits of one type and a plurality of logic circuits of another type, said combinational logic circuit having a plurality of inputs which are supplied to said plurality of logic circuits of one type as input thereto, said plurality of logic circuits of one type producing a plurality of first outputs which are supplied to said plurality of logic circuits of another type as inputs thereto, said plurality of logic circuits of another type producing a plurality of outputs which are the outputs of said combinational logic circuit, said method comprising the steps of: (a) selecting one of said inputs to said combinational logic circuits and setting said one input to a logic state; (b) determining a list of the logic circuits of one type affected by the input selected by step (a); (c) choosing one of the logic circuits of one type from the list of step (b); (d) setting other inputs to the logic circuit of one type chosen in step (c), to a logic state such that only the logic state of the one input of step (a) is propagated therethrough; (e) determining a list of the logic circuits of another type affected by the first output of the logic circuit of one type from step (c); (f) choosing one of the logic circuits of another type from the list of step (e); (g) setting the other inputs to the logic circuit of another type chosen, to a logic state such that only the logic state of the first output of step (e) is propagated therethrough; (h) choosing another logic circuit of another type from the list of step (e), if step (g) results in conflicting logic states, and returning to step (g); (i) choosing another logic circuit of one type from the list of step (b), if all of the logic circuits of the another type on the list of step (e) results in conflicting logic states, and returning to step (d); and (j) choosing another input to said combinational logic circuit and setting said another input to a logic state and returning to step (b).
Claim 3
Dependent Claim 25 words
The method of claim 1 wherein said logic circuits of one type are AND gates and said logic circuits of another type are OR gates.
Claim 4
Dependent Claim 34 words
The method of claim 2 wherein said other inputs of step (d) are set to the logic state of "1"and said other inputs of step (g) are set to the logic state of "0".
Claim 5
Dependent Claim 142 words
The method of claim 1 further comprising the steps of: (k) selecting one of the plurality of first outputs; (l) setting said one output selected from step (k) to a logic state; (m) determining a list of the logic circuits of another type affected by the output selected from step (k); (n) choosing one of the logic circuits of another type from the list of step (m); (o) setting all other inputs to the logic circuit of another type chosen to a logic state such that only the logic state of the first output of step (l) is propagated therethrough; (p) choosing another logic circuit of another type from the list of step (m), if step (o) results in conflicting logic states and returning to step (o); and (q) choosing another of the plurality of first outputs and returning to step (l).
Claim 6
Dependent Claim 25 words
The method of claim 4 wherein said logic circuits of one type are AND gates and said logic circuits of another type are OR gates.
Claim 7
Dependent Claim 35 words
The method of claim 5 wherein said other inputs of step (d) are set to the logic state of "1" and said other inputs of step (g) are set to the logic state of "0".
Claim 8
Dependent Claim 47 words
The method of claim 4 further comprising the steps of: (r) setting the selected inputs to said combinational logic circuit to selected logic states that affect an output of said combinational logic circuit in accordance with the boolean logic equation between said output and said selected inputs.
Claim 9
Dependent Claim 25 words
The method of claim 7 wherein said logic circuits of one type are AND gates and said logic circuits of another type are OR gates.
Claim 10
Independent Claim 35 words
The method of claims 8 wherein said other inputs of step (d) are set to the logic state of "1" and said other inputs of step (g) are set to the logic state of "0".

References Cited (Backward Citations)

US3958110A Cited
US4204633A Cited
US4499579A Cited
US4672610A Cited
US4716564A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-02-25 1994-08-27 1995-02-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-02-25 1998-08-27 1999-02-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-02-25 2002-08-27 2003-02-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag