Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics Conference Series

Logic simulation tool for RSFQ circuits accepting arrivals of multiple pulses in a clock period

Nobutaka Kito, Shohei Udatsu, Kazuyoshi Takagi

Published Jul 1, 2020• 0 citations
Publisher

Abstract

Abstract A logic simulation tool for RSFQ circuits is proposed. It can treat RSFQ logic circuits containing signal lines accepting multiple pulses in a clock period. Logic circuits can be implemented in compact area by utilizing RSFQ specific gates and feeding multiple pulses into a gate input in a clock period. For treating circuits containing signal lines accepting multiple pulses in a clock period, a new description method is proposed. A logic simulation tool treating netlists described based on the proposed method was implemented. Examples of designs having signal lines accepting multiple pulses to be implemented in compact area are shown, and simulation results obtained with the tool are shown.

DOI
10.1088/1742-6596/1590/1/012041

Related papers

Conversion of a CMOS logic circuit design to an RSFQ design considering latching function of RSFQ logic gates

Nobutaka Kito, Kazuyoshi Takagi, Naofumi Takagi

A method for converting a CMOS logic circuit design to an efficient RSFQ design, which minimizes the number of flip-flops during conversion, is proposed. In an RSFQ circuit, each data input terminal of a logic gate has latching function, and the function is enabled or disabled depending on the order of the arrivals of the data pulse and the corresponding clock pulse. The number of flip-flops is minimized by the use of the latching functions through arrangement of the order of pulse arrivals of each gate and also by circuit retiming. A conversion tool based on the proposed method has been developed. Conversion results of CMOS benchmark circuits show that most of the flip-flops in the circuits are eliminated by the proposed method. A 4-bit RSFQ processor was successfully designed by an existing CMOS design tool and the developed conversion tool.

IEEE Transactions on Applied Superconductivity•Jan 1, 2014•7 citations

A basic circuit for asynchronous superconductive logic using RSFQ gates

I. Kurosawa, Hiroshi Nakagawa, Masahiro Aoyagi +3 more

This paper presents a basic circuit concept for pulse-driven asynchronous circuits using superconducting rapid single-flux-quantum (RSFQ) logic gates. Today's computer systems perform using a synchronous clock distributed over the whole system. The distribution of the clock signal becomes more difficult as the clock frequency increases because the wavelength of the clock signal becomes shorter than the system size. One way to solve this problem is to use asynchronous circuits in which all circuits perform their functions only under the law of cause and effect. We propose an implementation of the basic asynchronous circuit performing OR/AND logic operations between SFQ pulses. The operations are confirmed by SPICE simulation. We will show a design method for combinational circuits using the proposed basic circuits.

Superconductor Science and Technology•Apr 1, 1996•13 citations

Conversion of Logic Gates in Netlists for Rapid Single Flux Quantum Circuits Utilizing Confluence of Pulses

Nobutaka Kito, Kazuyoshi Takagi, Naofumi Takagi

A conversion method of a netlist consisting of conventional logic gates for superconducting rapid single flux quantum (RSFQ) circuit realization is proposed. The method detects OR gates which can be replaced with confluence buffers (CBs) which converge their input pulses into their outputs. The detection problem of replaceable OR gates is treated as a SAT problem. Each OR gate requires clock input in RSFQ circuits. By replacing OR gates with CBs, wiring for clocking those OR gates are eliminated and the number of active devices known as Josephson junctions is reduced.

IPSJ Transactions on System and LSI Design Methodology•Jan 1, 2019•4 citations

Design of multiple fanout clock distribution network for rapid single flux quantum technology

Naveen Kumar Katam, Alireza Shafaei, Massoud Pedram

Rapid Single Flux Quantum (RSFQ) logic cells have traditionally been limited to driving one fanout cell because of the difficulty in distributing the single flux quantum pulse to multiple fanouts. This paper presents a method to modify the standard RSFQ cells at their input/output interfaces to other cells in order to support a multiple-fanout drive capability. This capability is especially useful for clock distribution in RSFQ logic. This is because RSFQ logic is requires the clock signal to be provided to every logic gate. This is why this paper focuses on the clock signal driving more than one cell without the use of splitters. The potential tradeoff is in lower margins for the cells. However, by careful design of the RSFQ cells, the yield is not compromised by our proposed technique.

Asia and South Pacific Design Automation Conference (ASP-DAC)•Jan 1, 2017•23 citations

An RSFQ flexible-precision multiplier utilizing bit-level processing

Nobutaka Kito, Kazuyoshi Takagi

Abstract An RSFQ flexible-precision multiplier is proposed. The circuit can perform multiplication with specified bit-width within a predefined bit range. The calculation bit-width can be changed in every operation. When the bit-width of a calculation decreases, the latency in cycles is reduced. The proposed circuit calculates the multiplication result with bit-level processing to save the circuit area. The circuit carries out multiplication by counting pulses on a signal line. An RSFQ flexible-precision matrix multiplication circuit based on the proposed multiplier is also proposed. Its internal multipliers share many component circuits and it is implemented in a compact area.

Journal of Physics Conference Series•Jul 1, 2021•1 citation

Design and experimentation of BSFQ logic devices

T. Hosoki, Hiroki Kodaka, M Kitagawa +1 more

Rapid single flux quantum (RSFQ) logic needs synchronous pulses for each gate, so the clock-wiring problem is more serious when designing larger scale circuits with this logic. So we have proposed a new SFQ logic which follows Boolean algebra perfectly by using set and reset pulses. With this logic, the level information of current input is transmitted with these pulses generated by level-to-pulse converters, and each gate calculates logic using its phase level made by these pulses. Therefore, our logic needs no clock in each gate. We called this logic `Boolean SFQ (BSFQ) logic'. In this paper, we report design and experimentation for an AND gate with inverting input based on BSFQ logic. The experimental results for OR and XOR gates are also reported.

Superconductor Science and Technology•Nov 1, 1999•3 citations
Abstract A logic simulation tool for RSFQ circuits is proposed. It can treat RSFQ logic circuits containing signal lines accepting multiple pulses in a clock period. Logic circuits can be implemented in compact area by utilizing RSFQ specific gates and feeding multiple pulses into a gate input in a clock period. For treating circuits containing signal lines accepting multiple pulses in a clock period, a new description method is proposed. A logic simulation tool treating netlists described based on the proposed method was implemented. Examples of designs having signal lines accepting multiple pulses to be implemented in compact area are shown, and simulation results obtained with the tool are shown.
A method for converting a CMOS logic circuit design to an efficient RSFQ design, which minimizes the number of flip-flops during conversion, is proposed. In an RSFQ circuit, each data input terminal of a logic gate has latching function, and the function is enabled or disabled depending on the order of the arrivals of the data pulse and the corresponding clock pulse. The number of flip-flops is minimized by the use of the latching functions through arrangement of the order of pulse arrivals of each gate and also by circuit retiming. A conversion tool based on the proposed method has been developed. Conversion results of CMOS benchmark circuits show that most of the flip-flops in the circuits are eliminated by the proposed method. A 4-bit RSFQ processor was successfully designed by an existing CMOS design tool and the developed conversion tool.
This paper presents a basic circuit concept for pulse-driven asynchronous circuits using superconducting rapid single-flux-quantum (RSFQ) logic gates. Today's computer systems perform using a synchronous clock distributed over the whole system. The distribution of the clock signal becomes more difficult as the clock frequency increases because the wavelength of the clock signal becomes shorter than the system size. One way to solve this problem is to use asynchronous circuits in which all circuits perform their functions only under the law of cause and effect. We propose an implementation of the basic asynchronous circuit performing OR/AND logic operations between SFQ pulses. The operations are confirmed by SPICE simulation. We will show a design method for combinational circuits using the proposed basic circuits.
A conversion method of a netlist consisting of conventional logic gates for superconducting rapid single flux quantum (RSFQ) circuit realization is proposed. The method detects OR gates which can be replaced with confluence buffers (CBs) which converge their input pulses into their outputs. The detection problem of replaceable OR gates is treated as a SAT problem. Each OR gate requires clock input in RSFQ circuits. By replacing OR gates with CBs, wiring for clocking those OR gates are eliminated and the number of active devices known as Josephson junctions is reduced.
Rapid Single Flux Quantum (RSFQ) logic cells have traditionally been limited to driving one fanout cell because of the difficulty in distributing the single flux quantum pulse to multiple fanouts. This paper presents a method to modify the standard RSFQ cells at their input/output interfaces to other cells in order to support a multiple-fanout drive capability. This capability is especially useful for clock distribution in RSFQ logic. This is because RSFQ logic is requires the clock signal to be provided to every logic gate. This is why this paper focuses on the clock signal driving more than one cell without the use of splitters. The potential tradeoff is in lower margins for the cells. However, by careful design of the RSFQ cells, the yield is not compromised by our proposed technique.
Abstract An RSFQ flexible-precision multiplier is proposed. The circuit can perform multiplication with specified bit-width within a predefined bit range. The calculation bit-width can be changed in every operation. When the bit-width of a calculation decreases, the latency in cycles is reduced. The proposed circuit calculates the multiplication result with bit-level processing to save the circuit area. The circuit carries out multiplication by counting pulses on a signal line. An RSFQ flexible-precision matrix multiplication circuit based on the proposed multiplier is also proposed. Its internal multipliers share many component circuits and it is implemented in a compact area.
Rapid single flux quantum (RSFQ) logic needs synchronous pulses for each gate, so the clock-wiring problem is more serious when designing larger scale circuits with this logic. So we have proposed a new SFQ logic which follows Boolean algebra perfectly by using set and reset pulses. With this logic, the level information of current input is transmitted with these pulses generated by level-to-pulse converters, and each gate calculates logic using its phase level made by these pulses. Therefore, our logic needs no clock in each gate. We called this logic `Boolean SFQ (BSFQ) logic'. In this paper, we report design and experimentation for an AND gate with inverting input based on BSFQ logic. The experimental results for OR and XOR gates are also reported.