Synthesis of sequential circuits on programmable logic devices based on new models of finite state machines

S. Valeri
{"title":"Synthesis of sequential circuits on programmable logic devices based on new models of finite state machines","authors":"S. Valeri","doi":"10.1109/DSD.2001.952274","DOIUrl":null,"url":null,"abstract":"In this paper, new models, called class A, class B, class C, and class D, of a finite state machine (FSM) are proposed. This permits to effectively use both properties of FSM and architectural opportunities of PLD. The synthesis methods for each class of FSM are also presented. Experimental results on benchmarks showed that the choice of the synthesis method for suitable FSM class has the highest influence on the cost of realisation of FSM on PLD. The cost of realisation on PLD of the same examples for various FSM classes can be different more than 8 times.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Euromicro Symposium on Digital Systems Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSD.2001.952274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

In this paper, new models, called class A, class B, class C, and class D, of a finite state machine (FSM) are proposed. This permits to effectively use both properties of FSM and architectural opportunities of PLD. The synthesis methods for each class of FSM are also presented. Experimental results on benchmarks showed that the choice of the synthesis method for suitable FSM class has the highest influence on the cost of realisation of FSM on PLD. The cost of realisation on PLD of the same examples for various FSM classes can be different more than 8 times.
基于有限状态机新模型的可编程逻辑器件顺序电路综合
提出了有限状态机(FSM)的A类、B类、C类和D类新模型。这允许有效地利用FSM的属性和PLD的架构机会。给出了每一类FSM的综合方法。基准实验结果表明,选择合适的FSM类综合方法对FSM在可编程逻辑器件上的实现成本影响最大。不同FSM类的相同示例在PLD上的实现成本可能相差8倍以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信