A REDUCED OFFSET BASED METHOD FOR FAST COMPUTATION OF THE PRIME IMPLICANTS COVERING A GIVEN CUBE
dc.contributor.author | Basciftci, Fatih | |
dc.contributor.author | Kahramanli, Sirzat | |
dc.contributor.author | Selek, Murat | |
dc.date.accessioned | 2020-03-26T18:23:37Z | |
dc.date.available | 2020-03-26T18:23:37Z | |
dc.date.issued | 2012 | |
dc.department | Selçuk Üniversitesi | en_US |
dc.description.abstract | In order to generate prime implicants for a cube of a logic function, most logic minimization methods expand this cube by one at a time removing the literals from it. However, there is an intractable problem of determining the order of literals to be removed from the cube and checking whether a tentative literal removal is acceptable. In order to avoid this problem, the reduced offset method was developed. This method uses the positional-cube notation where every reduced off-cube of an n-variable function is represented by two n-bit strings. However, unfortunately, the conversion of such reduced cubes to the associated prime implicants has the time complexity worse than exponential. To avoid this problem, in this study, the method representing every reduced cube by a single n-bit string and a set of bitwise operations to be performed on such strings are proposed. The theoretical and experimental estimations show that this approach can significantly improve the quality of results and reduce the space and time complexities of the logic minimization process 2 times and up to 3.5 times, respectively. | en_US |
dc.description.sponsorship | Selcuk University, Konya, TurkeySelcuk University; Mevlana University, Konya, TurkeyMevlana University | en_US |
dc.description.sponsorship | This work is supported by Selcuk and Mevlana Universities Scientific Research Projects Coordinatorships, Konya, Turkey. | en_US |
dc.identifier.endpage | 4345 | en_US |
dc.identifier.issn | 1349-4198 | en_US |
dc.identifier.issn | 1349-418X | en_US |
dc.identifier.issue | 6 | en_US |
dc.identifier.scopusquality | Q3 | en_US |
dc.identifier.startpage | 4333 | en_US |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/27694 | |
dc.identifier.volume | 8 | en_US |
dc.identifier.wos | WOS:000305161100032 | en_US |
dc.identifier.wosquality | N/A | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | ICIC INTERNATIONAL | en_US |
dc.relation.ispartof | INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Logic minimization | en_US |
dc.subject | Prime implicant | en_US |
dc.subject | Reduced offset | en_US |
dc.subject | Cube notation | en_US |
dc.title | A REDUCED OFFSET BASED METHOD FOR FAST COMPUTATION OF THE PRIME IMPLICANTS COVERING A GIVEN CUBE | en_US |
dc.type | Article | en_US |