UC Davis General Catalog, 2006-2008 - General Catalog - UC Davis

Engineering: Electrical and Computer Engineering 243
CAD tools, and case studies. A MEMS design
project is required. The designs will be fabricated in
a commercial foundry and tested in course 244B.
Offered in alternate years.—(I.)
244B. Design of Microelectromechanical
Systems (MEMS) (1)
Laboratory—3 hours. Prerequisite: course 244A.
Testing of surface micromachined MEMS devices
including post-processing, design of test fixtures and
test methodology, measurements, and data analysis.
(S/U grading only.) Offered in alternate years.—(III.)
245. Applied Solid-State Physics (3)
Lecture—3 hours. Prerequisite: course 140A and
Physics 115A. Physics of solids relevant to device
applications. Topics include atomic structure of solids,
quantum theory of electronic and vibrational
states in crystals and heterostructures, electron
dynamics, and quantum transport theory.—(II.)
246. Advanced Projects in IC Fabrication (3)
Discussion—1 hour; laboratory—6 hours. Prerequisite:
course 146B. Individualized projects in the fabrication
of analog or digital integrated circuits.
Offered in alternate years.—II.
247. Advanced Semiconductor Devices (3)
Lecture—3 hours. Prerequisite: course 240. Physics
of various semiconductor devices, including metaloxide-semiconductor
field-effect transistors (MOS-
FETs), IMPATT and related transit-time diodes, transferred-electron
devices, light-emitting diodes,
semiconductor lasers, photodetectors, and solar
cells. Offered in alternate years.—(II.)
249. Microfabrication (3)
Lecture—3 hours. Prerequisite: course 140B. Theory
and practices of several major technologies of microfabrication,
used for producing integrated circuits,
sensors, and microstructures. Major topics include
sputtering, chemical vapor deposition, plasma processing,
micromachining, and ion implantation.
Offered in alternate years.—III.
250. Linear Systems and Signals (4)
Lecture—4 hours. Prerequisite: course 150A. Mathematical
description of systems. Selected topics in linear
algebra. Solution of the state equations and an
analysis of stability, controllability, observability,
realizations, state feedback and state estimation.
Discrete-time signals and systems, and the Z-transform.—I.
(I.)
251. Nonlinear Systems (3)
Lecture—3 hours. Prerequisite: course 250. Nonlinear
differential equations, second-order systems,
approximation methods, Lyapunov stability, absolute
stability, Popov criterion, circle criterion, feedback
linearization techniques. Offered in alternate
years.—(III.)
252. Multivariable Control System Design
(3)
Lecture—3 hours. Prerequisite: course 250. Review
of single-loop feedback design. Stability, performance
and robustness of multivariable control systems.
LQG design. H- design. Frequency response
methods. Optimization-based design.—III.
253. Adaptive Systems (3)
Lecture—3 hours. Prerequisite: course 150B; course
250 (may be taken concurrently.) Theory and practice
of adaptive systems. Concepts of learning and
adaptation. Structure of adaptive filters and the
related parameter adaptive algorithms. Applications
to system identification, adaptive signal processing,
and adaptive control. Offered in alternate years.—
(II.)
254. Optimization (3)
Lecture—3 hours. Prerequisite: Mathematics 22A,
knowledge of FORTRAN or C. Modeling optimization
problems in engineering design and other applications;
optimality conditions; unconstrained
optimization (gradient, Newton, conjugate gradient
and quasi-Newton methods); duality and Lagrangian
relaxation constrained optimization. (Primal method
and an introduction to penalty and augmented
Lagrangian methods.) Offered in alternate years.—
II.
255. Robotic Systems (3)
Lecture—3 hours. Introduction to robotic systems.
Mechanical manipulators, kinematics, manipulator
positioning and path planning. Dynamics of manipulators.
Robot motion programming and control algorithm
design. Offered in alternate years.—(II.)
Gundes
260. Random Signals and Noise (4)
Lecture—3 hours; discussion—1 hour. Prerequisite:
Statistics 120, course 150A; course 250 recommended.
Random processes as probabilistic models
for signals and noise. Review of probability, random
variables, and expectation. Study of correlation function
and spectral density, ergodicity and duality
between time averages and expected values, filters
and dynamical systems. Applications.—II. (II.)
261. Signal Processing for Communications
(4)
Lecture—4 hours. Prerequisite: course 165, 260 or
consent of instructor. Signal processing in wireless
and wireline communication systems. Characterization
and distortion of wireless and wireline channels.
Channel equalization and maximum likelihood
sequence estimation. Channel precoding and preequalization.
OFDM and transmit diversity. Array
processing. Offered in alternate years.—III.
262. Multi-Access Communications Theory
(4)
Lecture—3 hours; project. Prerequisite: Statistics 120
or equivalent; course 173A or Engineering Computer
Science 152A. Maximum stable throughput of
Poisson collision channels. Classic collision resolution
algorithms. Carrier sensing multiple access and
its performance analysis. System stability analysis.
Joint design of the physical/medium access control
layers. Capacity region of multi-access channels.
Multi-access with correlated sources. Offered in
alternate years.—(III.) Zhao
263. Optimal and Adaptive Filtering (4)
Lecture—3 hours; discussion—1 hour. Prerequisite:
course 260. Geometric formulation of least-squares
estimation problems. Theory and applications of
optimum Wiener and Kalman filtering. MAP and
maximum likelihood estimation of hidden Markov
models, Viterbi algorithm. Adaptive filtering algorithms,
properties and applications. Offered in alternate
years.—(III.)
264. Estimation and Detection of Signals in
Noise (4)
Lecture—3 hours; discussion—1 hour. Prerequisite:
course 260. Introduction to parameter estimation
and detection of signals in noise. Bayes and Neyman-Pearson
likelihood-ratio tests for signal detection.
Maximum-likelihood parameter estimation.
Detection of known and Gaussian signals in white or
colored noise. Applications to communications,
radar, signal processing. Offered in alternate
years.—III.
265. Principles of Digital Communications
(4)
Lecture—4 hours. Prerequisite: courses 165 and
260, or consent of instructor. Introduction to digital
communications. Coding for analog sources. Characterization
of signals and systems. Modulation and
demodulation for the additive Gaussian channel.
Digital signaling over bandwidth-constrained linear
filter channels and over fading multipath channels.
Spread spectrum signals.—II. (II.)
266. Information Theory and Coding (3)
Lecture—3 hours. Prerequisite: Statistics 120. Information
theory and coding. Measure of information.
Redundancy reduction encoding of an information
source. Capacity of a communication channel, errorfree
communications. Offered in alternate years.—II.
269A. Error Correcting Codes I (3)
Lecture—3 hours. Prerequisite: Mathematics 22A
and course 160. Introduction to the theory and practice
of block codes, linear block codes, cyclic codes,
decoding algorithms, coding techniques.—I. (I.)
269B. Error Correcting Codes II (3)
Lecture—3 hours. Prerequisite: course 165 and
269A. Introduction to convolutional codes, turbo
codes, trellis and block coded modulation codes,
soft-decision decoding algorithms, the Viterbi algorithm,
reliability-based decoding, trellis-based
decoding, multistage decoding. Offered in alternate
years.—(II.)
270. Computer Architecture (3)
Lecture—3 hours. Prerequisite: course 170 or Computer
Science Engineering 154B. Introduction to
modern techniques for high-performance single and
multiple processor systems. Topics include advanced
pipeline design, advanced memory hierarchy
design, optimizing pipeline and memory use, and
memory sharing among multiprocessors. Case studies
of recent single and multiple processor systems.—II.
(II.)
271. Multimedia Networking and
Communications (4)
Lecture—3 hours; project—2 hours. Prerequisite:
knowledge of programming language (Matlab, C or
C++); basic knowledge of computer networks and
multimedia compression preferred, but not required.
Concepts and principles that underlie transmission of
multimedia across heterogeneous wired and wireless
IP networks. Multimedia communication over Internet
and wireless networks; error resilient multimedia
compression techniques; error control and error concealment
strategies; multimedia streaming architectures;
channel models and channel estimation
strategies; joint source-channel coding techniques.
Offered in alternate years.—(II.)
272. High-Performance Computer
Architecture and Implementation (3)
Lecture—3 hours. Prerequisite: course 170 or Computer
Science Engineering 154A, 154B and course
270 or Computer Science Engineering 250A. Architectural
issues in achieving high-performance via
concurrent execution of instructions and associated
problems and limitations. Specialized architectures.
Offered in alternate years.—(III.)
273. Computer Networks (4)
Lecture—3 hours; project. Prerequisite: Mathematics
131or Statistics 120 or 131A, Computer Science
Engineering 152A. Concepts and design principles
of computer networks. Network architectures, protocol
mechanisms and implementation principles
(transport/network/data-link layers), network algorithms,
router mechanisms, design requirements of
applications, network simulation, modeling and performance
analysis. Examples primarily from the Internet
protocol suite.—I. (I.)
274. Advanced Topics in Networking (4)
Lecture—3 hours; project. Prerequisite: Computer
Science Engineering 252 or course 273. Advanced
topics in the theoretical foundations of network measurements,
modeling, and statistical inferencing.
Applications to Internet engineering, routing optimization,
load balancing, traffic engineering, fault tolerance,
anomaly detection, and network security.
Individual project requirement. Offered in alternate
years.—(III.)
276. Fault-Tolerant Computer Systems:
Design and Analysis (3)
Lecture—3 hours. Prerequisite: courses 170, 180A.
Introduces fault-tolerant digital system theory and
practice. Covers recent and classic fault-tolerant
techniques based on hardware redundancy, time
redundancy, information redundancy, and software
redundancy. Examines hardware and software reliability
analysis, and example fault-tolerant designs.
Not open for credit to students who have completed
course 276A. Offered in alternate years.—II.
277. Graphics Architecture (3)
Lecture—3 hours. Prerequisite: Computer Science
Engineering 154B or course 170, Computer Science
Engineering 175. Design and analysis of the architecture
of computer graphics systems. Topics include
the graphics pipeline with a concentration on hardware
techniques and algorithms, exploiting parallelism
in graphics, and case studies of noteworthy and
modern graphics architectures. Offered in alternate
years.—II.
Quarter Offered: I=Fall, II=Winter, III=Spring, IV=Summer; 2007-2008 offering in parentheses
General Education (GE) credit: ArtHum=Arts and Humanities; SciEng=Science and Engineering; SocSci=Social Sciences; Div=Social-Cultural Diversity; Wrt=Writing Experience