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 both state-space realizations, and for parallel and cascade realizations. 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 a lower complexity but a better performance than lower-order controllers with longer word-length.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
