US6263476B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for selecting targeted components in limited access test
Assignee: Agilent Technologies Inc
•
Filing: 1998-10-09
•
Granted: 2001-07-17
•
Expires: 2018-10-09
Abstract
Abstract A system that can test individual components having tolerances on a circuit board without complete access to every node on the board is disclosed. The system uses a method that develops test limits from a model of the board, component tolerances, and a list of accessible nodes. A method of reducing the complexity of the test problem by limiting the number of components under consideration is also disclosed. A method of reducing the complexity of the test problem by limiting the number of nodes under consideration is also disclosed. A method of picking nodes to apply stimulus to a board is also disclosed. Finally, a method of correcting for certain parasitics associated with tester hardware is disclosed.
Inventors
- 👤 Rodney A. Browen
- 👤 Cherif Ahrikencheikh
- 👤 William P. Darbie
- 👤 John E. McDermid
- 👤 Kay C. Lannen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 03:15
CPC Classifications
G; G01; G01R; G01R31/00; G01R31/26; G01R31/27
Claims Analysis
Total Claims: 39
Claim 1
Independent Claim
190 words
A method of selecting and testing targeted components, comprising: (a) constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) selecting a first inaccessible node from said first subset of nodes; (c) traversing said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) selecting a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) applying a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and (f) measuring a set of responses to said stimulus-applied at said selected stimulus location, wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 2
Independent Claim
190 words
A method of selecting and testing targeted components, comprising: (a) constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) selecting a first inaccessible node from said first subset of nodes; (c) traversing said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) selecting a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) applying a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and (f) measuring a set of responses to said stimulus-applied at said selected stimulus location, wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 3
Dependent Claim
19 words
The method of claim 1 further comprising: (g) eliminating said first set of targeted components from said topological representation.
Claim 4
Dependent Claim
33 words
The method of claim 2 further comprising: (h) eliminating a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 5
Dependent Claim
24 words
The method of claim 3 further comprising: i selecting a second set of targeted components if said first subset of nodes is not empty.
Claim 6
Dependent Claim
18 words
The method of claim 4 , wherein step i is accomplished by repeating steps (b), (c), and (d).
Claim 7
Dependent Claim
38 words
The method of claim 1 wherein after constructing the topological representation further comprising: eliminating a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 8
Dependent Claim
23 words
The method of claim 6 further comprising: selecting a second set of targeted components if said first subset of nodes is not empty.
Claim 9
Dependent Claim
32 words
The method of claim 7 , wherein selecting the second set of targeted components if said fist subset of nodes is not empty is accomplished by repeating steps (b), (c), and (d).
Claim 10
Dependent Claim
213 words
A program storage medium readable by a computer, tangibly embodying a program of instructions executable by the computer to perform method steps for selecting and testing targeted components, said method comprising: (a) constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) selecting a first inaccessible node from said first subset of nodes; (c) traversing said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) selecting a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) applying a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and (f) measuring a set of responses to said stimulus applied at said selected stimulus location, wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 11
Dependent Claim
213 words
A program storage medium readable by a computer, tangibly embodying a program of instructions executable by the computer to perform method steps for selecting and testing targeted components, said method comprising: (a) constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) selecting a first inaccessible node from said first subset of nodes; (c) traversing said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) selecting a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) applying a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and (f) measuring a set of responses to said stimulus applied at said selected stimulus location, wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 12
Dependent Claim
21 words
The program storage medium of claim 9 further comprising: (g) eliminating said first set of targeted components from said topological representation.
Claim 13
Dependent Claim
35 words
The program storage medium of claim 10 further comprising: (h) eliminating a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 14
Dependent Claim
26 words
The program storage medium of claim 11 further comprising: i selecting a second set of targeted components if said first subset of nodes is not empty.
Claim 15
Dependent Claim
20 words
The program storage medium of claim 12 , wherein step i is accomplished by repeating steps (b), (c), and (d).
Claim 16
Dependent Claim
26 words
The program storage medium of claim 10 further comprising: h selecting a second set of targeted components if said first subset of nodes is not empty.
Claim 17
Dependent Claim
20 words
The program storage medium of claim 14 , wherein step h is accomplished by repeating steps (b), (c), and (d).
Claim 18
Dependent Claim
40 words
The program storage medium of claim 9 wherein after constructing the topological representation further comprising: eliminating a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 19
Independent Claim
201 words
An apparatus for selecting and testing targeted components, comprising: (a) means for constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) means for selecting a first inaccessible node from said first subset of nodes; (c) means for traversing said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) means for selecting a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) means for applying a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of subset of nodes; and (f) means for measuring a set of responses to said stimulus applied at said selected stimulus location, wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 20
Independent Claim
201 words
An apparatus for selecting and testing targeted components, comprising: (a) means for constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) means for selecting a first inaccessible node from said first subset of nodes; (c) means for traversing said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) means for selecting a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) means for applying a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of subset of nodes; and (f) means for measuring a set of responses to said stimulus applied at said selected stimulus location, wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 21
Dependent Claim
20 words
The apparatus of claim 17 further comprising: means for eliminating said first set of targeted components from said topological representation.
Claim 22
Dependent Claim
34 words
The apparatus of claim 18 further comprising: means for eliminating a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 23
Dependent Claim
25 words
The apparatus of claim 19 further comprising: means for selecting a second set of targeted components if said first subset of nodes is not empty.
Claim 24
Dependent Claim
34 words
The apparatus of claim 17 further comprising: means for eliminating a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 25
Dependent Claim
25 words
The apparatus of claim 21 further comprising: means for selecting a second set of targeted components if said first subset of nodes is not empty.
Claim 26
Independent Claim
214 words
An apparatus for selecting and testing targeted components, comprising: (a) a topological representation generator for constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) a node selector that selects a first inaccessible node from said first subset of nodes; (c) a traverser that traverses said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) a component selector that selects a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) a stimulator that applies a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and (f) a measurer that measures a set of responses to said stimulus applied at said selected stimulus location, and wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 27
Independent Claim
214 words
An apparatus for selecting and testing targeted components, comprising: (a) a topological representation generator for constructing a topological representation of a first group of components, wherein said first group of components are interconnected by a first set of nodes and wherein said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible; (b) a node selector that selects a first inaccessible node from said first subset of nodes; (c) a traverser that traverses said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes; (d) a component selector that selects a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed in step (c); (e) a stimulator that applies a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and (f) a measurer that measures a set of responses to said stimulus applied at said selected stimulus location, and wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 28
Dependent Claim
22 words
The apparatus of claim 23 further comprising: a component eliminator that eliminates said first set of targeted components from said topological representation.
Claim 29
Dependent Claim
36 words
The apparatus of claim 24 further comprising: a node eliminator that eliminates a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 30
Dependent Claim
25 words
The apparatus of claim 25 wherein said component selector selects a second set of targeted components if said first subset of nodes is not empty.
Claim 31
Dependent Claim
36 words
The apparatus of claim 23 further comprising: a node eliminator that eliminates a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 32
Dependent Claim
25 words
The apparatus of claim 27 wherein said component selector selects a second set of targeted components if said first subset of nodes is not empty.
Claim 33
Independent Claim
221 words
An apparatus for testing, comprising: a processing system, said processing system comprising at least one processor, wherein said processing system constructs a topological representation of a first group of components, said first group of components being interconnected by a first set of nodes and said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible, and wherein said processing system selects a first inaccessible node from said first subset of nodes, and wherein said processing system traverses said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes, and said processing system selects a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed by said processing system; a stimulator system that applies a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and, a measuring system, wherein said measuring system measures a set of responses to said stimulus applied at said selected stimulus location, and wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 34
Independent Claim
221 words
An apparatus for testing, comprising: a processing system, said processing system comprising at least one processor, wherein said processing system constructs a topological representation of a first group of components, said first group of components being interconnected by a first set of nodes and said first set of nodes being divided into a first subset of nodes that are inaccessible and a second subset of nodes that are accessible, and wherein said processing system selects a first inaccessible node from said first subset of nodes, and wherein said processing system traverses said topological representation starting with said first inaccessible node, said traversing stopping at members of said second subset of nodes and said traversing continuing to traverse at members of said first subset of nodes, and said processing system selects a first set of targeted components, wherein said targeted components are members of said first group of components that were traversed by said processing system; a stimulator system that applies a stimulus to a selected stimulus location, wherein said selected stimulus location is a member of said second subset of nodes; and, a measuring system, wherein said measuring system measures a set of responses to said stimulus applied at said selected stimulus location, and wherein said set of responses are measured at a first member of said second subset of nodes.
Claim 35
Dependent Claim
21 words
The apparatus of claim 29 wherein said processing system also eliminates said first set of targeted components from said topological representation.
Claim 36
Dependent Claim
34 words
The apparatus of claim 30 wherein said processing system eliminates a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 37
Dependent Claim
25 words
The apparatus of claim 31 wherein said processing system selects a second set of targeted components if said first subset of nodes is not empty.
Claim 38
Dependent Claim
34 words
The apparatus of claim 30 wherein said processing system eliminates a third subset of nodes from said first subset of nodes wherein said third subset of nodes have no connections in said topological representation.
Claim 39
Dependent Claim
25 words
The apparatus of claim 33 wherein said processing system selects a second set of targeted components if said first subset of nodes is not empty.
References Cited (Backward Citations)
US5392220A
Cited
US5172377A
Cited
US5510704A
Cited
US5870590A
Cited
US5808919A
Cited
US5786697A
Cited
US5530372A
Cited
US5838583A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-07-16 | 2005-01-15 | 2005-07-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-07-16 | 2009-01-15 | 2009-07-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-07-16 | 2013-01-15 | 2013-07-17 | $7700.00 | Window Closed / Lapsed |