一种闭环控制系统的快速开发.pptVIP

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

THE RAPID DEVELOPMENT OF A CLOSED-LOOP CONTROL SYSTEM 一种闭环控制系统的快速开发 1.3. Closed-loop control systems Although system functionalities may be differed from control systems to control systems,the control algorithms (PID, MPC, etc.) employed are the core function modules.Furthermore, the development cycles and performance of the systems are also mainly determined by the implementation of those algorithms[6]. When those algorithms are implemented on the reconfigurable hardware, the first issue raised is how to reach high performances of algorithms with limited hardware resources. The second issue raised is how to have a general chip-level design model, in which modules and algorithms can be reconfigured. 各种控制系统的功能可能不同,不过控制算法的配置都是控制系统中的核心功能,而且控制算法影响开发周期和系统性能..控制算法应用到可重构硬件的时候,第一要考虑怎样在有限的硬件资源上达到高性能,二是怎么设计一般性的芯片级设计模型,使模块和算法可以在上面重构. Input: one matrix A with n x l elements and one matrix B with l x m elements Output: one matrix C with n x m elements Begin Stepl. Choose Nc. (number of computing cells) Set j=1 (initialize clock cycle count) Step2. For each clock cycle j Xl - Bj;Xk+1 - Xk;j - j+1;k=1,2,...,j; If Ncj,then stop Step3. Set j=1 (initialize clock cycle count) For each clock cycle j Cj -A1xXj;Ck -A j-k+1x Xk;j } j+1;k=1,2,...,j; If lj,then stop End If it is assumed that the n is the maximum of three variables: n, m and 1, then the computation complexity in the conventional ways is O(n3 ).The maximum computation complexity after the proposed algorithm is O(n2一n+1) and then can be deduced asO(n2).For example, if the clock rate is 100 clock cycles/ps, simulated on the testing platform, the computational delay of the proposed algorithm, for the two 5x5 matrices, is 0.29 ps similar to the theoretical results, while the computational delay of the conventional algorithm is 1.40 ps. It can be seen that the computation speed by the proposed algorithm is almost five times faster than tha

文档评论(0)

天马行空 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档