Author:
Czerwiński Robert,Kania Dariusz
Abstract
Synthesis of finite state machines for CPLDsThe paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of two-level minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach is especially effective for PAL-based CPLD structures containing a low number of product terms.
Subject
Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference22 articles.
1. Logic Synthesis for Control Automata
2. Reduction in the number of PAL macrocells in the circuit of a Moore FSM;A. Barkalov;International Journal of Applied Mathematics and Computer Science,2007
3. Low power state assignment and flipflop selection for finite state machine synthesis—A genetic algorithmic approach;S. Chattopadhyay;IEE Proceedings—Computers and Digital Techniques,2001
4. Evolutionary algorithm for state assignment of finite state machines;M. Chyży,2002
5. State assignment for PAL-based CPLDs;R. Czerwiński,2005
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decomposition Methods of FSM Implementation;Lecture Notes in Electrical Engineering;2020-11-08
2. Introduction;Lecture Notes in Electrical Engineering;2020-11-08
3. Linear Chains in FSMs;Logic Synthesis for Finite State Machines Based on Linear Chains of States;2017-06-25
4. State Assignment and Optimization of Ultra-High-Speed FSMs Utilizing Tristate Buffers;ACM Transactions on Design Automation of Electronic Systems;2016-12-28
5. Technology mapping based on modified graph of outputs;AIP Conference Proceedings;2015