activity
20132023
most citedPBMap: A Path Balancing Technology Mapping Algorithm for Single Flux Quantum Logic Circuits

62 citations · 105 across the 20 of their papers we have counts for

collaborators
Showing cs.ETShow all

8 papers · 1 filter

cs.ET2023★ 4 cited

Design of a Superconducting Multiflux Non-Destructive Readout Memory Unit

Beyza Zeynep Ucpinar, Yasemin Kopur, Mustafa Altay Karamuftuoglu +2

Due to low power consumption and high-speed performance, superconductor circuit technology has emerged as an attractive and compelling post-CMOS technology candidate. However, the…

cs.ET2023

A Life-Cycle Energy and Inventory Analysis of Adiabatic Quantum-Flux-Parametron Circuits

Masoud Zabihi, Yanyue Xie, Zhengang Li +5

The production process of superconductive integrated circuits is complex and consumes significant amounts of resources and energy. Therefore, it is crucial to evaluate the environm…

cs.ET2019★ 3 cited

VeriSFQ - A Semi-formal Verification Framework and Benchmark for Single Flux Quantum Technology

Alvin D. Wong, Kevin Su, Hang Sun +3

In this paper, we propose a semi-formal verification framework for single-flux quantum (SFQ) circuits called VeriSFQ, using the Universal Verification Methodology (UVM) standard. T…

cs.ET2019★ 1 cited

SFQmap: A Technology Mapping Tool for Single Flux Quantum Logic Circuits

Ghasem Pasandi, Alireza Shafaei, Massoud Pedram

Single flux quantum (SFQ) logic is a promising candidate to replace the CMOS logic for high speed and low power applications due to its superiority in providing high performance an…

cs.ET2019★ 62 cited

PBMap: A Path Balancing Technology Mapping Algorithm for Single Flux Quantum Logic Circuits

Ghasem Pasandi, Massoud Pedram

This paper presents a path balancing technology mapping algorithm, which is a new algorithm for generating a mapping solution for a given Boolean network such that the average logi…

cs.ET2018

A Graph Partitioning Algorithm with Application in Synthesizing Single Flux Quantum Logic Circuits

Ghasem Pasandi, Massoud Pedram

In this paper, a new graph partitioning problem is introduced. The depth of each part is constrained, i.e., the node count in the longest path of the corresponding sub-graph is no…