Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/244
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Başçiftçi, Fatih | - |
dc.contributor.author | Akar, Hakan | - |
dc.date.accessioned | 2021-12-13T10:23:55Z | - |
dc.date.available | 2021-12-13T10:23:55Z | - |
dc.date.issued | 2021 | - |
dc.identifier.issn | 2090-4479 | - |
dc.identifier.issn | 2090-4495 | - |
dc.identifier.uri | https://doi.org/10.1016/j.asej.2020.04.003 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/244 | - |
dc.description.abstract | Previously 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.sponsorship | TUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [1059B141500323]; Coordinatorship of Selcuk University's Scientific Research ProjectsSelcuk University | en_US |
dc.description.sponsorship | This study is supported by TUBITAK #1059B141500323 and the Coordinatorship of Selcuk University's Scientific Research Projects. | en_US |
dc.language.iso | en | en_US |
dc.publisher | ELSEVIER | en_US |
dc.relation.ispartof | AIN SHAMS ENGINEERING JOURNAL | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Insignificant logic functions | en_US |
dc.subject | Logic | en_US |
dc.subject | Logic minimization | en_US |
dc.subject | Logic synthesis | en_US |
dc.subject | Two-level logic simplification | en_US |
dc.subject | Direct cover | en_US |
dc.subject | Minterm ordering | en_US |
dc.title | Smart minterm ordering and accumulation approach for insignificant function minimization | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.asej.2020.04.003 | - |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Harita Mühendisliği Bölümü | en_US |
dc.identifier.volume | 12 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.startpage | 729 | en_US |
dc.identifier.endpage | 737 | en_US |
dc.identifier.wos | WOS:000636559700012 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
item.fulltext | With Fulltext | - |
item.openairetype | Article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
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 | Size | Format | |
---|---|---|---|
1-s2.0-S2090447920300873-main.pdf | 1.53 MB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
2
checked on Aug 31, 2024
Page view(s)
712
checked on Aug 26, 2024
Download(s)
82
checked on Aug 26, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.