By Topic

Behavioral synthesis of testable designs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mujumdar, A. ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA ; Jain, R. ; Saluja, K.

High-level synthesis tools automatically produce RTL designs from algorithmic specifications. These designs, however, are not necessarily easy to test. In this paper we present TBINET, an algorithm for module and register binding, which generates RTL designs having low testability overheads. It obtains a heuristic solution to the binding problem by mapping it onto a sequence of minimum cost network flow problems which can be solved very quickly. A cost function that considers the testability of the design is defined in the paper. The results of experiments on various benchmarks show that the designs produced by our binding algorithm are indeed easier to test as compared to circuits designed without testability considerations.<>

Published in:

Fault-Tolerant Computing, 1994. FTCS-24. Digest of Papers., Twenty-Fourth International Symposium on

Date of Conference:

15-17 June 1994