Characteristic's analysis of associative switching system

Sadchikova, Svetlana; Abdujapparova, Mubarak

doi:10.12928/telkomnika.v20i1.17640

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The discrepancy between the size of N 1 and N 2 and the direction of the relationships, edges, between the nodes of the two sets only, approximate the execution time of matching and traversing a bipartite graph closer to the linear time in most circumstances [17]. There are unlimited number of applications for bipartite graph such as search engines, social networks [18], and recommendation systems [19], data and networks classification [20], [21], cloud computing [22], health care, biology and medicine [23]. Other applications relevant to bipartite graphs are related to x-ray crystallography, metabolic pathways, chemical reaction networks, missile guidance, routing and wavelength assignment problem, and metabolic pathways [24], [25],…”

Section: Introductionmentioning

confidence: 99%

A new logic circuits optimization algorithm using bipartite graph

Al-Ghanimi

Khafaji²

2022

IJEECS

View full text Add to dashboard Cite

Designing a logic circuit from the scratch requires its description in logical expression, (e.g. sum of products), and then the expression should be optimized to diminish the cost and complexity of the circuit by reducing the number of literals, the number of logical terms, and/or logical operations. Karnaugh map, K-Map, is the most popular method in the optimization process, but it suffers from many drawbacks such as its inefficiency or the inability to be used in minimizing logical expression containing more than four literals, in addition to the complexity of implementing it as a program. In this paper, we propose a new algorithm to optimize the logic circuits depending on the bipartite graph and some of the suggested mathematical operations. The proposed algorithm is simple for programming implementation, literal-unlimited number, and is easy to be visualized and understandable. Many of the logic circuits of 3, 4, 5, and 6 literals were optimized and the results were correctly matched with the results of the Karnaugh map. Also, tens of logic circuits of more than 6 literals are optimized and the results were correctly checked with their truth tables and Logic-Friday tool.

show abstract