CERES > School of Engineering (SoE) (2001-July 2014) > Staff publications - School of Engineering >

Please use this identifier to cite or link to this item: http://dspace.lib.cranfield.ac.uk/handle/1826/1235

Document Type: Article
Title: Kolmogorov-Chaitin complexity of digital controller implementations.
Authors: Whidborne, James F.
McKernan, John
Gu, Da-Wei
Issue Date: 2006
Citation: James F. Whidborne, John McKernan, Da-Wei Gu. Kolmogorov-Chaitin Complexity of Digital Controller Implementations. International Journal of Automation and Computing, Vol. 3 No.3, July 2006 pg 314-322
Abstract: 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.
URI: http://dx.doi.org/10.1007/s11633-006-0314-3
Appears in Collections:Staff publications - School of Engineering

Files in This Item:

File Description SizeFormat
Kolmogorov-Chaitin Complexity Digital Controller Implementation-2006.pdf2.1 MBAdobe PDFView/Open

Items in CERES are protected by copyright, with all rights reserved, unless otherwise indicated.