2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

151 - 160 of 196 results for: EE

EE 369B: Medical Imaging Systems II

Imaging internal structures within the body using non-ionizing radiation studied from a systems viewpoint. Modalities include ultrasound and magnetic resonance. Analysis of ultrasonic systems including diffraction and noise. Analysis of magnetic resonance systems including physics, Fourier properties of image formation, and noise. Prerequisite: EE 261
Terms: Spr | Units: 3

EE 369C: Medical Image Reconstruction

Reconstruction problems from medical imaging, including magnetic resonance imaging (MRI), computed tomography (CT), and positron emission tomography (PET). Problems include reconstruction from non-uniform frequency domain data, automatic deblurring, phase unwrapping, reconstruction from incomplete data, and reconstruction from projections. Prerequisite: 369B.
Last offered: Autumn 2015

EE 371: Advanced VLSI Circuit Design

Design of high-performance digital systems, the things that cause them to fail, and how to avoid these problems. Topics will focus on current issues including: wiring resistance and how to deal with it, power and Gnd noise and regulation, clock (or asynchronous) system design and how to minimize clocking overhead, high-speed I/O design, energy minimization including leakage control, and structuring your Verilog code to result in high-performance, low energy systems. Extensive use of modern CAD tools. Prerequisites: EE 213 and EE 271, or consent of instructor.
Last offered: Spring 2011

EE 372: Data Science for High Throughput Sequencing

Extraordinary advances in sequencing technology in the past decade have revolutionized biology and medicine. Many high-throughput sequencing based assays have been designed to make various biological measurements of interest. This course explores the various computational and data science problems that arises from processing, managing and performing predictive analytics on this high throughput sequencing data. Specific problems we will study include genome assembly, haplotype phasing, RNA-Seq assembly, RNA-Seq quantification, single cell RNA-seq analysis, multi-omics analysis,nand genome compression. We attack these problems through a combination of tools from information theory, combinatorial algorithms, machine learning and signal processing. Through this course, the student will also get familiar with various software tools developed for the analysis of real sequencing data. Prerequisites: Basic knowledge of probability at the level of EE 178. Some programming experience.
Last offered: Spring 2016

EE 373A: Adaptive Signal Processing

Learning algorithms for adaptive digital filters. Self-optimization. Wiener filter theory. Quadratic performance functions, their eigenvectors and eigenvalues. Speed of convergence. Asymptotic performance versus convergence rate. Applications of adaptive filters to statistical prediction, process modeling, adaptive noise canceling, adaptive antenna arrays, adaptive inverse control, and equalization and echo canceling in modems. Artificial neural networks. Cognitive memory/human and machine. Natural and artificial synapses. Hebbian learning. The Hebbian-LMS algorithm. Theoretical and experimental research projects in adaptive filter theory, communications, audio systems, and neural networks. Biomedical research projects, supervised jointly by EE and Medical School faculty. Recommended: EE263, EE264, EE278.
Terms: Win | Units: 3

EE 376A: Information Theory (STATS 376A)

The fundamental ideas of information theory. Entropy and intrinsic randomness. Data compression to the entropy limit. Huffman coding. Arithmetic coding. Channel capacity, the communication limit. Gaussian channels. Kolmogorov complexity. Asymptotic equipartition property. Information theory and Kelly gambling. Applications to communication and data compression. Prerequisite: EE178 or STATS 116, or equivalent.
Terms: Win | Units: 3

EE 376B: Network Information Theory (STATS 376B)

Network information theory deals with the fundamental limits on information flow in networks and the optimal coding schemes that achieve these limits. It aims to extend Shannon's point-to-point information theory and the Ford-Fulkerson max-flow min-cut theorem to networks with multiple sources and destinations. The course presents the basic results and tools in the field in a simple and unified manner. Topics covered include: multiple access channels, broadcast channels, interference channels, channels with state, distributed source coding, multiple description coding, network coding, relay channels, interactive communication, and noisy network coding. Prerequisites: EE376A.
Last offered: Autumn 2014

EE 376C: Universal Schemes in Information Theory

Universal schemes for lossless and lossy compression, channel coding and decoding, prediction, denoising, and filtering. Characterization of performance limitations in the stochastic settting: entropy rate, rate-distortion function, channel capacity, Bayes envelope for prediction, denoising, and filtering. Lempel-Ziv lossless compression, and Lempel-Ziv based schemes for lossy compression, channel coding, prediction, and filtering. Discrete universal denoising. Compression-based approach to denoising. The compound decision problem. Prerequisites: EE376A.
Terms: Aut | Units: 3
Instructors: Weissman, T. (PI)

EE 376D: Wireless Information Theory

Information theory forms the basis for the design of all modern day communication systems. The original theory was primarily point-to-point, studying how fast information can flow across an isolated noisy communication channel. Until recently, there has been only limited success in extending the theory to a network of interacting nodes. Progress has been made in the past decade driven by engineering interest in wireless networks. The course provides a unified overview of this recent progress made in information theory of wireless networks. Starting with an overview of the capacity of fading and multiple-antenna wireless channels, we aim to answer questions such as: What is the optimal way for users to cooperate and exchange information in a wireless network? How much benefit can optimal cooperation provide over traditional communication architectures? How can cooperation help to deal with interference between multiple wireless transmissions? Formerly EE361. Prerequisites: EE376A
Terms: Win, Spr | Units: 3
Instructors: Ozgur, A. (PI)

EE 377: Information Theory and Statistics (STATS 311)

Information theoretic techniques in probability and statistics. Fano, Assouad,nand Le Cam methods for optimality guarantees in estimation. Large deviationsnand concentration inequalities (Sanov's theorem, hypothesis testing, thenentropy method, concentration of measure). Approximation of (Bayes) optimalnprocedures, surrogate risks, f-divergences. Penalized estimators and minimumndescription length. Online game playing, gambling, no-regret learning. Prerequisites: EE 376A (or equivalent) or STATS 300A.
Last offered: Winter 2016
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints