A partial scan approach that aims to reduce both area overhead and performance degradation caused by test logic is presented. Given a target speed and an initial design that meets the target, the algorithm selects a minimum set of scan flip-flops, if they exist, that (1) will break all sequential cycles and (2) will not violate the performance requirement after the scan logic is added. If such a set does not exist, the algorithm will find a set of scan flip-flops in which (1) all sequential cycles are broken and (2) the total area increase caused by the scan logic and the subsequent performance optimization is minimized, For circuits synthesized by automatic synthesis tools, the authors suggest a novel design flow, which selects/inserts the partial scan logic after area optimization, but before performance optimization. For meeting both performance and testability requirements, this design flow produces designs with less area increase than the traditional design flow, which considers testability and adds test logic after performance optimization. Experimental results on the ISCA'89 sequential circuits are presented as well as comparisons between the proposed method and previous methods.<<ETX>>
[1]
S.M. Reddy,et al.
On determining scan flip-flops in partial-scan designs
,
1990,
1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[2]
Melvin A. Breuer,et al.
The BALLAST Methodology for Structured Partial Scan Design
,
1990,
IEEE Trans. Computers.
[3]
K.-T. Cheng,et al.
A Partial Scan Method for Sequential Circuits with Feedback
,
1990,
IEEE Trans. Computers.
[4]
V.D. Agrawal,et al.
Designing circuits with partial scan
,
1988,
IEEE Design & Test of Computers.
[5]
John P. Fishburn.
A depth-decreasing heuristic for combinational logic: or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between
,
1991,
DAC '90.
[6]
David Bryan,et al.
Combinational profiles of sequential benchmark circuits
,
1989,
IEEE International Symposium on Circuits and Systems,.