Design Kernel Exploration Using QBF-Based Boolean Matching

Preuber, T.B.; Erxleben, Fredo

doi:10.1109/sips.2016.46

Cited by 1 publication

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This normal form is produced internally by the QBM tool, which is freely available on GitHub 1 . The engineer can specify both the configurable circuit as well as the desired function by structural and behavioral descriptions as described by Preußer and Erxleben [8].…”

Section: Qbf Formulationmentioning

confidence: 99%

See 1 more Smart Citation

QBM - Mapping User-Specified Functions to Programmable Logic through a QBF Satisfiability Problem

Preußer

2018

Preprint

View full text Add to dashboard Cite

This is a brief overview on the background behind the test set formulas generated by the QBM tool. After establishing its application context, its formal approach to the generation of QBF formulas and the concrete test set formulas are described. Finally, some related work will be credited and the source to obtain the open-source tool will be identified. Application ContextProgrammable logic devices enable users to exploit the tremendous concurrency benefits of hardware in their compute solutions without requiring them to go through a silicon production process. The most powerful among these devices are fieldprogrammable gate arrays (FPGAs) that provides hundreds of thousands of logic slices, each one of the capable of computing any arbitrary boolean 6-input function [1]. The configuration of these devices is computed in a synthesis process, which translates a behavioral or functional specification into a structural netlist consisting of the configurable primitives found on the devices and their configurations. These configurations include, for instance, truth tables to be stored in lookup table (LUT) components as well as datapath configurations that establish the proper signal connections.

show abstract

Section: Qbf Formulationmentioning

confidence: 99%

“…Recent experiments have shown that this range can be expected to span from rather simple all the way to currently infeasible problem complexities [8].…”

Section: Test Set Formulasmentioning

confidence: 99%

QBM - Mapping User-Specified Functions to Programmable Logic through a QBF Satisfiability Problem

Preußer

2018

Preprint

View full text Add to dashboard Cite

show abstract

Design Kernel Exploration Using QBF-Based Boolean Matching

Cited by 1 publication

References 7 publications

QBM - Mapping User-Specified Functions to Programmable Logic through a QBF Satisfiability Problem

QBM - Mapping User-Specified Functions to Programmable Logic through a QBF Satisfiability Problem

Contact Info

Product

Resources

About