Rescheduling transformations for high level synthesis
- 13 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A new approach is presented to high-level synthesis with self-testability. The motivation for this work is the need to fill the void between the fields of high-level synthesis and design for testability. The approach is based on a new allocation algorithm that maps a scheduled data-flow representation of the behavior into a data-path structure that is testable, with no need for test hardware insertion. An important feature of the approach is the rescheduling of transformations to perform design space exploration, under area, delay, and testability constraints. A significant advantage of this method is that the testability design is well integrated into the framework of high-level synthesis at the behavior level.Keywords
This publication has 8 references indexed in Scilit:
- Automatic insertion of BIST hardware using VHDLPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Force-directed scheduling in automatic data path synthesisPublished by Association for Computing Machinery (ACM) ,1987
- Automated Synthesis of Data Paths in Digital SystemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- MAHA: A Program for Datapath SynthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A Knowledge-Based System for Designing Testable VLSI ChipsIEEE Design & Test of Computers, 1985
- Built-In Self-Test TechniquesIEEE Design & Test of Computers, 1985
- Some Experiments in Local Microcode Compaction for Horizontal MachinesIEEE Transactions on Computers, 1981
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963