Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/69648
DC FieldValue
dc.titleComparative studies on repeatable runout compensation using iterative learning control
dc.contributor.authorXu, J.-X.
dc.contributor.authorLee, T.H.
dc.contributor.authorZhang, H.-W.
dc.date.accessioned2014-06-19T03:03:05Z
dc.date.available2014-06-19T03:03:05Z
dc.date.issued2001
dc.identifier.citationXu, J.-X.,Lee, T.H.,Zhang, H.-W. (2001). Comparative studies on repeatable runout compensation using iterative learning control. Proceedings of the American Control Conference 4 : 2834-2839. ScholarBank@NUS Repository.
dc.identifier.issn07431619
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/69648
dc.description.abstractIn this paper, two types of iterative learning control schemes, previous cycle learning (PCL) and current cycle learning (CCL), are used to eliminate repeatable run-out (RRO) disturbance in hard disk drive (HDD) servomechanism. The convergence conditions of two learning control schemes have been explored in details. The analysis shows that PCL must possess a relative degree of zero. The CCL scheme, on the other hand, allows a relative degree of one for certain range of frequencies to be tracked. To illustrate and compare the applicability and effectiveness of the two ILC schemes for HDD RRO problems, a number of simulations are conducted under a noise contaminated environment.
dc.sourceScopus
dc.subjectCurrent cycle learning
dc.subjectHard disk drive
dc.subjectIterative learning control
dc.subjectPrevious cycle learning
dc.subjectRepeatable run-out
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleProceedings of the American Control Conference
dc.description.volume4
dc.description.page2834-2839
dc.description.codenPRACE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


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