{"title":"划分方法，以找到一个精确的解决方案，拟合问题，在特定的应用程序的EPLD器件","authors":"M. Chrzanowska-Jeske, Steffen Goller","doi":"10.1109/EURDAC.1993.410614","DOIUrl":null,"url":null,"abstract":"A new routing-driven partitioning approach for fitting a sequential circuit onto limited-connectivity EPLDs (electrically programmable logic devices) is presented. The fitting problem is stated as a graph monomorphism problem. Global, local, and adjacency routing constraints are used to define the partitioning properties of the graph representing chip resources. This approach very effectively limits the solution space of the graph monomorphism problem in the early stages of the search. The program which uses the proposed algorithm to solve the fitting problem for the CY7C361 device, from Cypress Semiconductor, has been implemented and tested. Solutions to a number of problems unsolved by the previous fitter were found. The experimental results are presented.<<ETX>>","PeriodicalId":339176,"journal":{"name":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Partitioning approach to find an exact solution to the fitting problem in an application-specific EPLD device\",\"authors\":\"M. Chrzanowska-Jeske, Steffen Goller\",\"doi\":\"10.1109/EURDAC.1993.410614\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new routing-driven partitioning approach for fitting a sequential circuit onto limited-connectivity EPLDs (electrically programmable logic devices) is presented. The fitting problem is stated as a graph monomorphism problem. Global, local, and adjacency routing constraints are used to define the partitioning properties of the graph representing chip resources. This approach very effectively limits the solution space of the graph monomorphism problem in the early stages of the search. The program which uses the proposed algorithm to solve the fitting problem for the CY7C361 device, from Cypress Semiconductor, has been implemented and tested. Solutions to a number of problems unsolved by the previous fitter were found. The experimental results are presented.<<ETX>>\",\"PeriodicalId\":339176,\"journal\":{\"name\":\"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURDAC.1993.410614\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1993.410614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Partitioning approach to find an exact solution to the fitting problem in an application-specific EPLD device
A new routing-driven partitioning approach for fitting a sequential circuit onto limited-connectivity EPLDs (electrically programmable logic devices) is presented. The fitting problem is stated as a graph monomorphism problem. Global, local, and adjacency routing constraints are used to define the partitioning properties of the graph representing chip resources. This approach very effectively limits the solution space of the graph monomorphism problem in the early stages of the search. The program which uses the proposed algorithm to solve the fitting problem for the CY7C361 device, from Cypress Semiconductor, has been implemented and tested. Solutions to a number of problems unsolved by the previous fitter were found. The experimental results are presented.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
