DOAJ Open Access 2024

Directed Acyclic Graph-Based Datapath Synthesis Using Graph Isomorphism and Gate Reconfiguration

Liuting Shang Sheng Lu Yichen Zhang Sungyong Jung Chenyun Pan

Abstrak

Datapath synthesis is a crucial step in synthesis flow and aims at globally minimizing an area by identifying shareable logic structures. This paper introduces a novel Directed Acyclic Graph (DAG)-based datapath synthesis method based on graph isomorphism and gate reconfiguration. Unlike algorithms that identify common specification logic, our approach simplifies the problem by focusing on searching for common topology. Leveraging the concept of gate reconfiguration, our algorithm extends the applicability of DAG-based datapath synthesis by transforming a topology-equivalent network into a specification-equivalent network. Experimental results demonstrate up to 23.6% improvement when optimizing the adder–subtractor circuit, a scenario not addressed by existing DAG-based datapath synthesis algorithms.

Topik & Kata Kunci

Electronic computers. Computer science Electric apparatus and materials. Electric circuits. Electric networks

Penulis (5)

Liuting Shang

Sheng Lu

Yichen Zhang

Sungyong Jung

Chenyun Pan

Format Sitasi

APA MLA BibTeX

Shang, L., Lu, S., Zhang, Y., Jung, S., Pan, C. (2024). Directed Acyclic Graph-Based Datapath Synthesis Using Graph Isomorphism and Gate Reconfiguration. https://doi.org/10.3390/chips3020008

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.3390/chips3020008

Informasi Jurnal

Tahun Terbit: 2024
Sumber Database: DOAJ
DOI: 10.3390/chips3020008
Akses: Open Access ✓