151 - 160 of 194 results for: EE

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.

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.

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: EE278, EE376A, EE376B.

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

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.

Random signals in electrical engineering. Discrete-time random processes: stationarity and ergodicity, covariance sequences, power spectral density, parametric models for stationary processes. Fundamentals of linear estimation: minimum mean squared error estimation, optimum linear estimation, orthogonality principle, the Wold decomposition. Causal linear estimation of stationary processes: the causal Wiener filter, Kalman filtering. Parameter estimation: criteria of goodness of estimators, Fisher information, Cramer-Rao inequality, Chapman-Robbins inequality, maximum likelihood estimation, method of moments, consistency, efficiency. ARMA parameter estimation: Yule-Walker equations, Levinson-Durbin algorithm, least squares estimation, moving average parameter estimation, modified Yule-Walker method for model order selection. Spectrum estimation: sample covariances, covariance estimation, Bartlett formula, periodogram, periodogram averaging, windowed periodograms. Prerequisites: EE 278

Techniques and models for signal, data and information processing, with emphasis on incomplete data, non-ordered index sets and robust low-complexity methods. Linear models; regularization and shrinkage; dimensionality reduction; streaming algorithms; sketching; clustering, search in high dimension; low-rank models; principal component analysis.nnApplications include: positioning from pairwise distances; distributed sensing; measurement/traffic monitoring in networks; finding communities/clusters in networks; recommendation systems; inverse problems. Prerequisites: EE278 and EE263 or equivalent. Recommended but not required: EE378A

Modulation: linear, differential and orthogonal methods; signal spaces; power spectra; bandwidth requirements. Detection: maximum likelihood and maximum a posteriori probability principles; sufficient statistics; correlation and matched-filter receivers; coherent, differentially coherent and noncoherent methods; error probabilities; comparison of modulation and detection methods. Intersymbol interference: single-carrier channel model; Nyquist requirement; whitened matched filter; maximum likelihood sequence detection; Viterbi algorithm; linear equalization; decision-feedback equalization. Multi-carrier modulation: orthogonal frequency-division multiplexing; capacity of parallel Gaussian channels; comparison of single- and multi-carrier techniques. Prerequisite: EE102B, EE278

Live presentations of current research in the design, implementation, analysis, and applications of computer systems. Topics range over a wide range and are different every quarter. Topics may include fundamental science, mathematics, cryptography, device physics, integrated circuits, computer architecture, programming, programming languages, optimization, applications, simulation, graphics, social implications, venture capital, patent and copyright law, networks, computer security, and other topics of related to computer systems. May be repeated for credit.