EECS 219B Spring 2002 University of Texas at AustinEECS 219b弹簧2002德克萨斯大学奥斯丁.pptVIP

下载本文档

1
0
约 14页
2017-02-13 发布于上海
举报
版权申诉

EECS 219B Spring 2002 University of Texas at AustinEECS 219b弹簧2002德克萨斯大学奥斯丁.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Logic Synthesis Multi-Level Logic Synthesis Basic Model: Hardware Implementing Finite State Machines General Logic Structure Optimization Criteria for Synthesis Example: Area-Delay Trade-off Two-Level (PLA) vs. Multi-Level PLA control logic constrained layout highly automatic technology independent multi-valued logic input, output, state encoding Very predictable General Approaches to Synthesis PLA Synthesis: theory well understood predictable results in a top-down flow Multi-Level Synthesis: optimization criteria very complex except niches, no general theory available greedy optimization approach incrementally improve along various dimensions of the criteria works on common design representation (circuit or network representation) attempt a change, accept if criteria improves, otherwise reject Transformation-based Synthesis all modern synthesis systems are build that way set of transformations that change network representation work on uniform network representation “script” of “scenario” that can combine those transformations to a overall greedy transformations differ in: the scope they are applied local scope versus global restructuring the domain they optimize combinational versus sequential timing versus area technology independent versus technology dependent the underlying algorithms they use BDD based, SAT based, structure based Network Representation Typical Synthesis Scenario Local versus Global Transformations Local transformations optimize the function of one node of the network smaller area faster performance map to a particular set of cells Global transformations restructure the entire network merging nodes spitting nodes removing/changing connections between nodes Node representation: SOP, POS BDD Factored forms keep size bounded to avoid blow-up of local transformations Sum of Products (SOP) Reduced Ordered BDDs Factored Forms * Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) X=(x1,x2,…,xn) Y=(y1,y2,…,yn) l d S=(s1,s2,…,sn) S’=(s’1,s’2,…,s’