[go: up one dir, main page]

Klimowicz et al., 2015 - Google Patents

Structural models of finite-state machines for their implementation on programmable logic devices and systems on chip

Klimowicz et al., 2015

Document ID
5311845518441792048
Author
Klimowicz A
Solov’ev V
Publication year
Publication venue
Journal of Computer and Systems Sciences International

External Links

Snippet

Digital systems based on programmable logic devices and systems on chip often use register buffers for the transmission of signals between functional units. In this paper, structural models of finite state machines (FSMs) that allow the use of input and output buffer …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G06F17/5054—Circuit design for user-programmable logic devices, e.g. field programmable gate arrays [FPGA]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G06F17/505—Logic synthesis, e.g. technology mapping, optimisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03K—PULSE TECHNIQUE
    • H03K23/00—Pulse counters comprising counting chains; Frequency dividers comprising counting chains
    • H03K23/40—Gating or clocking signals applied to all stages, i.e. synchronous counters
    • H03K23/50—Gating or clocking signals applied to all stages, i.e. synchronous counters using bi-stable regenerative trigger circuits
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03K—PULSE TECHNIQUE
    • H03K19/00—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits
    • H03K19/02—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components
    • H03K19/173—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using elementary logic circuits as components
    • H03K19/177—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using elementary logic circuits as components arranged in matrix form
    • H03K19/17724—Structural details of logic blocks
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03K—PULSE TECHNIQUE
    • H03K3/00—Circuits for generating electric pulses; Monostable, bistable or multistable circuits
    • H03K3/02—Generators characterised by the type of circuit or by the means used for producing pulses
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03K—PULSE TECHNIQUE
    • H03K23/00—Pulse counters comprising counting chains; Frequency dividers comprising counting chains
    • H03K23/004—Counters counting in a non-natural counting order, e.g. random counters
    • H03K23/005—Counters counting in a non-natural counting order, e.g. random counters using minimum change code, e.g. Gray Code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored programme computers
    • G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit

Similar Documents

Publication Publication Date Title
Klimowicz et al. Structural models of finite-state machines for their implementation on programmable logic devices and systems on chip
Kubica et al. Technology Mapping for LUT-based FPGA
Barkalov et al. Improving characteristics of LUT-based Mealy FSMs
Grzes et al. Minimization of power consumption of finite state machines by splitting their internal states
CN109947395B (en) Programmable logic unit structure and chip
Solov’ev Minimization of mealy finite-state machines by using the values of the output variables for state assignment
Kubica et al. SMTBDD: New form of BDD for logic synthesis
Klimowicz et al. Minimization of incompletely specified Mealy finite-state machines by merging two internal states
Bukowiec et al. Synthesis of Petri nets into FPGA with operation flexible memories
Kubica et al. SMTBDD: new concept of graph for function decomposition
Klimovich et al. Minimization of mealy finite-state machines by internal states gluing
Salauyou et al. State Assignment of Finite-State Machines by Using the Values of Output Variables
Klimovich et al. A method for minimizing Moore finite-state machines by merging two states
Klimowicz et al. The synthesis of combined mealy and moore machines structural model using values of output variables as codes of states
Amagasaki et al. SLM: A scalable logic module architecture with less configuration memory
Barkalov et al. Hardware reduction in FPGA-based Moore FSM
Bukowiec et al. An FPGA synthesis of the distributed control systems designed with Petri nets
Solov’ev Implementation of finite-state machines based on programmable logic ICs with the help of the merged model of Mealy and Moore machines
Barkalov et al. Improving the LUT count for Mealy FSMs with transformation of output collections
Barkalov et al. Joint use of methods of structural decomposition for optimizing the circuit of Moore FSM
Oliveira et al. Burst‐Mode Asynchronous Controllers on FPGA
Czerwinski et al. State assignment and optimization of ultra-high-speed FSMs utilizing tristate buffers
Jozwiak et al. High-quality sub-function construction in functional decomposition based on information relationship measures
Deniziak et al. FPGA-based state encoding using symbolic functional decomposition
Mielcarek et al. Designing Moore FSM with unstandard representation of state codes