This work is based on "BDD Minimization for Approximate Computing" by Mathias Soeken, Daniel Große, Arun Chandrasekharan and Rolf Drechsler, ASP-DAC 2016 : 474-479. It includes an implementation of the approximation operators introduced in the above mentioned paper.
Since the approximation of a BDD is called "rounding" I named this repository after Johann CARL Friedrich Gauss who invented the square bracket notation for the floor (aka the rounding down) function.-
Notifications
You must be signed in to change notification settings - Fork 1
BDD Minimization for Approximate Computing
License
ec-m/CARL
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
BDD Minimization for Approximate Computing
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published