Novel methods for efficient realization of logic functions using switching lattices
Novel methods for efficient realization of logic functions using switching lattices
dc.contributor.author | Aksoy, Levent | |
dc.contributor.author | Altun, Mustafa | |
dc.contributor.department | Elektronik ve Haberleşme Mühendisliği | tr_TR |
dc.contributor.department | Electronics and Communications Engineering | tr_TR |
dc.date.accessioned | 2020-01-28T08:52:43Z | |
dc.date.available | 2020-01-28T08:52:43Z | |
dc.date.issued | 2019 | |
dc.description.abstract | Two-dimensional switching lattices including four-terminal switches are introduced as alternative structures to realize logic functions, aiming to outperform the designs consisting of one-dimensional two-terminal switches. Exact and approximate algorithms have been proposed for the problem of finding a switching lattice which implements a given logic function and has the minimum size,i.e., a minimum number of switches. In this article, we present an approximate algorithm, called JANUS, that explores the search space in a dichotomic search manner. It iteratively checks if the target function can be realized using a given lattice candidate, which is formalized as a satisfiability (SAT) problem. As the lattice size and the number of literals and products in the given target function increase, the size of a SAT problem grows dramatically, increasing the run-time of a SAT solver. To handle the instances that JANUS cannot cope with, we introduce a divide and conquer method called MEDEA. It partitions the target function into smaller sub-functions,finds the realizations of these sub-functions on switching lattices using JANUS, and explores alternative realizations of these sub-functions which may reduce the size of the final lattice. Moreover, we describe the realization of multiple functions in a single lattice. Experimental results show that JANUS can find better solutions than the existing approximate algorithms, even than the exact algorithm which cannot determine a minimum solution in a given time limit. On the other hand, MEDEA can find better solutions on relatively large size instances using a little computational effort when compared to the previously proposed algorithms. Moreover, on instances that the existing methods cannot handle, MEDEA can easily find a solution which is significantly better than the available solutions. | tr_TR |
dc.identifier.issn | 0018-9340 | |
dc.identifier.uri | http://hdl.handle.net/11527/18203 | |
dc.language.iso | en | tr_TR |
dc.publisher | IEEE Transactions on Computers | tr_TR |
dc.subject | emerging technologies | en_US |
dc.subject | four-terminal switch | en_US |
dc.subject | switching lattice | en_US |
dc.subject | logic synthesis | en_US |
dc.subject | satisfiability | en_US |
dc.subject | binary search | en_US |
dc.title | Novel methods for efficient realization of logic functions using switching lattices | tr_TR |
dc.type | Article | tr_TR |
Dosyalar
Orijinal seri
1 - 1 / 1
- Ad:
- Aksoy_Altun_Realizations_with_Switching_Lattices.pdf
- Boyut:
- 1.02 MB
- Format:
- Adobe Portable Document Format
- Açıklama
Lisanslı seri
1 - 1 / 1
thumbnail.default.placeholder
- Ad:
- license.txt
- Boyut:
- 3.06 KB
- Format:
- Item-specific license agreed upon to submission
- Açıklama