Title:	ADVANCES IN ROUTING ALGORITHMS FOR COMPLEX CIRCUIT BOARDS
Date:	January 23, 2009 (Friday)
Time:	2:30 p.m. - 3:30 p.m.
Venue:	Room 121, 1/F, Ho Sin-hang Engineering Building, The Chinese University of Hong Kong, Shatin, N.T.
Speaker:	Prof. Martin D.F. Wong Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign USA

ABSTRACT:

Research in routing algorithms for electronic design automation started in the early 1960s, targetting for printed circuit boards (PCB). Later on, PCB routing algorithms were extended to solve the chip-level routing problem. While chip-level routing has been an active research topic in the past 30 years, PCB routing has long been considered as a "solved" problem. Due to the rapid increases in PCB complexity and the lack of research progresses in PCB routing algorithms over the years, routing has become a bottleneck in overall circuit board design time. Today, a high-end PCB typically takes 2 months of tedious manual efforts to complete the wiring and this problem will only get worse for future generations of PCBs. We are working closely with industry on the PCB routing problem. In this talk, we present some of our recent research results on this problem.

BIOGRAPHY:

Martin D.F. Wong obtained the Ph.D. degree in computer science from the University of Illinois at Urbana-Champaign (UIUC) in 1987. He is currently Professor of Electrical and Computer Engineering at UIUC. He has published over 350 technical papers and has graduated 37 Ph.D. students in the area of computer-aided design of VLSI. He has won a few best paper awards in CAD. He has served on numerous technical program committees of leading CAD conferences and has served as an associate editor for several IEEE/ACM journals (e.g., IEEE Transactions on Computer-Aided Design). He was an IEEE Distinguished Lecturer in 2005-2006. He is a Fellow of IEEE.

Enquiries: Miss Temmy So at tel 2609 8444

For more information, please refer to http://www.cse.cuhk.edu.hk/seminar