Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/49659
Título: A geometric approach to register transfer level satisfiability
Autores/as: Navarro Botello,Héctor 
Nooshabadi, Saeid
Montiel- Nelson, Juan A. 
Navarro, V.
Sosa, J. 
Garcia, Jose C. 
Clasificación UNESCO: 3307 Tecnología electrónica
Palabras clave: Register Transfer Level (RTL)
Satisfiability (SAT)
Design Verification
Linear Programming
Cutting Planes
Fecha de publicación: 2009
Publicación seriada: Proceedings of the 10th International Symposium on Quality Electronic Design, ISQED 2009
Conferencia: 10th International Symposium on Quality Electronic Design, ISQED 2009 
Resumen: In this paper, inequalities of integer hull polyhedrons are used in mixed integer linear programming (MILP) to model the behavior of combinational subsystems, introducing a new solution for the satisfiability (SAT) problem at register transfer level (RTL). Since in these models the vertexes are located at integer positions, they can be used with linear programming (LP) to solve SAT problems. Unfortunately, when combining together several models to make up a compound RTL description, internal vertexes may appear forcing to declare one or more variables as integer. However, the use of these models inside an RTL SAT problem reduces the number of branches needed to solve the whole integer problem. Results show a CPU solution time reduction greater than one order of magnitude, growing with the size of the problem.
URI: http://hdl.handle.net/10553/49659
ISBN: 9781424429530
DOI: 10.1109/ISQED.2009.4810306
Fuente: Proceedings of the 10th International Symposium on Quality Electronic Design, ISQED 2009 (4810306), p. 272-275
Colección:Actas de congresos
miniatura
Adobe PDF (376,92 kB)
Vista completa

Visitas

83
actualizado el 05-oct-2024

Descargas

33
actualizado el 05-oct-2024

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.