Bi-decomposition is a design technique widely used to realize logic functions by the composition of simpler components. It can be seen as a form of Boolean division, where a given function is split into a divisor and quotient (and a remainder, if needed). The key questions are how to find a good divisor and then how to compute the quotient. In this paper we choose as divisor an approximation of the given function, and characterize the incompletely specified function which describes the full flexibility for the quotient. We report at the end preliminary experiments for bi-decomposition based on two AND-like operators with a divisor approximation from 1 to 0, and discuss the impact of the approximation error rate on the final area of the components in the case of synthesis by three-level XOR-AND-OR forms.
Computing the full quotient in bi-decomposition by approximation / A. Bernasconi, V. Ciriani, J. Cortadella, T. Villa (PROCEEDINGS DESIGN, AUTOMATION, AND TEST IN EUROPE CONFERENCE AND EXHIBITION). - In: 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)[s.l] : IEEE, 2020. - ISBN 9783981926347. - pp. 580-585
|Titolo:||Computing the full quotient in bi-decomposition by approximation|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2020|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.23919/DATE48585.2020.9116249|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|