Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/244
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBaşçiftçi, Fatih-
dc.contributor.authorAkar, Hakan-
dc.date.accessioned2021-12-13T10:23:55Z-
dc.date.available2021-12-13T10:23:55Z-
dc.date.issued2021-
dc.identifier.issn2090-4479-
dc.identifier.issn2090-4495-
dc.identifier.urihttps://doi.org/10.1016/j.asej.2020.04.003-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/244-
dc.description.abstractPreviously finding prime implicants based on off-cubes was explored as an approach to minimize insignificant logic functions which include minterms both easy and difficult to cover. Off-cube based function minimization falls short in certain functions and may not yield/produce the accurate results. In this study, a new method of minimizing insignificant logic functions that includes smart minterm ordering according to their contiguity is proposed. In the proposed method, minterms are ordered from easy to difficult in terms of covering. This kind of a smart ordering helps minimization algorithms to quickly cover easy minterms and decrease the complexity of remaining function. A new accumulation approach is also developed and employed for the minimization of complicated functions. The use of the new accumulation approach in the study made it possible to reach more precise results. When it is impossible to determine exact prime implicants, the developed algorithm accumulates minterm and its corresponding implicants in a suspended state (SS) and reconsiders covering them later. Both the theory and practice of accumulation approach for the minimization of minterms is presented. Standard MCNC benchmarks are simplified with both the proposed method and with the two level simplification program ESPRESSO. The comparative analysis of the results revealed that the proposed method finds exact minimum results using less time and memory than ESPRESSO. (C) 2021 The Authors. Published by Elsevier B.V. on behalf of Faculty of Engineering, Ain Shams University. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).en_US
dc.description.sponsorshipTUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [1059B141500323]; Coordinatorship of Selcuk University's Scientific Research ProjectsSelcuk Universityen_US
dc.description.sponsorshipThis study is supported by TUBITAK #1059B141500323 and the Coordinatorship of Selcuk University's Scientific Research Projects.en_US
dc.language.isoenen_US
dc.publisherELSEVIERen_US
dc.relation.ispartofAIN SHAMS ENGINEERING JOURNALen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInsignificant logic functionsen_US
dc.subjectLogicen_US
dc.subjectLogic minimizationen_US
dc.subjectLogic synthesisen_US
dc.subjectTwo-level logic simplificationen_US
dc.subjectDirect coveren_US
dc.subjectMinterm orderingen_US
dc.titleSmart minterm ordering and accumulation approach for insignificant function minimizationen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.asej.2020.04.003-
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Harita Mühendisliği Bölümüen_US
dc.identifier.volume12en_US
dc.identifier.issue1en_US
dc.identifier.startpage729en_US
dc.identifier.endpage737en_US
dc.identifier.wosWOS:000636559700012en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
item.openairetypeArticle-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.grantfulltextopen-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections
Files in This Item:
File SizeFormat 
1-s2.0-S2090447920300873-main.pdf1.53 MBAdobe PDFView/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

2
checked on Mar 23, 2024

Page view(s)

686
checked on Mar 25, 2024

Download(s)

40
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


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