# US 2015/0178432 A1 · Automated state machine extraction for rapid-single flux-quantum circuits

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0178432 A1
- Document ID: US20150178432A1
- Status: Published application
- Kind: A1
- Application number: 14/412,344
- Filed: 2013-07-02
- Published: 2015-06-25
- Earliest claimed: 2012-07-02
- Assignees: Stellenbosch University
- Applicants: Stellenbosch University
- Inventors: Louis Crouse Muller; Coenrad Johann Fourie
- Web page: https://patentgrep.com/patent/US20150178432A1

## CPC

- G06F 30/35: Delay-insensitive circuit design, e.g. asynchronous or self-timed
- G06F 30/30: Circuit design
- G06F 30/33: Design verification, e.g. functional simulation or model checking
- G06F 30/3308: using simulation
- H03K 19/1954: {with injection of the control current}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03K: PULSE TECHNIQUE (measuring pulse characteristics G01R; modulating sinusoidal oscillations with pulses H03C; transmission of digital information H04L; discriminator circuits detecting phase difference between two signals by counting or integrating cycles of oscillation H03D3/04; automatic control, starting, synchronisation or stabilisation of generators of electronic oscillations or pulses where the type of generator is irrelevant or unspecified H03L; coding, decoding or code conversion, in general H03M)

## Abstract

The invention provides a method and system for extracting a state machine representation of a digital logic superconductive circuit from an alphanumeric representation of the circuit. The alphanumeric representation typically specifies circuit components including inductive elements, their interconnectivity and input and output nodes. The method according to the invention comprising the steps of simulating the circuit in a suitable software environment utilising the alphanumeric representation; identifying inductive loops in the circuit; identifying inductive loops in the circuit capable of storing one or more magnetic fluxons and discarding all others; and extracting the state machine representation, using only the inductive loops in the circuit capable of storing magnetic fluxons.

## Claims

### Claim 1

An automated method of extracting a state machine representation of a digital logic superconductive circuit from an alphanumeric representation of the circuit, the alphanumeric representation specifying circuit components, including at least inductive elements, their interconnectivity and input and output nodes, the method comprising:
simulating the circuit in a suitable software environment utilising the alphanumeric representation;
identifying inductive loops in the circuit;
identifying inductive loops in the circuit capable of storing one or more magnetic fluxons and discarding all others; and
extracting the state machine representation, using only the inductive loops in the circuit capable of storing magnetic fluxons.

### Claim 2 (depends on 1)

A method as claimed in claim 1, wherein the step of extracting the state machine representation includes the steps of defining an initial state for the circuit and analysing the circuit in the initial state; iteratively applying a combination of input signals to the input nodes of the circuit and analysing the circuit for each input signal so applied with reference to the initial state to determine if the circuit enters a new state when the input signals are applied; and iteratively applying input signals to each of the input nodes of the circuit with the circuit in each newly identified state, each time analysing the circuit to identify additional new states, until all possible states of the circuit have been identified.

### Claim 3 (depends on 2)

A method as claimed in claim 2, which includes the step of specifying a set of input rules comprising unallowable combinations of input signals and avoiding the unallowable combinations during the step of extracting the state machine.

### Claim 4 (depends on 1)

A method as claimed in claim 1, which includes the step of parsing and flattening the alphanumeric representation of the circuit.

### Claim 5 (depends on 1)

A method as claimed in claim 1, which includes the step of storing the inductive loops capable of storing magnetic fluxons in a vector of components for further processing.

### Claim 6 (depends on 2)

A method as claimed in claim 2, which includes the step of measuring and storing timing delays between the application of input signals to input nodes and resulting changes on output nodes of the circuit.

### Claim 7

An automated method of constructing a Hardware Description Language (“HDL”) model for a digital logic superconductive circuit from an alphanumeric representation of the circuit, the alphanumeric representation specifying circuit components, including at least inductive elements, their interconnectivity and input and output nodes, the method comprising:
simulating the circuit in a suitable software environment utilizing the alphanumeric representation;
identifying inductive loops in the circuit;
identifying inductive loops in the circuit capable of storing one or more magnetic fluxons and discarding all others;
extracting the state machine representation, using only the inductive loops in the circuit capable of storing magnetic fluxons;
extracting timing characteristics of the circuit by iteratively applying different combinations of input signals to the circuit in each of its extracted states and measuring the performance of the circuit; and
constructing the HDL model using the state machine representation and extracted timing characteristics of the circuit.

### Claim 8 (depends on 7)

A method as claimed in claim 7, wherein the step of extracting the timing characteristics of the circuit includes the step of measuring the smallest possible delay between two consecutive input signals with which, when applied, the circuit is still functional, the smallest possible delay being measured with the circuit in each of the identified states and for all possible input combinations of the circuit.

### Claim 9 (depends on 8)

A method as claimed in claim 8 in which the step of extracting the timing characteristics of the circuit includes testing the functionality of the circuit for a chosen combination of input signals and delays between the signals by determining whether the circuit transitioned into the correct state on application of the input signals, as determined by the state machine representation of the circuit.

### Claim 10 (depends on 9)

A method as claimed in claim 9 in which the step of extracting the timing characteristics of the circuit includes, if the circuit is affected by a chosen delay between input signals, utilising a binary search routine to determine the time delay between input signals at which the circuit stops functioning correctly.

### Claim 11

A system for extracting a state machine representation of a digital logic superconductive circuit from an alphanumeric representation of the circuit, the alphanumeric representation specifying circuit components, including at least inductive elements, their interconnectivity and input and output nodes, the system comprising:
an input configured to receive the alphanumeric representation of the circuit;
a processor; and
an electronic storage module on which is stored instructions configured to cause the processor to simulate the circuit in a suitable software environment utilising the alphanumeric representation, identify inductive loops in the circuit; identify inductive loops in the circuit capable of storing one or more magnetic fluxons and discard all others, and extract the state machine representation using only the inductive loops in the circuit capable of storing magnetic fluxons.

### Claim 12 (depends on 11)

A system as claimed in claim 11, in which the machine instructions cause the processor to define an initial state for the circuit and analysing the circuit in the initial state; to iteratively apply a combination of input signals to the input nodes of the circuit and analyse the circuit for each input signal so applied with reference to the initial state to determine if the circuit enters a new state when the input signals are applied; and to iteratively apply input signals to each of the input nodes of the circuit with the circuit in each newly identified state, each time analysing the circuit to identify additional new states, until all possible states of the circuit have been identified.
