Courses | VD Academic Affairs

Information measures, asymptotic equipartition property, source coding theorem, noiseless coding, cryptography, channel coding theorem, Gaussian channels, multiple user source and channel theory, rate distortion theory.

Introduction to analog and digital communication theory. Performance evaluation of communication systems. Line of sight microwave communication systems. Mobile communication systems. Satellite systems for communication, navigation and maritime applications. Fiber optic systems. Comparison between different communication systems.

Fundamental properties of 2-D digital systems. Frequency representation of 2-D systems and the 2- D sampling theorem. The 2-D z- transform and stability of 2-D systems. Design techniques of 2-D FIR digital filters: The window method, the 2-D frequency sampling technique, optimal minimal design, frequency transformations from 1-D to 2-D filters. Design techniques of 2-D digital filters. Quantization effects and noise in digital filters. Application of digital signal processing to areas such as image processing, processing of sonar maps and biomedical images of maps.

Line of sight communication systems: Atmospheric refraction. Effect of ducts on propagation. Multipath effects and signal fading. Power budget and system design. Satellite communication links: Satellite orbits. Spacecraft equipment. Design of down and up links. Satellite earth stations. Design examples.

Light guidance on fibers. Cabling design. Light attenuation and dispersion on fibers. Lasers, LED's and photodetectors. Design of digital and analoge optical fiber systems. Design of coherent light systems.

An upper division of graduate technical elective treating topics in Communications and/or Electromagnetics not included in other Communications/Electromagnetics courses.

An upper division of graduate technical elective treating topics in Electronics not included in other Electronic courses.

Project course for non-thesis students.

Algorithmic problem solving in the context of a modern programming language Terminology-Arithmetic computations--Simple & formatted I/O-if structures, while loop, do loop, for loop, nesting, data files, arrays (1D & 2D), functions, strings and pointers, structures.

A continuation of computing fundamentals given in CpE-200. Topics include data and procedural abstraction, software design principles and use of O-O design to develop solutions to simple problems. Ethical issues involved in computer use, Basic object-oriented design techniques (encapsulation and information-hiding, separation of behavior and implementation, classes and subclasses, inheritance, polymorphism, class hierarchies), Iterators as abstraction mechanisms, Linked structures, Event-driven programming, API programming. The laboratory projects include use of object-oriented design concepts with detailed documentation.

Basic logic (propositional logic, predicate logic, limitations, applications in computing). Sets, relations, and functions. Proof techniques (formal proofs, direct, contraposition and contradiction, induction). Basics of counting (permutations and combinations, counting arguments, pigeonhole principle and generating functions). Graphs and trees (spanning trees, shortest path, Euler and Hamiltonian cycles, and traversal strategies). Recursion (definitions, developing and solving recursive equations). The focus of materials is on the applications side of computer engineering.

Fundamental data structures (stacks, queues, linked lists, hash tables, trees, graphs), Basic algorithmic analysis (asymptotic analysis, identifying differences among best, average, and worst case, empirical measurements of performance, time and space tradeoffs in algorithms), Fundamental computing algorithms, sorting algorithms, hash tables and hashing, heaps, priority queues, binary search trees, balanced binary search trees, AVL trees, representations of graphs and graph traversals, Recursion. The course includes weekly laboratory sessions and a significant programming project with detailed documentation and implementation.

Logic gates and Boolean algebra. Design and analysis of combinational circuits. Logic function minimization. Modular design of combinational circuits. Number Systems. Arithmetic circuits. Programmable logic devices (PLDs). Memory elements: latches and flip-flops. Design and analysis of synchronous sequential circuits. Simulation and synthesis of digital circuits from HDL models.

Hands-on design and implementation of digital logic circuits. Use of CAD tools for schematic capture and Verilog HDL based simulation and synthesis. Implementations of digital circuits using sophisticated logic devices such as CPLDs and FPGAs.

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting, divide-and-conquer, dynamic programming, graph algorithms, shortest paths, network flow, polynomial and matrix calculations, parallel computing.