STAX: statistical crosstalk target set compaction

Authors:
Shahin Nazarian;Massoud Pedram;Sandeep K. Gupta;Melvin A. Breuer
Affiliations:
University of Southern California;University of Southern California;University of Southern California;University of Southern California
Venue:
Proceedings of the conference on Design, automation and test in Europe: Designers' forum
Year:
2006

Citing 9
Cited 0

Analytic Models for Crosstalk Delay and Pulse Analysis Under Non-Ideal Inputs

Proceedings of the IEEE International Test Conference
Using Temporal Constraints for Eliminating Crosstalk Candidates for Design and Test

VTS '99 Proceedings of the 1999 17TH IEEE VLSI Test Symposium
XIDEN: Crosstalk Target Identification Framework

ITC '02 Proceedings of the 2002 IEEE International Test Conference
Analog Macromodeling of Capacitive Coupling Faults in Digital Circuit Interconnects

ITC '02 Proceedings of the 2002 IEEE International Test Conference
Efficient Identification of Crosstalk Induced Slowdown Targets

ATS '04 Proceedings of the 13th Asian Test Symposium
VITA: variation-aware interconnect timing analysis for symmetric and skewed sources of variation considering variational ramp input

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Parameterized block-based statistical timing analysis with non-gaussian parameters, nonlinear delay functions

Proceedings of the 42nd annual Design Automation Conference
Slope propagation in static timing analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A method for reducing the target fault list of crosstalk faults in synchronous sequential circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents STAX, a crosstalk target set compaction framework to reduce the complexity of the crosstalk ATPG process by pruning non-fault-producing targets. In general, existing pruning techniques do not employ their processes in a cost-effective manner. Neither do they handle process variations properly. To address the first weakness, this paper presents a framework to determine a sequence of available analysis and pruning tool invocations to prune as many of the crosstalk targets as fast as possible. As a result, an initially enormous collection of crosstalk targets is usually reduced to a very small set of targets via a vectorless process. A statistical static timing analyzer is developed and embedded to address the second shortcoming of existing approaches. Experimental results on ISCAS'85 benchmark demonstrate that STAX greatly improves the runtime compared to other crosstalk target pruning methodologies, including ATPG, with no prior target set compaction.