Sciweavers

Share
ASPDAC
1995
ACM

Synthesis-for-testability using transformations

10 years 2 months ago
Synthesis-for-testability using transformations
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and partial scan cost than synthesis from the original specification. A two-stage objective function, that estimates the area and testability of the final implementation, and also captures enabling effects of the transformations, is developed. Optimization is done using a new randomized branch and bound steepest descent algorithm. Application of the transformation algorithm on several examples demonstrates significant simultaneous improvement in both area and testability of the final implementations.
Miodrag Potkonjak, Sujit Dey, Rabindra K. Roy
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 1995
Where ASPDAC
Authors Miodrag Potkonjak, Sujit Dey, Rabindra K. Roy
Comments (0)
books