Improved algorithms for efficient symbolic support set minimization
1995 (English)In: Proceedings / International Workshop on Logic and Architecture Synthesis: organized by IFIP TC10 WG10.5, Institut National Polytechnique de Grenoble , 1995, 38-44 p.Conference paper (Refereed)
We propose an improved algorithm for computing support sets for icompletely specified boolean functions. The problem to compute a compatible function with minimal support set, with respect to various criteria, arises in many applications, for example FPGA synthesis. By incorporating new lookup techniques together with lazy evaluation, we are able to prune the search space for possible mappings of the don't care set. We also suggest a new approach to the problem of support set minimization. The new algorithm computes the least specified compatible functions for all possible support sets up to 20 times faster than previous algorithms.
Place, publisher, year, edition, pages
Institut National Polytechnique de Grenoble , 1995. 38-44 p.
Research subject Embedded System
IdentifiersURN: urn:nbn:se:ltu:diva-37445Local ID: b79884c0-12a6-11dd-ada4-000ea68e967bOAI: oai:DiVA.org:ltu-37445DiVA: diva2:1010943
International Workshop on Logic and Architecture Synthesis : 18/12/1995 - 19/12/1995
Godkänd; 1995; 20080425 (ysko)2016-10-032016-10-03Bibliographically approved