Peripheral partitioning and tree decomposition for partial scan
AssigneeNEC Corporation
InventorsSrimat Chakradhar, Arun Balakrishnan
Life of this patent
Estimating the term…
Loading patent…
AssigneeNEC Corporation
InventorsSrimat Chakradhar, Arun Balakrishnan
Estimating the term…
A method, system and a computer product for a new partial scan technique that incurs significantly less overhead than the full-scan technique and yet achieves very high test coverage in short CPU times are provided. Scan memory elements are selected so that the scanned circuit satisfies two key properties in the test mode. First, the scanned circuit has partitions that are peripherally interacting finite state machines (peripheral partitions). Second, the memory element dependency graph (S-graph) of each peripheral partition of the scanned circuit has a tree structure. An efficient for algorithm peripheral partitioning and tree decomposition is provided. The scan memory element selection algorithm iteratively partitions the S-graph into disjoint sub-graphs with the tree structure.
A method of partial scan for a sequential circuit, said
A method of peripheral partitioning a sequential circuit, said method comprising:
A computer program product comprising,
Dependencies are inferred from the claim text.