咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Kolmogorov-Chaitin Complexity ... 收藏

Kolmogorov-Chaitin Complexity of Digital Controller Implementations

Kolmogorov-Chaitin Complexity of Digital Controller Implementations

作     者:James F. Whidborne John McKernan Da-Wei Gu 

作者机构:Department of Aerospace Sciences Cranfield University Bedfordshire MK43 0AL UK Department of Engineering University of Leicester Leicester LE1 7RH UK 

出 版 物:《International Journal of Automation and computing》 (国际自动化与计算杂志(英文版))

年 卷 期:2006年第3卷第3期

页      面:314-322页

学科分类:08[工学] 0835[工学-软件工程] 0802[工学-机械工程] 080201[工学-机械制造及其自动化] 

主  题:Controller complexity finite-precision arithmetic finite word length digital controller Kolmogorov-Chaitin complexity. 

摘      要:The complexity of linear, fixed-point arithmetic digital controllers is investigated from a Kolmogorov-Chaitin perspective. Based on the idea of Kolmogorov-Chaitin complexity, practical measures of complexity are developed for statespace realizations, parallel and cascade realizations, and for a newly proposed generalized implicit state-space realization. The complexity of solutions to a restricted complexity controller benchmark problem is investigated using this measure. The results show that from a Kolmogorov-Chaitin viewpoint, higher-order controllers with a shorter word-length may have lower complexity and better performance, than lower-order controllers with longer word-length.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分