Loading [a11y]/accessibility-menu.js
A genetic algorithm for testable data path synthesis | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Tuesday, 8 April, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC). During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

A genetic algorithm for testable data path synthesis


Abstract:

A high level synthesis for testability method is presented with the objective to generate testable resistor transistor logic designs from behavioral descriptions. The app...Show More

Abstract:

A high level synthesis for testability method is presented with the objective to generate testable resistor transistor logic designs from behavioral descriptions. The approach is formulated as an allocation problem and solved using an efficient genetic algorithm that generates cost-effective testable designs. We follow the allocation method with an automatic test point selection algorithm that trades off design area and delay with test quality. The method is implemented and design comparisons are reported.
Date of Conference: 13-16 May 2001
Date Added to IEEE Xplore: 07 August 2002
Print ISBN:0-7803-6715-4
Print ISSN: 0840-7789
Conference Location: Toronto, ON, Canada

Contact IEEE to Subscribe

References

References is not available for this document.