Logisim circuit similarity algorithm based on maximum connected subgraph

Kengyi Fang

doi:10.1117/12.2681019

23 May 2023 Logisim circuit similarity algorithm based on maximum connected subgraph

Kengyi Fang

Proceedings Volume 12645, International Conference on Computer, Artificial Intelligence, and Control Engineering (CAICE 2023); 126453P (2023) https://doi.org/10.1117/12.2681019
Event: International Conference on Computer, Artificial Intelligence, and Control Engineering (CAICE 2023), 2023, Hangzhou, China

Abstract

Logisim is a cross-platform educational tool for designing and simulating digital logic circuits, and it is widely used in experiments for courses such as computer organization in universities. As Logisim is widely used, tasks such as plagiarism detection require the calculation of Logisim circuit similarity, and the Logisim circuit similarity algorithm becomes very important. Logisim can represent circuits as text in XML format or render circuits as RGB images, which means that Logisim circuit similarity can be calculated using both text similarity algorithms and image similarity algorithms. However, due to the characteristics of Logisim circuits, text similarity algorithms and image similarity algorithms cannot achieve good results. In this paper, we propose a Logisim circuit similarity algorithm based on the maximum connected subgraph. We first represent the Logisim circuit as a collection of maximum connected subgraphs, then calculate the proportion of nodes with the same type, similar location and isomorphic local subgraphs in maximum connected subgraphs as the similarity of maximum connected subgraphs, and finally calculate the proportion of maximum connected subgraphs whose maximum similarity exceeds a threshold as the similarity of the collection of maximum connected subgraphs (i.e., Logisim circuits). We construct two Logisim similar circuit datasets based on real-world data. The experimental results on these datasets show that our method outperforms well-known text similarity algorithms and image similarity algorithms.

Citation Download Citation

Kengyi Fang "Logisim circuit similarity algorithm based on maximum connected subgraph", Proc. SPIE 12645, International Conference on Computer, Artificial Intelligence, and Control Engineering (CAICE 2023), 126453P (23 May 2023); https://doi.org/10.1117/12.2681019

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
7 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Detection and tracking algorithms

Associative arrays

Device simulation

Digital electronic circuits

Digital electronics

Lead

Logic

Show All Keywords

Keywords/Phrases

Search In:

Publication Years