!04synthesis高级解读.ppt

  1. 1、本文档共67页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
张万荣 2012 VLSI CAD VLSI CAD (2012~2013年第一学期) 北京工业大学 电子科学与技术学科部 张万荣 教授 第4章 高级综合技术(High-level synthesis) 综合技术 4.1 高级综合技术概述 4.1 高级综合流程(其一) 高级综合流程(其二) 高级综合技术 数据通道的综合 控制器综合: 结果生成与反编译: 结果生成与反编译: 结果生成与反编译: 结果生成与反编译: 控制器数据通路例子 控制器数据通路例子 4.1 高级综合技术概述---小结 4.2 高级综合结果的应用 High-level synthesis has also other uses: 4.3 行为描述、编译和转换 Functional modeling code in VHDL Data dependencies Data flow graph(数据流图) Data flow graph construction Data flow graph construction, cont’d 4.4 调度和分配 Goals of scheduling and allocation Data flow to data path-controller Binding values to registers(寄存器) Choosing function units Building the sequencer 4. 5 高级综合折衷,调度分配方法 Finding schedules ASAP and ALAP schedules Critical path of schedule Operator chaining 4.6 控制器综合 4.6 控制器综合 Controllers and scheduling Distributed control Synchronized communication between FSMs Hardwired vs. microcoded control Controller implementation styles Data path-controller delay Architectures for low power Architecture-driven voltage scaling Power-down modes 总结与习题 Supplement Materials High Level Synthesis (HLS) The process of converting a high-level description of a design to a netlist Input: High-level languages (e.g., C) Behavioral hardware description languages (e.g., VHDL) Structural HDLs (e.g., VHDL) State diagrams / logic networks Tools: Parser Library of modules Constraints: Area constraints (e.g., # modules of a certain type) Delay constraints (e.g., set of operations should finish in l clock cycles) Output: Operation scheduling (time) and binding (resource) Control generation and detailed interconnections Scheduling and binding can be done in different orders or together Schedule: Mapping of operations to time slots (cycles) A scheduled sequencing graph is a labeled graph For each operation, define its type. For each resource, define a resource type, and a delay (in terms of # cycles) T is a relation that maps an operation to a resource type that can implement it T : V ? {1, 2, ..., nres}. More general case: A resource

文档评论(0)

w3388825 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档