Klimowicz, 2020 - Google Patents
Combined State Splitting and Merging for Implementation of Fast Finite State Machines in FPGAKlimowicz, 2020
- Document ID
- 4451880579573816510
- Author
- Klimowicz A
- Publication year
- Publication venue
- International Conference on Computer Information Systems and Industrial Management
External Links
Snippet
A new method of the synthesis of finite state machines is proposed. In this method, the speed of FSM is taken into account already at the early stage of synthesis process. The method is based on sequential merging and splitting two internal states regarding to speed …
- 230000002194 synthesizing 0 abstract description 26
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/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
-
- 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/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
- G06F17/5077—Routing
-
- 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/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
-
- 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
- G06F7/50—Adding; Subtracting
- G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/44—Encoding
-
- 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/30—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
- G06F2217/78—Power analysis and optimization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6038392A (en) | Implementation of boolean satisfiability with non-chronological backtracking in reconfigurable hardware | |
Sapatnekar | Timing | |
Miller et al. | Reducing reversible circuit cost by adding lines | |
US6920625B2 (en) | Method and apparatus for optimum transparent latch placement in a macro design | |
Del Barrio et al. | Multispeculative addition applied to datapath synthesis | |
Liu et al. | Design of quantum-dot cellular automata circuits using cut-set retiming | |
Su et al. | A novel heuristic search method for two-level approximate logic synthesis | |
JP4495865B2 (en) | Inter-trade application service provider | |
Cortadella et al. | Decomposition and technology mapping of speed-independent circuits using Boolean relations | |
Salauyou et al. | Coding techniques in Verilog for finite state machine designs in FPGA | |
Klimowicz | Combined State Splitting and Merging for Implementation of Fast Finite State Machines in FPGA | |
Solov’ev | Synthesis of fast finite state machines on programmable logic integrated circuits by splitting internal states | |
Turner | An engineering approach to formal methods | |
Salauyou et al. | State Assignment of Finite-State Machines by Using the Values of Output Variables | |
US7051312B1 (en) | Upper-bound calculation for placed circuit design performance | |
Preethi et al. | Sorter Design with Structured Low Power Techniques | |
Das et al. | A timing-driven approach to synthesize fast barrel shifters | |
Pangrle et al. | Relevant issues in high-level connectivity synthesis | |
Klimowicz et al. | Combined State Merging and Splitting Procedure for Low Power Implementations of Finite State Machines | |
Klimowicz | Performance targeted minimization of incompletely specified finite state machines for implementation in FPGA devices | |
Klimowicz | Area targeted minimization method of finite state machines for FPGA devices | |
Klimowicz | On using speed as the criteria of state selection for minimization of finite state machines | |
Salauyou et al. | The Synthesis Method of High-Speed Finite State Machines in FPGA | |
Nodine et al. | A mature methodology for implementing multi-valued logic in silicon | |
Salauyou et al. | Synthesis of high-speed ASM controllers with Moore outputs by introducing additional states |