Computer Engineering Course Descriptions
2011-12 General Catalog
Baskin School of Engineering
(831) 459-2158
http://www.soe.ucsc.edu
Lower-Division Courses
1. Hands-On Computer Engineering (2 credits).
Hands-on introduction to computer engineering practice and research, including computer hardware, robotics, and embedded systems. Encourages interaction with UCSC's School of Engineering community. Designed for students without previous background in computer engineering. Enrollment restricted to first-year students and sophomores. Enrollment limited to 20. T. Larrabee, S. Petersen, R. Hughey
3. Personal Computer Concepts: Software and Hardware. F,W,S
Provides an introduction to computers. Personal computing is emphasized, and students are introduced to word processing, spreadsheets, database management, graphics, and programming. Covers fundamentals of computing and current and future uses of computer technology, PC hardware, Windows operating system, applications software, networking and the Internet, and developments in the computer industry. Designed for students with little or no experience using computers. Students cannot receive credit for this course and Computer Science 2. (General Education Code(s): IN.) G. Moulds
8. Robot Automation: Intelligence through Feedback Control. F
Introduction to dynamical systems, feedback control, and robotics. Fundamental concepts in dynamical systems, modeling, stability analysis, robustness to uncertainty, feedback as it occurs naturally, and the design of feedback-control laws to engineer desirable static and dynamic response. Course includes an introduction to MATLAB and programming in MATLAB. Priority enrollment restricted to first-year students and sophomores. (General Education Code(s): MF, IN, Q.) W. Dunbar, G. Elkaim
9. Introduction to Statics, Dynamics, and Biomechanics. W
Theory and application of mathematical models to analyze statics and dynamics of mechanical and biomechanical systems (partials and rigid bodies) using a vector algebra. Covers: Newton's laws; free-body diagrams; structure analysis; friction; virtual work; energy and momentum methods; dynamics of bodies in two and three dimensions. Prerequisite(s): Mathematics 19A, and Physics 5A/L or 6A/L., and Applied Mathematics and Statistics 10 or Mathematics 21. G. Elkaim, J. Rosen, W. Dunbar
12. Computer Systems and Assembly Language. F,W,S
Introduction to computer systems and assembly language and how computers compute in hardware and software. Topics include digital logic, number systems, data structures, compiling/assembly process, basics of system software, and computer architecture. May include C language. Prerequisite(s): course 3 or 8, or Computer Science 10 or 12A or 5C or 5J or 5P, or Biomolecular Engineering 60, or suitable programming experience; previous or concurrent enrollment in course 12L required. (General Education Code(s): IN, Q.) T. Larrabee, R. Hughey, G. Elkaim, A. Brandwajn, F. Ferguson
12L. Computer Systems and Assembly Language Laboratory (2 credits). F,W,S
Laboratory sequence in assembly language programming. The basics of logic design, both RISC and microcontroller programming. May include C language programming. Two two-hour laboratories per week . Prerequisite(s): course 3 or 8, or Computer Science 10 or 12A or 5C or 5J or 5P, or Biomolecular Engineering 60, or suitable programming experience; previous or concurrent enrollment in course 12 required. T. Larrabee, R. Hughey, G. Elkaim, A. Brandwajn, F. Ferguson
13. Computer Systems and C Programming. S
Introduction to the C programming language as a means for controlling embedded and general computing systems. Continuing the exploration begun in course 12, students move to higher levels of abstraction in the control of complex computer systems. Prerequisite(s): courses 12 and 12L. Concurrent enrollment in course 13L is required. G. Elkaim, R. Hughey
13L. Computer Systems and C Programming Lab (2 credits). S
Laboratory sequence in C programming for embedded and general computing systems. Two 2-hour laboratories per week. Concurrent enrollment in course 13 is required. G. Elkaim, R. Hughey
16. Applied Discrete Mathematics. F,W,S
Introduction to applications of discrete mathematical systems. Topics include sets, functions, relations, graphs, trees, switching algebra, first order predicate calculus, mathematical induction, permutations, combinations, summation, and recurrences. Examples drawn from computer science and computer engineering. Prerequisite(s): eligibility to enroll in Mathematics 19A (completion of Mathematics 3 or Mathematics Placement Exam score of 40 or higher) or completion of Mathematics 19A or 11A, or Applied Mathematics and Statistics 11A, or Economics 11A. (General Education Code(s): MF, Q.) J. Garcia-Luna-Aceves, M. Schlag, R. Hughey, T. Larrabee
80A. Universal Access: Disability, Technology, and Society. F,S
Overview of human-centered technology and of its potential for increasing the quality of life and independence of disabled individuals. A substantial portion of the course is devoted to studying physical, psychological, and psychosocial aspects of disability. Topics include: diversity and integration, legislation, accessibility, and universal design. (Formerly Assistive Technology and Universal Access.) (General Education Code(s): PE-T, T7-Natural Sciences or Social Sciences.) S. Kurniawan, R. Manduchi
80E. Engineering Ethics. S
Ethical theories, analysis, and their application to issues in the practice of engineering, such as safety and liability, professional responsibility to clients and employers, codes of ethics, legal obligations, environmental issues, and social issues. Emphasis on developing independent ethical analysis through the use of case studies. (General Education Code(s): PE-T, T6-Natural Sciences or Humanities and Arts.) R. Hughey, The Staff
80H. History of Modern Computing.
Presents a history of the development of computing technologies (CPUs and I/O devices, operating systems, and languages) through the latter half of the 20th century in order to build an understanding of how today's computing environment evolved. (General Education Code(s): T2-Natural Sciences.) D. Pease
80N. Introduction to Networking and the Internet. F,W
Introduction to the evolution, technological basis, and services of the Internet, with descriptions of its underlying communications structure, routing algorithms, peer-to-peer hierarchy, reliability, and packet switching. Network security, mail, multimedia and data compression issues, HTML, and digital images. Students who have completed course 150 cannot receive credit for this course. (General Education Code(s): PE-T, T2-Natural Sciences.) T. Larrabee, A. Varma, K. Obraczka
80U. Ubiquitous and Mobile Computing.
Ubiquitous computing integrates computer and communication technology with day-to-day life. Ubiquitous and mobile technology includes: MP-3 players, camera cell phones, Bluetooth headsets, sensor networks, and new emerging technologies. Course provides an overview of the technology and economics of ubiquitous computing. (General Education Code(s): T2-Natural Sciences.) R. Manduchi
94. Group Tutorial. F,W,S
Provides a means for a small group of students to study a particular topic in consultation with a faculty sponsor. Students submit petition to sponsoring agency. May be repeated for credit. The Staff
94F. Group Tutorial (2 credits). F,W,S
Provides a means for a small group of students to study a particular topic in consultation with a faculty sponsor. Students submit petition to sponsoring agency. May be repeated for credit. The Staff
99. Tutorial. F,W,S
Students submit petition to sponsoring agency. May be repeated for credit. The Staff
99F. Tutorial (2 credits). F,W,S
Students submit petition to sponsoring agency. May be repeated for credit. The Staff
Upper-Division Courses
100. Logic Design. W,S
Boolean algebra, logic minimization, finite-state machine design, sequential circuits, common logic elements, programmable logic devices, and an introduction to system level design. The electrical behavior of circuits including three state outputs, propagation delay, logic levels, and fanout. Prerequisite(s): courses 12 and 12L; previous or concurrent enrollment in course 100L required. Enrollment limited to 60. T. Larrabee, M. Guthaus, S. Petersen, M. Schlag
100L. Logic Design Laboratory (2 credits). W,S
Laboratory sequence illustrating topics covered in course 100. Two 2-hour laboratory sessions per week. Weekly laboratory assignments which require the use of the oscilloscopes, TTL circuits, computer-aided design and simulation tools, and programmable logic. Students are billed a materials fee. Prerequisite(s): courses 12 and 12L; previous or concurrent enrollment in course 100 required. Enrollment limited to 60. T. Larrabee, M. Guthaus, S. Petersen, M. Schlag
107. Probability and Statistics for Engineers. F,W
Introduction to fundamental tools of stochastic analysis. Probability, conditional probability; Bayes Theorem; random variables and transforms; independence; Bernnoulli trials. Statistics, inference from limited data; outcomes of repeated experiments; applications to design; assessment of relative frequency and probability; law of large numbers; precision of measurements. Elements of stochastic processes, Poisson processes; Markov chains. Students cannot receive credit for this course and Applied Mathematics and Statistics 131. (Formerly Mathematical Methods of Systems Analysis: Stochastic.) Prerequisite(s): course 16 or 16H and Mathematics 22 or 23A. (General Education Code(s): SR.) A. Brandwajn, R. Manduchi
108. Data Compression. W
Basics of information theory, lossless coding (Huffman coding, arithmetic coding, dictionary coding), lossy coding (PCM, predictive coding, transform coding). Application to the compression of specific data set, which may include biological time series, DNA sequences, and multimedia streams. Programming experience is required. Prerequisite(s): course 107 or Applied Mathematics and Statistics 131. R. Manduchi
110. Computer Architecture. W
Introduction to computer architecture including examples of current approaches and the effect of technology and software. Computer performance evaluation, basic combinatorial and sequential digital components, different instruction set architectures with a focus on the MIPS ISA and RISC paradigm. Evolution of CPU microarchitecture from single-cycle to multi-cycle pipelines, with overview of super-scalar, multiple-issue and VLIW. Memory system, cache, virtual memory and relationship between memory and performance. Evolution of PC system architecture. May include advanced topics, such as parallel processing, MIMD, and SIMD. Prerequisite(s): courses 12/L, and courses 13/L or Computer Science 12A/L or Computer Science 11. Course 16 recommended. A. Di Blas, R. Hughey, J. Renau Ardevol, A. Brandwajn, F. Ferguson
112. Computer and Game Console Architecture.
Introduces computer and game console architecture, including examples of current approaches and the effect of technology and software. Computer performance evaluation; instruction-set architectures; RISC CPU and pipelining; cache and memory; multi-core, system-level architecture; video card; special console architectures. Pre-requisite(s): course 12. A. Di Blas
113. Parallel and Concurrent Programming.
Introduction to parallel and concurrent programming. Topics include: types of parallel computers and programming platforms; design, implementation, and optimization of programs for parallel and multicore processors; basic and advanced programming techniques; performance analysis and load balancing; and selected parallel algorithms. (Also offered as Computer Science 113. Students cannot receive credit for both courses.) Prerequisite(s): Computer Engineering 12 and 12L and Computer Science 101. Computer Engineering 110 or 112 recommended. R. Hughey, A. Di Blas
115. Introduction to Solid Mechanics. S
Introduces the solid mechanics of materials. Topics include: stress and strain, torsion, bending of beams, shearing stresses in beams, compound stresses, principal stresses, deflections of beams, and statically indeterminate members and columns. Prerequisite(s): course 9 and Mathematics 19B, and Applied Mathematics and Statistics 10 or Mathematics 21. J. Rosen, W. Dunbar
118. Introduction to Mechatronics. W
Technologies involved in mechatronics (intelligent electro-mechanical systems) and techniques necessary to integrate these technologies into mechatronic systems. Topics include electronics (A/D, D/A converters, opamps, filters, power devices), software program design (event-driven programming, state machine-based design), DC and stepper motors, basic sensing, and basic mechanical design (machine elements and mechanical CAD). Combines lab component of structured assignments with a large and open-ended team project. Cannot receive credit for this course and course 218. Prerequisite(s): Electrical Engineering 101/L and courses 12/L and 100/L. Concurrent enrollment in course 118L is required. Enrollment limited to 36. G. Elkaim
118L. Introduction to Mechatronics Laboratory (2 credits). W
Laboratory sequence illustrating topics covered in course 118. Two 2-hour laboratory sessions per week. Taught in conjunction with course 218L. Students are billed a materials fee. Cannot receive credit for this course and course 218L. Prerequisite(s): Concurrent enrollment in course 118 is required. Enrollment limited to 36. G. Elkaim
121. Microprocessor System Design. F,S
The design and use of microprocessor-based systems. Covers microprocessor and microcontroller architecture, programming techniques, bus and memory organization, DMA, timing issues, interrupts, peripheral devices, serial and parallel communication, and interfacing to analog and digital systems. Prerequisite(s): courses 12/L and 100/L and Electrical Engineering 101/L; previous or concurrent enrollment in course 121L required. Enrollment limited to 40. P. Chan, S. Petersen, R. Hughey
121L. Microprocessor System Design Laboratory (2 credits). F,S
Laboratory sequence illustrating topics covered in course 121. Two 2-hour laboratory sessions per week. Students design, build, program, debug, document, and demonstrate a microprocessor-based system. Students are billed a materials fee. Prerequisite(s): courses 12/L and 100/L and Electrical Engineering 101/L. Previous or concurrent enrollment in course 121 also required. Enrollment limited to 40. P. Chan, S. Petersen, R. Hughey
123A. Engineering Design Project I. W
First of a two-course sequence that is the culmination of the engineering program. Students apply knowledge and skills gained in elective track to complete a major design project. Students complete research, specification, planning, and procurement for a substantial project. Includes technical discussions, design reviews, and formal presentations; engineering design cycle, engineering teams, and professional practices. Formal technical specification of the approved project is presented to faculty. Prerequisite(s): Computer Engineering 121; previous or concurrent enrollment in Computer Engineering 185; permission of department and instructor. Students are billed a materials fee. (General Education Code(s): PR-E.) P. Chan, K. Karplus, P. Mantey, Petersen, J. Vesecky, J. Renau Ardevol
123B. Engineering Design Project II (7 credits). S
Second of two-course sequence in engineering system design. Students fully implement and test system designed and specified in course 123A. Formal written report, oral presentation, and demonstration of successful project to review panel of engineering faculty required. Students are billed a materials fee. Prerequisite(s): courses 123A and 185. Enrollment limited to 35. P. Chan, K. Karplus, P. Mantey, Petersen, J. Vesecky, J. Renau Ardevol
125. Logic Design with Verilog. F
Verilog digital logic design with emphasis on ASIC and FPGA design. Students design and verify large-scale systems. Assignments and project use the Verilog Hardware Description Language with emphasis on verification and high-frequency ASIC/FPGA targets. Prerequisite(s): courses 100 and 100L. Concurrent enrollment in course 125L required. Enrollment limited to 40. P. Chan, A. Varma, M. Guthaus, J. Renau Ardevol, M. Schlag
125L. Logic Design with Verilog Laboratory (2 credits). F
Laboratory sequence illustrating topics covered in course 125. Two 2-hour laboratory sessions per week. Students are billed a materials fee. Prerequisite(s): courses 100 and 100L. Concurrent enrollment in course 125 is required. Enrollment limited to 40. P. Chan, A. Varma, M. Guthaus, J. Renau Ardevol, M. Schlag
131. Human-Computer Interaction. W
Theory and hands-on practice to understand what makes user interfaces usable and accessible to diverse individuals. Covers human senses and memory and their design implications, requirement solicitation, user-centered design and prototyping techniques, and expert and user evaluations. Interdisciplinary course for social science and engineering majors. Students cannot receive credit for this course and Computer Engineering 231 or Digital Arts and New Media 231. Prerequisite(s): Computer Science 12B. S. Kurniawan
150. Introduction to Computer Networks. F,W
Addresses issues arising in organizing communications among autonomous computers. Network models and conceptual layers; Internet-working; characteristics of transmission media; switching techniques (packet switching, circuit switching, cell switching); medium access control (MAC) protocols and local area networks; error-control strategies and link-level protocols; routing algorithms for bridges and routers; congestion control mechanisms; transport protocols; application of concepts to practical wireless and wireline networks and standard protocol architectures. Students who have completed course 80N can take this course for credit. Students are billed for a materials fee. Prerequisite(s): course 16 and either courses 12 and 12L, or Computer Science 12B and 12M. Concurrent enrollment in course 150L is required. J. Garcia-Luna-Aceves, P. Mantey, K. Obraczka, B. Smith, A. Varma
150L. Introduction to Computer Networks Laboratory (2 credits). F,W
Illustrates the concepts covered in course 150 and provides students with hands-on experience in computer networks. Prerequisite(s): course 16 and either courses 12 and 12L, or Computer Science 12B and 12M. Concurrent enrollment in course 150 is required. J. Garcia-Luna-Aceves, P. Mantey, K. Obraczka, B. Smith, A. Varma
151. Advanced Computer Networks. S
Provides an in-depth coverage of fundamental topics introduced in course 150 including routing, transport, and internetworking. Also introduces advanced concepts not covered in course 150 including wireless, application-layer services, security, etc. (Formerly Network Administration.) Prerequisite(s): course 150. Concurrent enrollment in course 151L is required. Enrollment limited to 60. K. Obraczka, B. Smith
151L. Advanced Computer Networks Laboratory (2 credits). S
Laboratory illustrating the concepts covered in course 151: provides students with hands-on experience in computer networks. Prerequisite(s): course 150/L. Concurrent enrollment in course 151 is required. Enrollment limited to 30. K. Obraczka, B. Smith
153. Digital Signal Processing.
Introduction to the principles of signal processing, including discrete-time signals and systems, the z-transform, sampling of continuous-time signals, transform analysis of linear time-invariant systems, structures for discrete-time systems, the discrete Fourier transform, computation of the discrete Fourier transform, and filter design techniques. Taught in conjunction with Electrical Engineering 250. Students cannot receive credit for this course and Electrical Engineering 250. (Also offered as Electrical Engineering 153. Students cannot receive credit for both courses.) Prerequisite(s): Electrical Engineering 103. P. Mantey
156. Network Programming. W
Methods and tools used for network programming. Topics include inter-process communication (IPC), facilities such as pipes, shared memory, semaphores, sockets, and remote procedure call (RPC); design of client and server sides of network applications; CGI programming; and programming projects. Prerequisites: course 150 and Computer Science 111. Concurrent enrollment in course 156L required. A. Varma, K. Obraczka
156L. Network Programming Laboratory (2 credits). W
Laboratory sequence illustrating concepts taught in course 156. Learn use of network programming tools and methods via programming exercises. Students are billed a materials fee. Prerequisites: course 150 and Computer Science 111. Concurrent enrollment in course 156 required. A. Varma, K. Obraczka
167. Sensing and Sensor Technologies. W
Introduces the fundamental issues in sensing and various sensor technologies including motion sensors, velocity sensors, GPS sensors, acoustic sensors, light and image sensors, and range sensors. Also demonstrates sensor technologies using a system approach to show how they can be integrated into a complete digital system. Prerequisite(s): Electrical Engineering 103. Concurrent enrollment in course 167L is required. G. Elkaim, R. Manduchi
167L. Sensing and Sensor Technologies Lab (2 credits). W
Lab assignments reinforce the concepts and techniques learned in course 167. Assignments include measurement and estimation techniques, experiments with various sensors, and a course project in which students build digital sensing systems. Students are billed a materials fee. Prerequisite(s): Electrical Engineering 103. Concurrent enrollment in course 167 is required. G. Elkaim, R. Manduchi
173. High-Speed Digital Design. S
Studies of analog circuit principles relevant to high-speed digital design: signal propagation, crosstalk, and electromagnetic interference. Topics include electrical characteristics of digital circuits, interfacing different logic families, measurement techniques, transmission lines, ground planes and grounding, terminations, power systems, connectors/ribbon cables, clock distribution, shielding, electromagnetic compatibility and noise suppression, and bus architectures. Prerequisite(s): Electrical Engineering 101/L and course 174. Electrical Engineering 171 and course 121 recommended. Previous or concurrent enrollment in course 173L required. Enrollment limited to 30. P. Chan, S. Petersen
173L. High-Speed Digital Design Laboratory (2 credits). S
Laboratory sequence illustrating topics covered in course 173. One two-hour laboratory session per week. Students are billed a materials fee. Prerequisite(s): Electrical Engineering 101/L and course 174. Electrical Engineering 171 and course 121 recommended. Previous or concurrent enrollment in course 173 required. Enrollment limited to 30. P. Chan, S. Petersen
174. Introduction to EDA Tools for PCB Design (3 credits). F
Focus on EDA tools for design of printed-circuit boards. Elements of design flow covered: schematic capture and simulation to final PCB layout. Final project is required. Students are billed a materials fee. Prerequisite(s): Electrical Engineering 101/L or consent of instructor. S. Petersen
177. Applied Graph Theory and Algorithms.
Basic concepts and algorithms are reviewed including trees, Eulerian and Hamiltonian graphs, and graph transversal. Algorithms are explored to solve problems in connectivity, routing, matching, and embedding of graphs. Graph theory and algorithms are developed around applications in computer engineering. Prerequisite(s): Computer Science 101. M. Schlag
185. Technical Writing for Computer Engineers. F,W
Writing by engineers and computer scientists, not to general audiences, but to engineers, engineering managers, and technical writers. Exercises include job application and resume, in-code documentation, algorithm description, naive-user documentation, library puzzle, survey article, proposal, progress report, formal technical report, and oral presentation. Offered in alternate quarters. Enrollment restricted to majors in Computer Engineering, Electrical Engineering, Bioengineering, Bioinformatics, Robotics Engineering, or Network and Digital Technology, or by permission of instructor. Prerequisite(s): satisfaction of Entry Level Writing and Composition requirements; and Computer Science 12B or Computer Engineering 12. Enrollment limited to 60. (General Education Code(s): W.) T. Larrabee, G. Moulds
193. Field Study. F,W,S
Provides for individual programs of study with specific academic objectives carried out under the direction of a faculty member of the Computer Engineering Department and a willing sponsor at the field site using resources not normally available on campus. Credit is based on the presentation of evidence of achieving the objectives by submitting a written and oral presentation. May not be repeated for credit. Students submit petition to sponsoring agency. The Staff
193F. Field Study (2 credits). F,W,S
Provides for individual programs of study with specific academic objectives carried out under the direction of a faculty member of the Computer Engineering Department and a willing sponsor at the field site using resources not normally available on campus. Credit is based on the presentation of evidence of achieving the objectives by submitting a written and oral presentation. May not be repeated for credit. Students submit petition to sponsoring agency. The Staff
194. Group Tutorial. F,W,S
A program of independent study arranged between a group of students and a faculty member. Students submit petition to sponsoring agency. May be repeated for credit. The Staff
194F. Group Tutorial (2 credits). F,W,S
A program of independent study arranged between a group of students and a faculty member. Students submit petition to sponsoring agency. May be repeated for credit. The Staff
195. Senior Thesis Research. F,W,S
Students submit petition to sponsoring agency. Prerequisite: course 123A. The Staff
195F. Senior Thesis Research (2 credits). F,W,S
Students submit petition to sponsoring agency. Consent of instructor required. Prerequisite: course 123A. The Staff
198. Individual Study or Research. F,W,S
Students submit petition to sponsoring agency. May be repeated for credit. The Staff
198F. Individual Study or Research (2 credits). F,W,S
Students submit petition to sponsoring agency. May be repeated for credit. The Staff
199. Tutorial. F,W,S
For fourth-year students majoring in computer engineering. Students submit petition to sponsoring agency. May be repeated for credit. The Staff
199F. Tutorial (2 credits). F,W,S
For fourth-year students majoring in computer engineering. Students submit petition to sponsoring agency. May be repeated for credit. The Staff
Graduate Courses
200. Research and Teaching in Computer Science and Engineering (3 credits). F
Basic teaching techniques for teaching assistants including responsibilities and rights of teaching assistants, resource materials, computer security, leading discussion or lab sessions, presentation techniques, maintaining class records, electronic handling of homework, and grading. Examines research and professional training, including use of the library and online databases, technical typesetting, writing journal and conference papers, publishing in computer science and computer engineering, giving talks in seminars and conferences, and ethical issues in science and engineering. Required for all T.A.s. Enrollment restricted to graduate students. T. Larrabee, S. Brandt, J. Renau Ardevol, M. Schlag, A. Brandwajn
202. Computer Architecture. W
Provides a thorough and fundamental treatment of the art of computer architecture. Topics include concepts of von Neumann architectures, methods of evaluating CPU performance, instruction-set design and examples, compiler issues, instruction pipelining, superscalar processors, methods for reduction of branch penalty, memory hierarchies, I/O systems, floating-point arithmetic, and current issues in parallel processing. Prerequisite(s): course 110 or 112. Enrollment restricted to graduate students; undergraduates may enroll if they have completed course 110 or 112 and with consent of instructor. Enrollment limited to 30. P. Chan, J. Renau Ardevol, A. Varma, R. Hughey
215. Models of Robotic Manipulation. S
Theory and application of mathematical models to analyze, design, and program serial kinematic chains (robot arms). Covers models of arbitrary articulated robotic or biological arms and their application to realistic arms and tasks, including the homogeneous coordinate model of positioning tasks; the forward and inverse kinematic models; the Jacobian matrix; trajectory generation;and dynamic models, including Newton-Euler and Lagrangian formulations. Enrollment restricted to graduate students; and to seniors who have taken electrical engineering 154, and applied mathematics and statistics 10 or 10A or mathematics 21; or by permission of instructor. J. Rosen
218. Mechatronics. W
Introduction to intelligent electro-mechanical systems, combining aspects of computer, electrical, mechanical, and software engineering. Students become proficient in all aspects of mechanical, electrical, computer system design, analysis, prototyping, presentation and team mentorship. Cannot receive credit for this course and course 118. Prerequisite(s): concurrent enrollment in course 218L. Enrollment restricted to graduate students. Enrollment limited to 36. G. Elkaim
218L. Mechatronics Lab (2 credits). W
Laboratory sequence illustrating topics covered in course 218. Two 2-hour laboratory sessions per week. Cannot receive credit for this course and course 118L. Students are billed a materials fee. Prerequisite(s): concurrent enrollment in course 218. Enrollment restricted to graduate students. Enrollment limited to 36. G. Elkaim
220. Advanced Parallel Processing.
Introduction to programming advanced parallel computer architecture. Topics may include: SIMD massively parallel processor arrays; streaming parallel coprocessors, such as graphics cards used for general-purpose processing (GPGPU); or other hybrid MIMD/SIMD architectures. Course has programming lab component, a project, and student presentation on related topics. (Formerly Parallel Processing.) Enrollment restricted to graduate students; undergraduates may enroll with permission of instructor. R. Hughey, A. Di Blas
221. Advanced Microprocessor Design.
Introduction to latest advances in computer architecture. Focuses on processor core design. Topics include simultaneous multithreading, thread level speculation, trace caches, novel out-of-order mechanisms, and energy-efficient processor core designs. Final project is modification/enhancement of an out-of-order processor on an FPGA development system. Prerequisite(s): course 202; and course 125, 225, or equivalent Verilog experience. Concurrent enrollment in course 221L required. Enrollment restricted to graduate students. Enrollment limited to 20. J. Renau Ardevol
221L. Advanced Microprocessor Design Laboratory (3 credits).
Laboratory sequence illustrating topics covered in course 221. Prerequisite(s): course 202; and course 125, 225, or equivalent Verilog experience. Concurrent enrollment in course 221 required. Enrollment restricted to graduate students. Enrollment limited to 20. J. Renau Ardevol
222. VLSI Digital System Design. F
Introduction to Very Large Scale Integrated (VLSI) design, focusing on custom integrated circuits. Topics include logic families, FETs, interconnect models, simulation, and RC timing. Course covers the design flow from logic design to layout, with a focus on high performance and low power. Students should be familiar with RC circuit analysis. Enrollment restricted to seniors and graduate students. Undergraduates may enroll with permission of instructor. M. Guthaus, The Staff
223. VLSI System-on-a-Chip Design. W
Design methodologies for Application Specific Integrated Circuits (ASICs). Topics include: behavioral specification; logic synthesis; standard-cell libraries; advanced timing analysis; and physical design automation tools. Familiarizes students with real-world tools during the design of a small system-on-a-chip project. Students are encouraged to fabricate and test their chips in an independent study. Prerequisite(s): course 222 or permission of instructor. Enrollment restricted to graduate students. M. Guthaus, The Staff
224. Testing Digital Circuits.
An introduction to the theory and practice of testing. Topics are chosen from fault and defect models, test generation for combinational and sequential circuits, fault simulation, scan-design and built-in self-test. Enrollment restricted to graduate students; undergraduates may enroll if they have completed Computer Science 101. F. Ferguson, T. Larrabee
225. Introduction to ASIC Systems Design.
Introduces reconfigurable computing systems with emphasis on field-programmable devices. Topics include: architectures of field-programmable devices; novel reconfigurable systems; and hardware algorithms. Enrollment restricted to computer engineering graduate students. Enrollment limited to 10. Offered in alternate academic years. P. Chan
229. Field-Programmable Gate Arrays Computer-Assisted Design.
Design methods for Field-Programmable Gate Arrays (FGPAs), including algorithms for technology mapping, routability estimation, placement, and routing. The relationship between FPGA architectures and their computer-aided design tools. Course project involves the modification and analysis of an FPGA tool. Enrollment restricted to graduate students or by consent of instructor. Courses 100, 125, 126, 222, 225, or other digital design experience recommended. Enrollment limited to 20. M. Schlag
230. Computer Performance Evaluation. F
Introduction to methods of analysis of computer system performance. Predictive performance models with emphasis on queuing models; exact and appropriate solution methods, discrete-event simulation, and numeric iterative approaches; analytical solutions and their computation; separable queuing networks, decomposition approaches; examples of practical application; and performance measurement, model validation, robustness of models, and operational analysis. Enrollment restricted to graduate students. Enrollment limited to 20. Offered in alternate academic years. A. Brandwajn
231. Human-Computer Interaction. W
Theory and hands-on practice to understand what makes user interfaces usable and accessible to diverse individuals. Covers human senses and memory and their design implications, requirement solicitation, user-centered design and prototyping techniques, and expert and user evaluations. Individual research project. Interdisciplinary course for art, social science and engineering graduate students. Students cannot receive credit for this course and course 131. (Also offered as Digital Arts and New Media 231. Students cannot receive credit for both courses.) Enrollment restricted to graduate students. S. Kurniawan
232. Arithmetic Processors.
Concept of number systems: binary additions, multiplications, divisions; elementary function evaluations; algorithm acceleration; floating-point and significant arithmetics; IEEE standards; technology related issues; algorithm evaluation by implementation with gate arrays. Prerequisite(s): course 202. Enrollment restricted to graduate students. Enrollment limited to 15. P. Chan
233. Human Factors.
Course focuses on theories, practices, and design of systems to optimize human well-being and system performance through consideration of psychological, social, physical, and biological factors. Covers human sensory systems and memory, workload management, error and reliability, performance measurement, and ergonomic design. Interdisciplinary course for social science and engineering graduate students. Enrollment restricted to graduate students; undergraduates may enroll if they have completed course 131. S. Kurniawan
235. User Evaluation of Technology. F
Presents a variety of evaluation methodologies to assess usability, acceptance, and effectiveness of technology with the intended users. Combines lectures and exercises for students to gain firsthand experiences of these methodologies with real users. Enrollment restricted to graduate students. Seniors may enroll with completion of course 131. S. Kurniawan
240. Introduction to Linear Dynamical Systems. W
Introduction to applied linear algebra and linear dynamical systems with applications to circuits, signal processing, communications, and control systems. Topics include the following: Least-squares approximations of over-determined equations and least-norm solutions of underdetermined equations. Symmetric matrices, matrix norm and singular value decomposition. Eigenvalues, left and right eigenvectors, and dynamical interpretation. Matrix exponential, stability, and asymptotic behavior. Multi-input multi-output systems, impulse and step matrices; convolution and transfer matrix descriptions. Control, reachability, state transfer, and least-norm inputs. Observability and least-squares state estimation. Enrollment restricted to graduate students; undergraduates may enroll if they have completed Electrical Engineering 103 and Applied Math and Statistics 147. G. Elkaim, W. Dunbar, K. Ross
241. Introduction to Feedback Control Systems. F
Graduate-level introduction to control of continuous linear systems using classical feedback techniques. Design of feedback controllers for command-following error, disturbance rejection, stability, and dynamic response specifications. Root locus and frequency response design techniques. Extensive use of Matlab for computer-aided controller design. Course has concurrent lectures with Electrical Engineering 154. (Also offered as Electrical Engineering 241. Students cannot receive credit for both courses.) Enrollment restricted to graduate students. P. Milanfar, P. Mantey, J. Rosen, W. Dunbar, G. Elkaim
242. Applied Feedback Control. S
Sequel to Electrical Engineering 154. After reviewing control design techniques examined in EE 154, this course explores state space control, discrete time control, and two case studies in control design. Students design and implement feedback controllers on an inverted pendulum experiment. Prerequisite(s): Electrical Engineering 154 or course 241. Enrollment restricted to juniors, seniors, and graduate students. P. Mantey, W. Dunbar, G. Elkaim
243. System Identification.
Course provides introduction to the construction of linear dynamical models from experimental data using parametric and non-parametric identification techniques. Theoretical and practical aspects of these techniques addressed. Prerequisite(s): course 240, or by permission of instructor. W. Dunbar, G. Elkaim
248. Games in Design and Control.
Graduate-level introduction to game theory and its applications to system design, verification, analysis, and optimal control. Enrollment restricted to graduate students. Computer Science 101, 201, or equivalent recommended. The Staff
250. Multimedia Systems.
Study of state-of-the-art technology for networked multimedia systems. Topics include audio, image, and video acquisition and compression standards (JPEG, MPEG, and ITU families); networking for multimedia; and digital television. Proficiency in C or C++ required. Prerequisite(s): Enrollment restricted to graduate students. R. Manduchi
251. Error-Control Coding. F
Overview of coding to protect messages against error during transmission or storage. Topics include channel models, linear algebra over finite fields, linear block codes and bounds, cyclic codes (BCH and RS), decoding algorithms, spectral analysis, codes on graphs, and low-complexity algorithms. Enrollment restricted to graduate students or consent of instructor. H. Sadjadpour
252A. Computer Networks. F
Issues resulting from organizing communication among autonomous computers. Includes network models and switching techniques; medium access control protocols and local area networks; error control and retransmission strategies; routing algorithms and protocols; congestion control mechanisms and end-to-end protocols; application-level protocols; and application of concepts to wireless and wireline networks, with emphasis on the Internet. Enrollment restricted to graduate students. A. Varma, J. Garcia-Luna-Aceves
252B. Principles of Computer Communication.
Theory and practice of computer communication networks. Emphasis is on verification and performance analysis of network control processes. Topics include protocols for channel access, point-to-point and multipoint reliable transmission, routing, congestion control, network management, multicasting, and ATM networks. (Formerly Modeling of Communications Protocols.) Prerequisite(s): courses 107 and 252A. J. Garcia-Luna-Aceves
253. Network Security.
Fundamental mechanisms for network security and their application in widely deployed protocols. In-depth treatment of security mechanism at the data-link, network, and transport layers for both wired and wireless networks. Covers mechanisms for privacy and integrity, and methods for intrusion detection. Prerequisite(s): course 252A and Computer Science 201. Enrollment restricted to graduate students. A. Varma
254. High Speed Computer Networks. W
Fiber-optic technology; fiber-optic link design; network protocol concepts; coding and error control; high-speed local area and metropolitan area networks; gigabit networks; error and congestion control; photonic networks; research topics. Prerequisite(s): course 252B. A. Varma
256. Design Project in Computer Networks.
Students develop a working implementation of a network protocol with the goal of obtaining hands-on experience in implementing real-world network protocols. Prerequisite(s): course 252A; enrollment restricted to graduate students. A. Varma
257. Wireless and Mobile Networks. S
An interdisciplinary course on wireless communication and mobile computing. Covers the physical aspects of wireless communication but emphasizes higher protocol layers. Topics include cellular networks, packet radio and ad hoc networks, wireless transport protocols, security, and application-level issues. Prerequisite(s): course 252A or permission of instructor. Enrollment limited to 20. K. Obraczka, J. Garcia-Luna-Aceves
258. Unix Networking Internals.
In-depth treatment of the implementation of network protocols in typical open-source Unix systems. Topics include implementation of send and receive functions, buffer management, interrupt handling, locking, scheduling and timer management. Major implementation project required. Prerequisite(s): course 252A. Computer Science 111 recommended. Enrollment restricted to graduate students. A. Varma
259. Sensor Networks. F
Focus is on the networking aspects of sensor networks: protocols at the various layers and how they answer the specific requirements posed by these networks (e.g., data driven, energy efficient, etc.) and their applications (monitoring, tracking, etc.). Explore how physical layer and hardware issues may influence protocol design. Courses 252A and 257 recommended. K. Obraczka
263. Data Compression. W
Introduction to information theory and data compression. Lossless coding (Huffman, arithmetic, dictionary codes). Lossy coding (scalar and vector quantization, differential coding, transform coding). Applications to the compression of real data sets (DNA sequences, biological time series, multimedia streams). Concurrent lectures with course 108. Students cannot receive credit for both this course and course 108. Students must have basic knowledge of probability theory. Enrollment restricted to graduate students. R. Manduchi
264. Image Analysis and Computer Vision. W
Brief review of image processing. Binary images, thresholding, morphological operations; edge detection and segmentation; contours: digital curves and curve fitting; statistical texture analysis, shape from texture; depth cues, stereo matching, depth from stereo; color perception and segmentation; and shading and image radiance, surface orientation, and shape from shading. Electrical Engineering 264 encouraged, but not required. Undergraduate students who are interested in enrolling should meet with the instructor first. R. Manduchi
276. Software Engineering.
Introduction to the general principles of software engineering. Covers current and classical topics from both practical and theoretical viewpoints. Topics include software evolution, project management, software inspections, design methods, requirements analysis and specification, software testing, maintenance, software implementation, human interfaces, and software engineering experimentation. Enrollment restricted to graduate students; undergraduates may enroll in this course if they have completed Computer Science 115. The Staff
277. Graph Algorithms. S
Explores graph theory and algorithms for solving problems in engineering. A review of basic graph concepts and algorithms is followed by topics in network flow, partitioning, spectral analysis of graphs, graph isomorphism, and intractability. Prerequisite(s): Computer Science 101 and 102; or course 177; or Computer Science 201; or equivalent. Enrollment restricted to graduate students. Enrollment limited to 20. M. Schlag
280C. Seminar on Control (2 credits). F,W,S
Weekly seminar series covering topics of current research in theory and application of control to engineering systems. Current research work and literature in these areas discussed. Enrollment restricted to graduate students; undergraduates may enroll with permission of instructor. May be repeated for credit. G. Elkaim, J. Rosen, W. Dunbar, K. Ross
280G. VLSI/CAD Seminar (2 credits). F,W,S
Weekly seminar on advanced topics in VLSI and computer-aided design (CAD). Students present and discuss modern issues in semiconductor design, fabrication, and CAD. Frequent guest speakers present pertinent results from industry and academia. Enrollment limited to 20. May be repeated for credit. M. Guthaus
280N. Seminar on Networks (2 credits). F,W,S
Weekly seminar series covering topics of current research in networks and networked systems. Current research work and literature in these areas are discussed. Prerequisite(s): permission of instructor. Enrollment restricted to graduate students. May be repeated for credit. K. Obraczka, J. Garcia-Luna-Aceves
280P. Seminar on Parallel Processing (2 credits). F,W,S
Weekly seminar series covering topics of current research in parallel systems, architectures, and algorithms. Current research work and literature in these areas are discussed. Enrollment restricted to graduate students. Enrollment limited to 20. May be repeated for credit. R. Hughey, M. Guthaus, J. Renau Ardevol
280T. Seminar on New Technologies (2 credits).
Weekly seminar series in which distinguished speakers from industry, universities, and government discuss current developments in networking and computer technology. The emphasis is on open research questions that may lead to collaborative work with faculty and graduate students. The Staff
280V. Seminar on Computer Vision (2 credits). F,W,S
Weekly graduate-level seminar series discussing advanced topics in computer vision and image analysis. Current research and literature presented during each meeting. Enrollment limited to 20. May be repeated for credit. R. Manduchi
285. Technical Writing for Engineering Graduates.
Writing skills development for graduate engineers. Students produce a major writing project with many subtasks. Exercises includes fellowship application; mathematical and algorithmic description; use of tables and graphs; experiment description; and producing technical web sites, presentations, and posters. Enrollment restricted to graduate biomolecular engineering, computer engineering, computer science, and electrical engineering majors. (Open to all School of Engineering graduate students.) Enrollment limited to 20. T. Larrabee, The Staff
290L. Advanced Topics in VLSI Computer-Aided Design.
A graduate course on a research topic in VLSI computer-aided design. Topic varies according to instructor. Possible topics include, but are not limited to specification languages and formal verification, logic minimization, testing and verification, electrical simulation, layout synthesis, and behavioral synthesis. Course 100, 125, 126, 222, or 225 recommended. P. Chan, M. Schlag, F. Ferguson, T. Larrabee
290M. Topics in Parallel Computation.
Investigates selected topics in applied parallel computation. Topics may include numerical methods, artificial intelligence and machine learning algorithms, graphics and image processing, systolic algorithms, and the interplay between hardware and algorithms. Students are encouraged to investigate and discuss the parallelization of their own research. Enrollment restricted to graduate students. R. Hughey
290N. Topics in Computer Performance.
Selected topics of current interest in the area of computer system performance. Subjects may include aspects of large systems, performability, computer networks, storage subsystems, and nontraditional approaches and are subject to periodic revision. Enrollment restricted to graduate students. A. Brandwajn
290V. Advanced Topics in Visual Computing.
Advanced course in image analysis and computer vision. Topics include motion analysis, multiple view geometry, 3D reconstruction, image-based rendering, vision-based graphics, face detection and recognition, tracking, image and video retrieval, and human-computer interface. Enrollment restricted to seniors and graduate students. Enrollment limited to 20. S. Lodha, R. Manduchi
293. Advanced Topics in Computer Engineering.
A graduate seminar on a research topic in computer engineering which varies according to instructor. Possible topics include, but are not limited to, communication networks, data compression, special-purpose architectures, computer arithmetic, software reliability and reusability, systolic arrays. J. Rosen
297. Independent Study or Research. F,W,S
Independent study or research under faculty supervision. Students submit petition to sponsoring agency. The Staff
299. Thesis Research. F,W,S
Thesis research conducted under faculty supervision. Students submit petition to sponsoring agency. The Staff
299F. Thesis Research (2 credits). F,W,S
Independent study or research under faculty supervision. Enrollment restricted to graduate students. Recommended for part-time students. Students submit petition to sponsoring agency. May be repeated for credit. The Staff
Revised: 8/13/12
