A recursive paradigm to solve boolean relations
A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean relations. However, solving Boolean relations...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2009 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/126564 |
| Acesso em linha: | https://hdl.handle.net/2117/126564 https://dx.doi.org/10.1109/TC.2008.165 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Algorithms Logic design Boolean relations Logic synthesis Boolean minimization Decomposition Algorismes Estructura lògica Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean relations. However, solving Boolean relations is a computationally expensive task. This paper presents a novel recursive algorithm for solving Boolean relations. The algorithm has several features: efficiency, wide exploration of solutions, and customizable cost function. The experimental results show the applicability of the method in logic minimization problems and tangible improvements with regard to previous heuristic approaches. |
|---|