Basciftci, FatihKahramanli, Sirzat2020-03-262020-03-262007978-1-4244-0812-2https://hdl.handle.net/20.500.12395/21215International Conference on Computer as a Tool (EUROCON 2007) -- SEP 09-12, 2007 -- Warsaw, POLANDThe goal of this study is the avoidance of excessive amount of temporary results produced during the minimization process of the two-level single-output Boolean functions of many variables. In this paper we have proposed an Off-set based-direct cover minimization method that uses a single On-cube oriented expanding of the Off-cubes on which the essential prime implicants are identified in a one by one manner and are used for iterative covering the function being minimized. The amount of temporary results produced by this method does not exceed the size of the Offset. The proposed algorithm is up to 3 times faster and uses significantly less amount of memory than well known ESPRESSO.eninfo:eu-repo/semantics/closedAccesslogic minimizationcube algebraprime implicantoff-set based minimizationdirect-cover principlecube expandingConference Object10261032N/AWOS:000257261900173N/A