G06F9/4498

Signal arbiter

An arbiter for use with a plurality of request signals is presented. The arbiter includes a sequence identifier to identify an order between the plurality of request signals. The arbiter provides a plurality of output signals in which each output signal is associated with a request signal. When the request signals are provided in a sequential order the output signals are provided in the identified sequential order. When the request signals are provided substantially at the same time the output signals are provided in an arbitrary sequential order. A corresponding signal arbitration method and an electronic circuit comprising the arbiter are also presented.

Apparatus and method of a scalable and reconfigurable fast fourier transform
11614945 · 2023-03-28 · ·

A novel design for conflict free address generation mechanism is provided for reading data from Block RAM (BRAM) into a Fast Fourier Transform (FFT) module and writing back the processed data back to the BRAM. Also, a novel way of reducing a memory footprint by reducing a twiddle factor table size by taking an advantage of the symmetry property of twiddle factors is presented. Further, additional architecture-specific optimizations are provided, which involve a design of deeply pipelined butterfly modules and the BRAM accesses, parallel butterfly modules for a single FFT block and parallel FFT lane implementation.

AUTOMATA PROCESSING METHOD AND APPARATUS FOR REGULAR EXPRESSION ENGINES USING GLUSHKOV AUTOMATA GENERATION AND HYBRID MATCHING

Provided are an automata processing method and apparatus capable of transforming a regular expression pattern into a specific type of nondeterministic finite automata (NFA), selectively applying a matching algorithm to the nondeterministic finite automata according to whether to include an extended grammar to minimize the use of temporal and spatial resources, and preventing regular expression denial of service (ReDoS).

Method for determining possible transitions of system states
11478929 · 2022-10-25 · ·

A method for determining possible transitions of system states in an industrial system with a plurality of agents with discrete agent states. The method comprises the steps of defining a plurality of rules, each rule comprising a pre-condition of at least one agent state that is to be changed, a post-condition of the at least one agent state, and an action or actions resulting in a corresponding transition of the at least one agent state; defining a plurality of nodes, each node comprising a system state; and evaluating for a plurality of pairs of nodes, whereby one node of each pair acts as a pre- condition node and the other node of each pair acts as a post-condition node, whether the pair can, given the rules, be directly connected by an edge, each edge comprising an action or actions required for a transition between the respective pre- and post-condition system states.

PROCESS CONTROL WITH DIGITAL TWINS
20230129656 · 2023-04-27 · ·

The present invention relates to the field of real time process control using digital twins. In more detail, the present invention relates to the field of modeling distributed event-discrete systems using digital twins and subsequent use of the models for real time control of distributed even-discrete systems. There is provided a virtual twin engine for control of a distributed even-discrete system in real-time. The virtual twin engine has installed at least one executable modeling software kernel which runs subsystem use models in relation to subsystem clusters of the distributed event-discrete system. Also, the virtual twin engine operates the at least one digital twin in a passive manner through real time access to the modeling software kernel modeling the subsystem use model of the at least one digital twin.

A SYSTEM AND METHOD FOR CONFIGURING A LARGE-SCALE DISTRIBUTED INFRASTRUCTURE
20230125626 · 2023-04-27 ·

An orchestration system and method for configuring a large-scale distributed infrastructure including multiple subsystems. An orchestration model with pre-defined modules is provided for implementing desired states in the distributed infrastructure. Some modules of the orchestration model are coupled to a multi-state finite state machine including a list of desired states. A dynamic state transition of at least one finite state machine from one desired state to another is performed, in response to one or more detected events triggering a transition condition.

STATE MACHINE BASED SCRIPT APPLICATIONS AND SYSTEMS
20230075704 · 2023-03-09 ·

An example system includes a plurality of scriptable devices, each of which exposes an interface. The system may also comprise a medium storing data indicating, for each of a mapped plurality of device operations, one or more inputs to provide to a corresponding device from the plurality of scriptable devices and a conversion between that device operation and a corresponding application command. In such a system, the medium may also store a plurality of scripts, each of which may have a corresponding scriptable device from the plurality of scriptable devices and may comprise a set of device operations. The system may also comprise a computer to repeatedly preform an operation cycle comprising determining whether an application command should be executed and, when it should, generating a globally unique identifier corresponding to that command and adding that globally unique identifier and a device operation corresponding to that command to a log.

Methods and devices for programming a state machine engine
11599770 · 2023-03-07 · ·

A state machine engine having a program buffer. The program buffer is configured to receive configuration data via a bus interface for configuring a state machine lattice. The state machine engine also includes a repair map buffer configured to provide repair map data to an external device via the bus interface. The state machine lattice includes multiple programmable elements. Each programmable element includes multiple memory cells configured to analyze data and to output a result of the analysis.

Dataflow optimization apparatus and method for low-power operation of multicore systems

The present disclosure relates to a dataflow optimization method for low-power operation of a multicore system, the dataflow optimization method including: a step (a) of creating an FSM including a plurality of system states in consideration of dynamic factors that trigger a transition in system states for original dataflow; and a step (b) of optimizing the original dataflow through optimization of the created FSM.

Framework for UI automation based on graph recognition technology and related methods
11599449 · 2023-03-07 · ·

A GUI testing device may be configured to execute a testing state machine for interacting with a software application to generate an initial screen of a GUI. The GUI testing device may be configured to determine a current state in the testing state machine based upon a matching trigger target in the initial screen to a given state. The current state may include an operation, and the operation may associate with a trigger target to operate on. The trigger may include a source state, a destination state, and a trigger target. The operation may include a user input operation, and an operation trigger target. The GUI testing device may be configured to perform the operation on the matching trigger target in the initial screen to generate a next screen of the GUI, and advance from the current state to a next state based upon the trigger.