用于逻辑综合的MCNC基准fsm代数分解

Euro ASIC '91 Pub Date : 1991-05-27 DOI:10.1109/EUASIC.1991.212876

T. Muller-Wipperfurth, M. Geiger

{"title":"用于逻辑综合的MCNC基准fsm代数分解","authors":"T. Muller-Wipperfurth, M. Geiger","doi":"10.1109/EUASIC.1991.212876","DOIUrl":null,"url":null,"abstract":"An interactive application of algebraic structure theory is presented to decompose finite state machines (FSMs) for logic synthesis purposes. Parallel and serial decompositions with symbolic states are achieved. CASTOR, JEDI ESPRESSO, and MIS are utilized to perform state assignment and logic minimization. Experimental results of two-level and multi-level implementations of MCNC benchmark FSMs are presented.<<ETX>>","PeriodicalId":118990,"journal":{"name":"Euro ASIC '91","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Algebraic decomposition of MCNC benchmark FSMs for logic synthesis\",\"authors\":\"T. Muller-Wipperfurth, M. Geiger\",\"doi\":\"10.1109/EUASIC.1991.212876\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An interactive application of algebraic structure theory is presented to decompose finite state machines (FSMs) for logic synthesis purposes. Parallel and serial decompositions with symbolic states are achieved. CASTOR, JEDI ESPRESSO, and MIS are utilized to perform state assignment and logic minimization. Experimental results of two-level and multi-level implementations of MCNC benchmark FSMs are presented.<<ETX>>\",\"PeriodicalId\":118990,\"journal\":{\"name\":\"Euro ASIC '91\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Euro ASIC '91\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUASIC.1991.212876\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Euro ASIC '91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUASIC.1991.212876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

提出了代数结构理论在有限状态机分解中的交互式应用，用于逻辑综合。实现了具有符号状态的并行和串行分解。CASTOR、JEDI ESPRESSO和MIS被用来执行状态分配和逻辑最小化。给出了MCNC基准fsm的两级和多级实现的实验结果

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Algebraic decomposition of MCNC benchmark FSMs for logic synthesis

An interactive application of algebraic structure theory is presented to decompose finite state machines (FSMs) for logic synthesis purposes. Parallel and serial decompositions with symbolic states are achieved. CASTOR, JEDI ESPRESSO, and MIS are utilized to perform state assignment and logic minimization. Experimental results of two-level and multi-level implementations of MCNC benchmark FSMs are presented.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Euro ASIC '91

自引率

0.00%

发文量