Improving At-Speed Test Coverage without compromising Test Time and reducing Test Cost in multi-partition SCAN Design

With constantly scaling down of the technology, the complexity of SoC becoming very high due to implementation of digital, analog and memory logic. This is imposing challenge in meeting the coverage goal for the detection of manufacturing defect post-silicon on the ATE. During the implementation of industrial SoC design with multiple partitions, the difficulty is observed to achieve the at-speed transition coverage goal (90%) on ATE with limited memory (~20MB). However, the current production pattern set requires ~250MB of ATE memory. In order to achieve the required at-speed coverage goal (90%) with existing design with less pattern count, the coverage loss is analyzed in different portions such as surrounding logic of memory, the functional ICG enable logic. With the proposed solutions to resolve the loss of coverage, the coverage goal (90%) is met well within tester vector storage memory requirement with production pattern set. In addition, the disabling of the low power feature of the compression logic have further reduced the pattern count and hence, it decreased of the total test time and cost without compromising the peak and average power budget. Furthermore, the novel architecture is proposed with the usage of with minimal test area overhead to cover the faults in the interface logic between partitions which further leads to improvement in at-speed coverage.

Authors

Publication Details

Published
2024-12-17
DOI
https://doi.org/10.1109/ats64447.2024.10915249
Citations
1
Primary Topic
VLSI and Analog Circuit Testing
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improving At-Speed Test Coverage without compromising Test Time and reducing Test Cost in multi-partition SCAN Design

Ramesh Devani, Jayesh Popat, Jay Gohil
1 citations
VLSI and Analog Circuit Testing
0.49
article

Improving At-Speed Test Coverage without compromising Test Time and reducing Test Cost in multi-partition SCAN Design

Ramesh Devani, Jayesh Popat, Jay Gohil
article en
1 citations

Abstract

With constantly scaling down of the technology, the complexity of SoC becoming very high due to implementation of digital, analog and memory logic. This is imposing challenge in meeting the coverage goal for the detection of manufacturing defect post-silicon on the ATE. During the implementation of industrial SoC design with multiple partitions, the difficulty is observed to achieve the at-speed transition coverage goal (90%) on ATE with limited memory (~20MB). However, the current production pattern set requires ~250MB of ATE memory. In order to achieve the required at-speed coverage goal (90%) with existing design with less pattern count, the coverage loss is analyzed in different portions such as surrounding logic of memory, the functional ICG enable logic. With the proposed solutions to resolve the loss of coverage, the coverage goal (90%) is met well within tester vector storage memory requirement with production pattern set. In addition, the disabling of the low power feature of the compression logic have further reduced the pattern count and hence, it decreased of the total test time and cost without compromising the peak and average power budget. Furthermore, the novel architecture is proposed with the usage of with minimal test area overhead to cover the faults in the interface logic between partitions which further leads to improvement in at-speed coverage.

Openalex Percentile: Top 31%
VLSI and Analog Circuit Testing
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.