UC Davis 2008-2010 General Catalog - General Catalog - UC Davis

260 Engineering: Electrical and Computer Engineering
tion 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.)
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 detections 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.—III. (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. Internet Measurements, Modeling and
Analysis (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.
278. Computer Arithmetic for Digital
Implementation (3)
Lecture—3 hours. Prerequisite: courses 170, 180A.
The design and implementation of computer arithmetic
logic units are studied with particular emphasis
on high-speed performance requirements. Addition
(subtraction), multiplication and division operations
are covered, and fixed and floating-point representations
are examined. Offered in alternate years.—III.
280. High-Performance System Design (3)
Lecture—3 hours. Prerequisite: course 118, 180B.
Advanced digital circuits. Logic families of high-performance
systems: processors and DSP. Timing,
clock generation, clock distribution and clock storage
elements. Pipelining in high-performance systems.
Power issues and design for low-power. VLSI
arithmetic and implementation in digital systems.—I.
(I.)
281. VLSI Digital Signal Processing (3)
Lecture—3 hours. Prerequisite: courses 150B, 170,
180B or consent of instructor. Digital signal processors,
building blocks, and algorithms. Design and
implementation of processor algorithms, architectures,
control, functional units, and circuit topologies
for increased performance and reduced circuit size
and power dissipation.—II. (II.)
282. Hardware Software Codesign (3)
Lecture—2 hours; discussion—1 hour. Prerequisite:
course 170, 180B. Specification and design of
embedded systems; modeling and performance estimation;
hardware/software partitioning; co-simulation;
design re-use; platform-based design;
reconfigurable computing.—III.
283. Advanced Design Verification of
Digital Systems (4)
Lecture—3 hours; project. Prerequisite: courses 170
and 180A. Design verification techniques for digital
systems; simulation-based design verification techniques;
formal verification techniques, including
equivalence checking, model checking, and theorem
proving; timing analysis and verification; application
of design certification techniques to microprocessors.
Offered in alternate years.—II.
284. Design and Optimization of
Embedded Computing Systems (4)
Lecture—4 hours. Prerequisite: courses 170 and
180B, or consent of instructor. Computer Science
Engineering 122A recommended. Introduction to
design and optimization of digital computing systems
for embedded applications. Topics include combinatorial
optimization techniques, performance and
energy optimization in embedded systems, compilation
and architecture-specific mapping, programmable
and reconfigurable platforms; design automation
and algorithmic improvements to design process.—
II. (II.)
286. Introduction to Digital System Testing
(3)
Lecture—3 hours. Prerequisite: course 180A; Statistics
120 or 131A. A review of several current techniques
used to diagnose faults in both combinational
and sequential circuits. Topics include path sensitization
procedures, Boolean difference, D-algorithm
random test generation, TC testing and an analysis
of the effects of intermittent faults. Not open for
credit to students who have completed course 276A.
Offered in alternate years.—II.
289A-V. Special Topics in Electrical and
Computer Engineering (1-5)
Lecture/laboratory—1-5 units. Prerequisite: consent
of instructor. Special topics in (A) Computer Science,
(B) Programming Systems, (C) Digital Systems (D)
Communications, (E) Signal Transmission, (F) Digital
Communication, (G) Control Systems, (H) Robotics,
(I) Signal Processing, (J) Image Processing, (K) High
Frequency Phenomena and Devices, (L) Solid-State
Devices and Physical Electronics, (M) Systems Theory,
(N) Active and Passive Circuits, (O) Integrated
Circuits, (P) Computer Software, (Q) Computer Engineering,
(R) Microprocessing, (S) Electronics, (T)
Electromagnetics, (U) Optoelectronics, (V) Computer
Networks. May be repeated for credit when topic
differs.—I, II, III. (I, II, III.)
290. Seminar in Electrical and Computer
Engineering (1)
Seminar—1 hour. Discussion and presentation of
current research and development in Electrical and
Computer Engineering. May be repeated for credit.
(S/U grading only.)—I. (I.)
290C. Graduate Research Group
Conference in Electrical and Computer
Engineering (1)
Discussion—1 hour. Prerequisite: consent of instructor.
Research problems, progress, and techniques in
electrical and computer engineering. May be
repeated for credit. (S/U grading only.)—I, II, III. (I,
II, III.)
Quarter Offered: I=Fall, II=Winter, III=Spring, IV=Summer; 2009-2010 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