Title page for ETD etd-11242009-020121

Type of Document Master's Thesis
Author Gorti, Bhaskar M.
URN etd-11242009-020121
Title Techniques for discrete, time domain system identification
Degree Master of Science
Department Electrical Engineering
Advisory Committee
Advisor Name Title
VanLandingham, Hugh F. Committee Chair
Baumann, William T. Committee Member
Bingulac, Stanoje P. Committee Member
  • Time-domain analysis
Date of Defense 1991-02-05
Availability restricted

Effective and efficient system identification techniques for discrete, time domain, linear, MIMO, heavily damped modal systems from input/output sequences have been developed and simulated. This will facilitate a better understanding of the possible errors in the estimated model and lead to a more accurate compensator and estimator design. Three different time domain system identification algorithms have been developed in this work. The first algorithm determines the state space model in a pseudo controllable/observable canonical form. The second method is a computational simplification of the Eigensystem Realization Algorithm using pseudo observability and controllability indices. The third algorithm tested is the Pseudo Linear Identification Algorithm (PLID). The PLID algorithm is extensively tested on simulated data. This algorithm is also applied to identify a rectangular plate which gives a realistic idea of the identification capabilities of the PLID algorithm to real measured data.

  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
[VT] LD5655.V855_1991.G677.pdf 2.76 Mb 00:12:47 00:06:34 00:05:45 00:02:52 00:00:14
[BTD] next to an author's name indicates that all files or directories associated with their ETD are accessible from the Virginia Tech campus network only.

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.