- (530) 752-8133
Ph. D. in Engineering, Harvard University, Cambridge, MA, 1981
M.S. in Engineering, Harvard University, Cambridge, MA, 1977
M.S. in Electronic Engineering, National Chiao Tung University, Hsinchu, Taiwan 1973
B.S. in Electronic Engineering, National Chiao Tung University, Hsinchu, Taiwan 1971
Professor, University of California, Davis, Electrical & Computer Engineering, 1996-Present
Associate Professor, University of California, Davis, Electrical & Computer Engineering, 1988-1996
Assistant Professor, University of California, Davis, Electrical & Computer Engineering, 1984-1988
Assistant Professor, State University of New York, Stony Brook, Electrical Engineering, 1981-1984
Instructor, National Chiao Tung University, Electronic Engineering, Hsinchu, Taiwan, 1975-1976
Instructor, Chinese Navy Communication and Electronic School, Taiwan, 1974-1975
Electrical and Computer Engineering Graduate Group
Graduate group in Applied Mathematics
Algorithmic development for global and local optimization and their applications to various engineering problems such as placement and floorplanning in VLSI physical design automation, control system design, etc.
His current research in VLSI physical design automation is to develop an approach to obtain a globally minimal area floorplan for an L-shaped layout problem with soft modules. A given layout can be represented by its geometric figure no matter it is a slicing floorplan or a nonslicing one. The advantage of using the geometric figure is that the relative position of a given partition can always be kept fixed. This is often required when the empty space of an initial placement can be utilized by changing rectangular blocks into L-shaped ones. The approach can be extended for layouts containing more general soft modules if the addition of such modules can help the utilization of the empty space. Similarly a placement problem is generally considered as a very difficult problem, it can be also examined by such an approach with additional techniques. For algorithmic developments, the surrogate gradient algorithm is generalized and will be used for various application problems. A general framework for developing higher order algorithms for a nonlinear scalar equation is proposed and its possible extension to multivariate problems examined. For controller design, PID synthesis procedures are developed for certain classes of MIMO systems with guaranteed stability margin.
T. S. Chang and A. N. Gundes, PID controller synthesis with specified stability requirement for some classes of MIMO systems, Engineering Letters, Vol. 16, No. 2, p. 256-265, May 2008.
T. S. Chang, Comments on Surrogate gradient algorithm for Lagrangian relaxation, to appear at Journal of Optimization Theory, on-line 7 pages, DOI 10.1007/s10957-007-9349-z, 2008.
T. S. Chang, M. Kumar, T. S. Moh and C. L. Tseng, On the feasibility of obtaining a globally optimal floorplanning for an L-shaped layout problem, Proceedings of the 9th International Symposium on Quality Electronic Design, p. 277-282, March 2008.
T. S. Moh and T. S. Chang, Comments on handling soft modules in general nonslicing floorplan using Lagrangian relaxation, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 22, No. 12, p. 1684-1686, December 2003.
T. S. Moh, T. S. Chang and S. L. Hakimi, Globally optimal floorplanning for a layout problem, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications , Vol. 43, No. 9, p. 713-720, September 1996.