2026-06-07T17:26:05Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/1061242025-03-18T15:08:00Zcom_20.500.14352_14col_20.500.14352_15

00925njm 22002777a 4500 dc Imaña Pascual, José Luis author Sánchez, JM author 2001-11-01 Boolean or switching equations are powertul mathematical tools for digital logic. Several problems in digital circuit design, such as automatic test pattern generation, could be efficiently solved if fast procedures for solving Boolean equations were available. Several methods for solving this class of equations have been developed, but their efficiency is a problem. A new formulation for the computation of Boolean operations based on cubic representation of Boolean functions, termed the cube set method, is presented. The solutions provided by this approach are given as a set of cubes satisfying the disjoint property. Some definitions and theorems are given to describe the method and experimental results are presented IMANA, JL, and JM SANCHEZ. "Formulation for the computation of Boolean operations." IEE proceedings. Computers and digital techniques 148.6 (2001): 189-195. 1350-2387 10.1049/ip-cdt:20010706 https://hdl.handle.net/20.500.14352/106124 1359-7027 http://doi.org/10.1049/ip-cdt:20010706 https://digital-library.theiet.org/content/journals/10.1049/ip-cdt_20010706 Formulation for the computation of Boolean operations