Please use this identifier to cite or link to this item:
Title: Adder model for mixed integer linear programming
Authors: Navarro Botello,Héctor 
Nooshabadi, S.
Montiel-Nelson, J. A. 
UNESCO Clasification: 3307 Tecnología electrónica
Keywords: adders
Boolean algebra
digital arithmetic
integer programming
Linear programming, et al
Issue Date: 2009
Publisher: 0013-5194
Journal: Electronics letters 
Abstract: Satisfiability problems (SAT) for register transfer level designs combine arithmetic blocks with Boolean logic to form a mixed integer linear programming (MILP) environment. The classic model of the two-input n-bit adder for MILP is straightforward. However, proposed is a more efficient method using a new set of inequalities that describes its integer hull polyhedron. This special model reduces the number of branches needed to solve the whole integer problem, optimising the overall efficiency of the SAT solver. Experimental results show a CPU time reduction greater than one order of magnitude or higher, depending on the size of the problem.
ISSN: 0013-5194
DOI: 10.1049/el.2009.3637
Source: Electronics Letters[ISSN 0013-5194],v. 45, p. 348-349
Appears in Collections:Artículos
Show full item record

Page view(s)

checked on Jun 25, 2022

Google ScholarTM




Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.