{"title":"Pearl: CMOS定时分析仪","authors":"J. J. Cherry","doi":"10.1109/DAC.1988.14750","DOIUrl":null,"url":null,"abstract":"Pearl is a timing analyzer that has been used to verify both full-custom VLSI and gate array designs. Rather than verify that a design meets a given clock timing, Pearl automatically determines the minimum error-free clock period and duty cycles. The author describes the mechanism used to determine the timing relationship each node in the circuit has with respect to the clock edges. He then shows how these dependencies, together with the setup and hold time requirements of latches and registers in the circuit, are used to formulate timing constraints between the clock edges. These timing requirements are solved using a linear programming algorithm to determine the minimum time of each clock edge. The algorithm is first described for the case of a circuit composed of functional models and then applied to MOS switch circuits. The author also describes transistor signal-flow direction rules for CMOS circuits used to eliminate false paths.<<ETX>>","PeriodicalId":230716,"journal":{"name":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Pearl: a CMOS timing analyzer\",\"authors\":\"J. J. Cherry\",\"doi\":\"10.1109/DAC.1988.14750\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pearl is a timing analyzer that has been used to verify both full-custom VLSI and gate array designs. Rather than verify that a design meets a given clock timing, Pearl automatically determines the minimum error-free clock period and duty cycles. The author describes the mechanism used to determine the timing relationship each node in the circuit has with respect to the clock edges. He then shows how these dependencies, together with the setup and hold time requirements of latches and registers in the circuit, are used to formulate timing constraints between the clock edges. These timing requirements are solved using a linear programming algorithm to determine the minimum time of each clock edge. The algorithm is first described for the case of a circuit composed of functional models and then applied to MOS switch circuits. The author also describes transistor signal-flow direction rules for CMOS circuits used to eliminate false paths.<<ETX>>\",\"PeriodicalId\":230716,\"journal\":{\"name\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1988.14750\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1988.14750","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pearl is a timing analyzer that has been used to verify both full-custom VLSI and gate array designs. Rather than verify that a design meets a given clock timing, Pearl automatically determines the minimum error-free clock period and duty cycles. The author describes the mechanism used to determine the timing relationship each node in the circuit has with respect to the clock edges. He then shows how these dependencies, together with the setup and hold time requirements of latches and registers in the circuit, are used to formulate timing constraints between the clock edges. These timing requirements are solved using a linear programming algorithm to determine the minimum time of each clock edge. The algorithm is first described for the case of a circuit composed of functional models and then applied to MOS switch circuits. The author also describes transistor signal-flow direction rules for CMOS circuits used to eliminate false paths.<>