Module selection and scheduling using unrestricted libraries

Abstract

Most high-level synthesis schedulers are capable only of mapping an operation to one specific module type. To ensure a full design space exploration, a synthesis system should however select freely from a library containing modules with a large variety in delay, area and so on. A module selection and scheduling approach which allows the full use of such unrestricted libraries is presented. Extensive benchmark results show very fast running times and optimal solutions. This approach clearly illustrates the advantages of synthesis tools which can fully cope with unrestricted libraries, as they lead to designs with less module area.