ECE 598
Special Topics in ECE
Credit: 0 to 4 hours.
Subject offerings of new and developing areas of knowledge in electrical and computer engineering intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. May be repeated in the same or separate terms if topics vary.
| CRN | Type | Section | Time | Days | Location | Instructor |
|---|---|---|---|---|---|---|
| 54382 | lecture- discussion | MAN | 11:00 AM - 12:15 PM | WF | room 1304 Siebel Center for Comp Sci | Borisov, N; Prabhakaran, M |
| Restricted to Graduate - Urbana-Champaign. 4 hours Topic: Applied Cryptography. This course is intended to provide a foundation in applied cryptography. It introduces the students to fundamental cryptographic notions and how cryptographic primitives can be used to construct larger schemes with security guarantees. Meets with CS 598 section MAN. Note to undergraduates: Advanced undergraduate students are encouraged to try this course. | ||||||
| 54453 | lecture | NV | 11:00 AM - 12:20 PM | TR | room 1304 Siebel Center for Comp Sci | Vaidya, N |
| Restricted to Graduate - Urbana-Champaign. 4 hours Topic: Distributed Algorithms for Wired and Wireless Networks. Prerequisites: ECE 428 or ECE 438. : Distributed algorithms for wired networks, including algorithms for consensus, clock synchronization, mutual exclusion, broadcast; proofs of correctness of distributed algorithms; fault-tolerant distributed algorithms; distributed algorithms for wireless networks. | ||||||
| 54895 | lecture | RT | 10:00 AM - 10:50 AM | MWF | room 143 Everitt Elec and Comp Engr Lab | Basar, M; Tempo, R |
| Restricted to Graduate - Urbana-Champaign. 2 hours Topic: Randomized Algorithms for System Design: Theory and Applications. Prerequisites: ECE 313 and ECE 515, or equivalents. In recent years, we have seen a growing interest in randomization of uncertain systems with the objective to reduce the complexity of feedback. This course will provide a broad perspective of this area and discuss several topics, which include the connections between randomized algorithms and statistical learning theory, and the computation of the sample complexity. In particular, the course will address systems analysis and design using sequential and non-sequential randomized methods, and analyze advantages and disadvantages of both approaches. Furthermore, the course will also demonstrate the utility of randomization for studying various applications such as congestion control of high-speed communication networks, control design of Mini-UAVs (Unmanned Aerial Vehicles), and the computation of PageRank in the search engine Google using a distributed randomized approach. Finally, the main features of the recently developed Matlab Toolbox RACT (Randomized Algorithms Control Toolbox) will be illustrated. Meets 24-Aug-09 - 16-Oct-09. | ||||||
| 51921 | lecture- discussion | SV | 12:30 PM - 01:50 PM | TR | room 1111 Siebel Center for Comp Sci | Vasudevan, S |
| Restricted to Graduate - Urbana-Champaign. 4 hours Topic: Automatic Approaches to Hardware and Software Verification. Prerequisities: ECE 411 or CS/ECE 462 and CS 273 or CS 225 or consent of instructor. This course will introduce the student to formal verification techniques to check hardware designs and embedded software. The course will present an overview of the verification paradigms that are most applied in practical hardware and embedded system verification. The course will discuss state space based automatic verification techniques such as: model checking, symbolic model checking, BDD-based equivalence checking, symbolic trajectory evaluation, symbolic simulation and SAT solving algorithms. The course will also discuss deductive checking techniques like theorem proving and rewriting for arithmetic and processor verification. There will be an emphasis on the practical ramifications of these algorithms in contemporary semiconductor as well as embedded software environments. | ||||||
| 52598 | lecture- discussion | TT2 | 05:30 PM - 07:10 PM | TR | room 245 Everitt Elec and Comp Engr Lab | Tezcan, T |
| Restricted to Graduate - Urbana-Champaign. 4 hours Topic: Introduction to Queuing Theory and Stochastic Network Systems. Queuing theory is the mathematical analysis of waiting lines. Applications are frequently encountered in customer service situations as well as transport and telecommunication. This course will cover the basics and some contemporary methods in queuing theory. | ||||||
| 53612 | lecture | XL | 09:30 AM - 10:50 AM | TR | room 104 Talbot Laboratory | Li, X |
| Restricted to Graduate - Urbana-Champaign. 4 hours Topic: Speical Topics in Semiconductor Nanotechnology. Prerequisities: ECE 440 or equivalent requried. ECE 498JL high recommended. The course starts with a brief overview nanotechnology in general then focuses on the synthesis methods of various building blocks, including an in-depth tutorial of applications of epitaxial growth (MOCVD/MBE) in nanostructure growth. The correlation between growth parameter variation with topography, microstructure, defect and impurity incorporations will be discussed. For nanostructure characterization, the focus will be on spatially and time-resolved optical characterization and its correlation with morphological, chemical and electrical properties. The discussion of nano-devices will be application-orientated with categories including energy conversion (photovoltaic, thermoelectric, etc.), light emission and detection (LEDs, lasers, and detectors), IC roadmap, and chemical and biological sensing etc. The course will conclude with discussions on perspectives on nano-device integration and manufacturing. Examples used throughout the lecture and discussions will be dynamic as the frontier of literatures continues to evolve. | ||||||