
|
|  | About Us |
|
|
|  | Academics |
|
|
|  | Admissions |
|
|
|  | Faculty |
|
|
|  | Research |
|
|
|  | Student |
|
|
|  | Campus Facilities |
|
|
|  | Administration |
|
|
|  | Contact Us |
|
|
|  | Downloads |
|
|
|
|
|
 |
 |
|
Masters & Post Graduate(Doctorial) Courses Details |
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
DSP / Architecture |
 |
Course Outline
|
The main thrust of the course is to provide students with a solid understanding of four inter-related and essential topics in statistical signal processing applications: Signal Modeling, Optimum Filtering, Adaptive Filtering and Spectrum Estimation. The course begins with a basic review of the essential mathematical tools and moves up to equip the students with the proper knowledge to characterize, model, estimate and spectrally analyze the most common random processes they will come across - digital signals.
|
 |
Broad Course Contents
|
- Mathematical Background (Discrete-Time Signal Processing, Linear Algebra, Random Variable and their properties)
- Random Processes (Random Processes and their properties, Filtering and Factorizing Random Processes, Special Types)
- Signal Modeling (Least Squares Modeling, Prony's Method, ARMA Models)
- Optimum Filters (Wiener Filters, Discrete Kalman Filter)
- Adaptive Filters (Steepest Descent, LMS, RLS).
- Spectral Estimation (Periodogram, Welch's Periodogram, Parametric Methods, MUSIC, APES).
|
 |
Prerequisites
|
-
|
 |
Suggested Text
|
M. Hayes, Statistical Digital Signal Processing and Modeling, Wiley, ISBN 471594318
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications |
 |
Course Outline
|
This course focuses on current research issues in wireless communication systems
and networks with more focus on wireless networking issues. Topics include multiple
access techniques, ad-hoc wireless networking and stochastic geometry for the analysis
and design of wireless networks. A rough set of the topics to be covered is given
during the first week of classes. Lectures are based on required reading from magazine
and journal articles, textbook sections, or supplemental handouts. Students present
current research papers to the class as part of the lectures. A term project is
also part of the course requirements.
The course will have three important aspects – Lectures on course topics, Paper
reviews with class discussions and research based group projects.
|
 |
Broad Course Contents
|
- Multiuser systems (Chapters 13.4 and 14, additional papers)
- Ad hoc wireless networks (Chapter 16, additional papers)
- Stochastic Geometry for the Analysis and Design of Wireless Networks (from papers)
- Simulation Modeling of Wireless networks (papers)
- Cognitive radio networks (papers)
- Sensor networks (papers)
- Applications & cross-layer design (papers)
- Additional topics, project presentations
|
 |
Prerequisites
|
ECE- 7703 Wireless Communication, ECE-7611 Advanced Communication Theory and its prerequisites.
Note: THE PREREQUISITES ARE A MUST TO TAKE THE CLASS.
|
 |
Suggested Text
|
A.J. Goldsmith, Wireless Communications, Cambridge. This is an excellent recently published book that achieves a good balance between broad insights, theoretical detail, and practical design insights. Additional course notes and unpublished materials will be provided as neededJeffrey Reed, "Software Defined Radio – A modern approach to radio engineering"
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications |
 |
Course Outline
|
Information theory deals with, how much information is transmitted, how much is
lost during transmission and how much information is received on the other side.
Information theory also deals with source coding, channels and channel capacity,
entropy, Shannon’s theorems etc. Coding theory deals with the issues of protection
of data while passing through hostile environment. It deals with techniques that
add enough redundancy in data to protect the information bits without overloading
the system.
|
 |
Broad Course Contents
|
- Discrete Sources and Entropy:
- Information Entropy
- Shannon’s Source Coding Theorem
- Huffman Coding
-
Lempel-ziv Coding
- Channels and Channel Capacity:
- The Discrete Memoryless Channel
- Binary Symmetric Channel
- Shannon’s
Channel Coding Theorem
- Block Coding
- Sources With Memory and Markov Processes
-
Constrained Channels, Data-translation Codes
- Run-length Limited Codes:
- Prefix Codes and Block Codes
- Fixed-length Block Codes
- Variable-length
Block Codes
- Look Ahead Codes
- DC-Free Codes
- Linear Block Error-correcting Codes:
- Binary Fields and Vector Spaces
- Linear Block Codes
- Hamming Codes
-
Error Rate
- Performance Bounds
- Cyclic Codes:
- Polynomial Representation of Cyclic Codes
- Generation and Decoding of Cyclic
Codes
- Hamming Codes
- BCH Codes
- Modifications to Cyclic Codes
- Convolutional Codes:
- Structural Properties
- Viterbi Algorithm
- Viterbi Algorithm:
- Viterbi Algorithm:
- Soft-decision Decoding
- Traceback Method of Viterbi Decoding
- Trellis Coded Modulation:
- Multi-amplitude/phase Discrete Memoryless channels
- Recursive Convolutional
-
Encoders
- Signal Mapping and Set Partitioning
- Trellis Codes for PSK and
QAM
- Information Theory and Cryptography:
- Cryptosystems, Language Entropy and Ciphertext Attacks
- Product Cipher Systems
-
Public-key Cryptosystems.
|
 |
Prerequisites
|
ECE 4601 Communication System, MATH 4601 Probabaility and Random Variables
|
 |
Suggested Text
|
Applied Coding and Information Theory for Engineers” by Richard B. Wells
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications |
 |
Course Outline
|
This course examines mobile data networks, mobility issues in networking and covers
fundamentals of mobile network architectures. It briefly discusses the operation
of wireless telecommunications systems like GPRS and 3G systems without going into
the physical layer details. It explains and analyzes the operation of wireless PANs
and LANs, including IEEE 802.11 and Bluetooth. Another focus of this course is on
routing schemes for mobile and nomadic hosts, including Mobile IP, mobile ad hoc
network (MANET) protocols, DHCP and IPv6.
|
 |
Broad Course Contents
|
- Basics of Wireless Networks and Mobile Computing
- Mobility Management in:
- Bluetooth PANs
- IEEE 802.11 Wireless LANs
- GPRS
- UMTS WANs
-
Wireless ATM
- Multiple Access Methods
- Aloha
- CSMA
- CSMA/CA,
etc.
- EY-NPMA
- Mobile IP:
- Advertisement and Registration
- Mobile IP Route Optimization
- Mobile
IP Applications
- Mobile Ad Hoc Networks (MANETs):
- Routing in Mobile Ad Hoc Networks
- L2 Interaction
- Scalability
-
QoS and Security in MANETs
- Open issues in MANETs
- Mobility support in DHCP and IPv6
- Brief introduction to Satellite Communication
Networks, WAP, iMode, etc.
|
 |
Prerequisites
|
ECE 6607 Computer Networks. Thorough understanding of computer networks, Routing
protocols, and the TCP/IP protocol suite.
|
 |
Suggested Text
|
- Ad Hoc Networking by Charls Perkins, Ist Edition, Eddison-Wesley.
- Mobile IP by Charlse Perkins, Ist Edition, Prentice Hall. Wireless LANs by James
T. Geier and Jim Geier, Seceond Edition, SAMS.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications |
 |
Course Outline
|
Recently, an important paradigm shift in the design methodology of radios/transceivers
has occurred in the name of Software Defined Radios (SDRs). Ideal SDRs have the
entire signal processing from signal generation till antenna in a programmable/software
form but practically, this is limited by hardware/interface/regulatory constraints.
This paradigm shift requires re-visiting important transceiver algorithms from a
software implementation point of view. In this course we will try to encompass important
transceiver algorithms from an SDR point of view. Hardware limitations like those
of interface compliances and ADC/DAC constraints will be discussed. Multiple existing
development tools/platforms for SDRs will also be discussed along with the standardization
efforts/architectures concerning SDRs. Finally the new evolution of SDR known as
the Cognitive Radio and the associated algorithms will be discussed in this course.
|
 |
Broad Course Contents
|
- Course Overview + Introduction to SDR
- Tools/Methodologies/Platforms for
SDR design
- OSSIE environment
- SCA – Software Communication Architecture
-
Signal Processing for SDR
- Pulse shaping
- Modulation/demodulation algorithms
- Equalization
-
Synchronization algorithms
- Filter design etc
- Hardware Constraints
- ADC/DAC
- Cognitive Radios
- Spectrum Sensing
- Spectrum Sharing
- Cognitive Radio Networks
- Case Study for an SDR
- Applications/Future/Research
|
 |
Prerequisites
|
Digital Communications, Signal and Systems, DSP (preferred).
|
 |
Suggested Text
|
- Jeffrey Reed, "Software Defined Radio – A modern approach to radio engineering"
-
Tony Rouphael, "RF and DSP for Software Defined Radio"
- Bill Sethares, "Telecommunications
Breakdown"
- Behrouz farhang, "Signal Processing for SDR"
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture |
 |
Broad Course Contents
|
- Introduction to computer vision
- Image enhancement in spatial domain
-
Image enhancement in Fourier domain
- Edge detection, derivative of the Gaussian
-
PCA-based face recognition
- Lung nodules detection in X-ray images
- Pseudo-color
processing for angiogram image enhancement
|
 |
Prerequisites
|
- |
 |
Suggested Text
|
- |
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture |
 |
Course Outline
|
This course provides the know-how for the implementation and optimization of computationally
intensive signal processing algorithms on these DSP processors. Our everyday lives
involve the use of DSP systems in things such as cell phones and high-speed modems;
Companies like Texas Instruments, Analog Devices, Lucent, have introduced several
DSP processors to meet the high performance demands of today's signal processing
applications.
|
 |
Broad Course Contents
|
- Introduction to DSP algorithms
- Introduction to DSP processors
- DSP
processors architectures
- Compilation and execution environments
- Fixed
point and floating point issues
- Software architecture for DSP boards and systems
-
Host interfaces
- I/O interfaces
- DMA
- Serial port
- Timer
-
Interrupts
- Real-time operating systems
- DSP program framework and API
-
Real-time program architecture
|
 |
Prerequisites
|
C programming, Assembly Programming, Computer Organization, ECE 4201 Signal and
Systems, DSP (preferred)
|
 |
Suggested Text
|
- User Manuals: TMS320C3x, TMS320C6x, TMS320C54x.
- Communication System Design
Using DSP Algorithms with Laboratory Experiments for the TMS320C30 by Steven A.
Tertter.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture |
 |
Course Outline
|
Adaptive filter finds wide applications in the filed of digital signal processing,
communications, estimation and control, navigation and radar signal processing.
The emphasis of this course will be on the development of clear concepts to build
a sound theoretical foundation for adaptive filtering applications.
|
 |
Broad Course Contents
|
- Review of discrete time stochastic processes
- Wiener Filters
- Steepest
Descent Method
- Theory of LMS algorithm
- Recursive Least Square (RLS)
algorithm
- Kalman Filtering
- Applications, a) Line Echo Cancellation,
b) Adaptive beamforming, c) Kalman filter based estimation and measurements.
|
 |
Prerequisites
|
The only pre-requisite is undergraduate level signals and systems course.
|
 |
Suggested Text
|
- Adaptive Filters Theory and Applications by B. Farhang-Boroujeny, John Wiley & Sons,
1998
- Adaptive Filters by A. H. Sayed, John Wiley & Sons, 2008.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture |
 |
Course Outline
|
This course covers various aspects of VLSI system design, starting from high level
architectural and logic design issues and going all the way down to the fabrication
and layout issues. While the course does introduce the high level design approaches
such as Verilog HDL based design, yet the bulk of the course deals with transistor
level circuit design and layout issues as these are essential for developing a deep
understanding of the working of digital integrated circuits and to understand the
area, speed and power tradeoffs involved in VLSI design.
|
 |
Broad Course Contents
|
- Overview of VLSI systems
- Complexity
- Wires and switches
- Fabrication
and layout
- MOS Transistors
- Switch and gate logic
- CMOS gates
-
Capacitance and switch level
- Simulation
- Gate logic: Logic optimization
-
High level design
- Hardware description languages
- Clocking of VLSI systems
-
Synthesis
- Implementation constraints and high level planning
- Cell design
issues
- Pseudo NMOS and pre-charged logic
- MOS memory design
- MOS
decoders – gate sizing
- MOS delay models
- Distributed RC Tree
-
Data-path functional units – Adders
- Shifters and multipliers
- Testing
-
Design for testability
- Input/output issues
- Pads
- ESD
-
Power
- Low power design
|
 |
Prerequisites
|
This class will assume a background in digital logic, and some understanding of
RC circuits. The class will also use a number of CAD tools. You will learn how to
use the Irsim switch-level simulator, the Magic layout system, and the Verilog functional
simulator.
|
 |
Suggested Text
|
Digital Integrated Circuit for Design Perspective by Jan. M Rabaey 2nd Edition
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Control / Modeling and Simulation |
 |
Broad Course Contents
|
- Introduction to discrete time systems
- Practical aspects of discrete time
systems
- Z -Transform and Inverse –Transform
- Z -Transform analysis of
SISO systems
- Digital Signal Processing
- Delta Transform
- Discrete
Time Fourier Transform and Applications
- Introduction to Discrete Time Control
-
Root Locus
- Nyquist Theorem
- State Space Analysis and design
- Pole Placement
- Observers
- Optimal Control
|
 |
Prerequisites
|
Linear Systems
|
 |
Suggested Text
|
Discrete-Time Control Systems, 2e, Katsuhiko Ogata, Prentice Hall, 1995.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Mathematics |
 |
Course Outline
|
The integral equation approach leads quite naturally to the solution of the problem
as an infinite series, known as the Neumann expansion, in which the successive terms
arise from the application of an iterative procedure. Therefore, in this course
we present an introduction to integral equations and study the techniques to solve
these equations. In general, integral transforms often provide a convenient method
for finding solutions to differential as well as to integral equations.
|
 |
Broad Course Contents
|
- Theory and application of integral transforms
- Laplace Transform
-
Fourier Transform
- Mellin Transform
- Hankel Transform
- Hilbert
Transform
- H-Transform; Y-transform
- Z-Transform, etc.
- Convolution
theorem, etc
- Introduction and modeling problems in terms of integral equations
-
Classicfication of integral equations
- Some important identities
- Volterra's
theory of Integral equations ( First kind and second kind) and their solution by
Resolvent Kernel method
- Successive Approx Method
- Laplace Transform method
-
Fredholm theory of Integral Equations of first kind ( with Degenerate Kernel & Symmetric
Kernel)
- Fredholm Integral Equation of second kind
|
 |
Prerequisites
|
- |
 |
Suggested Text
|
- |
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite |
 |
Course Outline
|
In this course the students will learn how to solve boundary value problems analytically.
This will enable them to develop command over one of the two techniques, namely:
- Analytical Techniques
- Numerical Techniques for the solution of boundary value problems
|
 |
Broad Course Contents
|
- First Order Differential Equations
- Second Order Linear Equations
-
Series Solutions of Second Order Linear Equations
- Higher Order Linear Equations
-
The Laplace Transform
- System of First Order Linear Equations
- Partial
Differential Equations and Fourier Series
- Boundary Value Problems and Sturm
Liouville Theory
- Non Linear Differential Equations
|
 |
Prerequisites
|
- |
 |
Suggested Text
|
Ordinary Differential Eq. With boundary value prob. By Boyce & Diprima
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite |
 |
Course Outline
|
C & Data Structures is a training course designed for users with a solid working
knowledge of C language basics who have also successfully completed the Advanced
C course. Students in this course are also introduced to various searching and sorting
methods and are also expected to develop an intuitive understanding of the complexity
of these algorithms.
|
 |
Broad Course Contents
|
- Introduction
- Basic Structure of C Program
- Using Variables
-
Using Standard Output
- Using Standard Input
- Using Loops
- Flow
Control
- Functions
- Operators and Macros
- Structures and Unions
-
Arrays, Strings as character arrays
- Pointer variables
- Memory Management
-
File Handling
- Iteration vs. Recursion
- Data Organization Overview
-
Linked-List
- Types of Linked-Lists Part-I
- Types of Linked-Lists Part-II
-
Binary Tree
- Balanced Binary Trees
- Rapid Sorting Algorithms
- Useful
Sorting Techniques
- Merge Strategies
- Introducing Graphs
- Working
with Graphs
|
 |
Prerequisites
|
Introduction to Computing
|
 |
Suggested Text
|
- Data Structures and Algorithms in C++ by Adam Drozdek
- Object-Oriented Programming in C++ by Robert Lafore
- C++ by Dietel & Dietel
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications |
 |
Course Outline
|
The course focuses on the TCP/IP protocol suite, but also touch on other protocols
such as Asynchronous Transfer Mode (ATM). The course involves Linux-based network
programming using the C language. This programming experience is intended to provide
you with a solid understanding of the services provided by the TCP/IP protocol suite
used on the Internet. |
 |
Broad Course Contents
|
Layered architectures (Internet and the OSI Reference Model), Overview of networking
and communication software (Sockets), Standards in networks access protocols (CSMA,
etc.), Architectures and control algorithms of local-area, point-to-point, and mobile
networks, Models of network interconnection, Design issues and protocols in the
data link, network, and transport layers, Direct Link Networks, Encoding and Framing,
Error Detection and Reliable Transmission, Ethernet and Token Ring Networks, Wireless
802.11 Networks, Packet-Switched Networks, Switching and Forwarding, Bridges and
LAN Wwitches, Cell Switching (ATM), Internetworking, Internet Protocol (IP), Unicast
and Multicast Routing, Global Internet, MPLS, End-to-End Protocols, UDP, TCP and
RPC, Congestion Control and Network QoS, Resource Allocation and Queuing Disciplines,
Congestion Control and Avoidance Mechanisms, Quality of Service, Representation
of End-to-End Data, Presentation Formatting (ASN.1, etc.), Data Compression Techniques
(JPEG, MPEG, MP3), Network Applications, DNS, HTTP, SMTP, etc., Overlay Networks
and Peer-to-Peer Networking
|
 |
Prerequisites
|
Understanding of computer architecture, Good knowledge of C language (ECE 4002 C
and Data Structures), |
 |
Suggested Text
|
- Computer Networks: A Systems Approach, 3rd Edition by Larry Peterson, Bruce Davie,
Morgan Kaufman Publishers, 2003.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture |
 |
Course Outline
|
This course is designed to introduce engineers and designers advanced digital design
concepts. The students are taught different steps in the design flow of VLSI IC
circuit designing using HDLs. They will be exposed to mapping computationally intensive
algorithms in different engineering applications on FPGAs. |
 |
Broad Course Contents
|
High-level digital design methodology using Verilog, Reusable Methodology, HDL coding
for synthesis, FPGA based Digital Design, XILINX ISE 6.1i synthesys and implementation
tool workshop, Datapath and Controller Design Partitioning, Design of Datapath Units,
Algorithmic state machine based design, Time shared and pipeline architectures,
Digital design of high speed computational unit, Single Cycle and Pipelined Processor,
VLIW and SuperScalor Architecture.
|
 |
Prerequisites
|
ECE 4001 Digital Logic Design and Computer Architecture, ECE 4201 Signals and Systems |
 |
Suggested Text
|
- Advanced Digital Design with the Verilog HDL by Michael D. Cilietti
- Microprogrammed Statemachine Design by Michel A. Lynch
- Digital Design of
Signal Processing and Communication Systems by Shoab Khan (draft)
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture |
 |
Course Outline
|
This course will help the students to have sufficient academic and practical knowledge
of image processing algorithms development and implementation. The course is related
to the field of computer vision. |
 |
Broad Course Contents
|
Introduction to Image Processing, Digital Image Fundamentals, and Image Acquisition,
Image Enhancement in Spatial Domain, - Pixel Operations & Histogram Processing,
- Histogram Equalization, - Histogram specification and local enhancement techniques,
- Local enhancement techniques using Spatial (Mask) Filtering, Image Enhancement
in Frequency Domain, - Basic Properties of Fourier Transforms, - Properties and
Implementation (FFT’s), - Frequency Domain Filtering, Image Sampling, Image Restoration,
- Noise models and additive noise removal, - Adaptive filtering, notch filtering
and interactive restoration techniques for additive noise removal, - Degraded image
restoration, - Geometric transformations, Color Imaging, Multi-resolution Processing
(including Wavelet Transforms), Image Compression, - Introduction, - Error-free
compression, - Predictive coding, - Transform coding, Morphological Image Processing,
- Morphological Processing on Binary Images, - Morphological Processing on Grey
Scale Images, Image segmentation, - Point, Line and Edge Detection, Edge Linking,
and Thresholding, Water Marking and other Advanced Topics.
|
 |
Prerequisites
|
Working knowledge of Matlab programming, Vector and matrix theory, Basics of Probability
and Random Variables (CDF’s and PDF’s) e.g., MATH 4601 Probability and Random Variable,
ECE 4201 Signals & Systems (Concept of Fourier Transform) is compulsory |
 |
Suggested Text
|
- Digital Image Processing, R. C. Gonzalez and R. E. woods, 2nd edition, Pearson Education,
Inc., 2002.
- Additional readings: Digital Image Processing using MATLAB, R. C. Gonzalez ,R. E.
Woods and S.L. Eddins, Pearson Education, Inc., 2004. Class Slides
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Control / Modeling and Simulation |
 |
Course Outline
|
After this course the student should be able to analyze nonlinear dynamic systems
and design nonlinear controllers. |
 |
Broad Course Contents
|
Introduction to Nonlinear Systems, System Trajectories, Describing Functions, Lyapunov
Stability Theory, Lasalle Theorem, Lyapunov Theory for Discrete Time Systems, Circle
Criterion, Passivity, Sliding Mode Control, Adaptive Control, Design applications.
|
 |
Prerequisites
|
Linear Systems & Controls, Command on MATLAB |
 |
Suggested Text
|
Instructor Notes
|
|
|
|
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Control Systems |
 |
Course Objective |
This course is a second graduate course in nonlinear systems. Concepts and techniques
of advanced control system analysis and synthesis will be studied. The course is
structured to emphasize some of the recent research activity in nonlinear analysis
and control. We will use concepts from differential geometry, however the course
is self contained in that this mathematics will be taught as part of the course.
The approach will be generic, with preferential emphasis on nonlinear control synthesis
techniques. The topics and examples covered will be generic enough so as to enable
the students from all engineering fields to successfully complete the course. |
 |
Course Outline |
Part 1: Nonlinear Control Concept
- Phase portrait Concepts, equilibrium points,
- Stability, asymptotically stability, exponential stability
- Autonomous system, Liapunov theorem, Invariant Theorem
- Lyapunov Analysis of Non-Autonomous Systems, Barbalat's Lemma
Part 2: Advanced Topics in Feedback Linearization
- Lie Algebra, Lie derivative, Lie Brackets, Involutivity and Frobenius' Theorem
-
Input-State Linearization, Local coordinate transformation, Exact Linearization
via Feedback, Zero Dynamics, Disturbance decoupling, High gain feedback, Observation
with linear error dynamics. Examples
- Input-output Linearization, Local coordinate
transformation, Exact Linearization via Feedback, Non-interacting control, Achieving
relative degree via Dynamical Extension. Examples
- Zero dynamics, Controlled
Invariant distributions, Controllability distribution
- Asymptotic Stabilization
via state feedback, Disturbance decoupling, Non-interacting control via Statics
feedback, Non-interacting control: Necessary and Sufficient Conditions
- Tracking
and Regulation
- Global Feedback Design for single –input single output systems.
Part 3: Geometric Nonlinear Control
- Introduction to Differential Geometry, Center manifold theorem,
- Matrix Lie
groups, properties, associated Lie algebras, examples
- Control of Systems on
Lie Groups
- Design examples
- Global decomposition of Control System
-
Input-output map and realization theory
|
 |
Prerequisites
|
- |
 |
Suggested Text |
- A. Isidori. Nonlinear Control Systems, 3rd Edition. Springer, 1995.
- S. S.
Sastry. Nonlinear Systems: Analysis, Stability, and Control. Springer-Verlag, 1999.
-
H. K. Khalil. Nonlinear Systems, 3rd Edition. Prentice-Hall, 2002.
- J. J. Slotine
and Weiping Li , Applied Nonlinear Control, Prentice-Hall, 1991, ISBN 0-13-040890-5
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Software - Minor |
 |
Course Outline |
This course is explaining the development of object oriented software systems. Focuses
on analysis and design issues of object oriented systems. Explains development of
software architectures in the initial stages of the development activity. Introduces
component-based software development and design patterns. |
 |
Broad Course Contents
|
Fundamentals of Object Oriented Model. Objects, classes, data abstraction and message
communication, encapsulation, inheritance, object identity, polymorphism and dynamic
linking. Compositional structures: Inheritance / Template / Aggregation / Delegation.
Object Oriented Analysis (OOA). Object Oriented Design (OOD). Outstanding methodologies:
OMT, UML. Extensibility and reusability. Toolkits, Frameworks, Design Patterns.
Creational, Structural and Behavioral Patterns. Concurrent and Distributed OO Data
Models and Systems. Support languages: Java, C++, and Smalltalk.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite |
 |
Broad Course Contents
|
Information Representation, Binary number system and codes, Introduction to Boolean
Algebra, Logic Gates and Special Functions, Logic reduction techniques, Logic reduction
techniques continued, Don’t Cares, NAND and NOR implementations, Combinational Logic
Design concepts, Design methodology, HDL introduction, Code Converters, Encoders/Decoders,
Combinational Logic Building Blocks: multiplexers, demultiplexers, arithmetic circuits,
Combinational Circuit Design, Delays, Transient Operation, Hazards, Sequential Logic
Circuit Fundamentals, Flip Flops, characteristic tables, Sequential Circuit Analysis
and Design Techniques and HDL representation, Sequential Logic Building Blocks,
Registers and counters, Programmable Logic Devices; ROM, PAL, PLD and FPGAs, Design
of Large Complex Circuits (e.g. Digital Computer), Separation of Data and Control
path, Data path design, pipelined data path, the ALU, Control path design, State
machine design, Computer Architecture concepts, Instruction Set Architectures, CPU
designs; CISC and RISC, Computer Memory Organization; RAM, CACHE, Virtual Memory,
Bulk Storage, Input Output devices and Communication buses, PCI, DMA,
|
 |
Suggested Text
|
- M. Morris Mano and Charles R. Kime, Logic and Computer Design Fundamentals, Pearson
Education Inc.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite |
 |
Broad Course Contents
|
Continuous and Discrete time Signals, exponential and sinusoidal signals, unit step
Functions, continuous discrete time systems and their properties. Response of LTI
systems, Convolutional integral and summation, Properties of LTI systems, Difference
and differential system representations of causal systems. Response of LTI systems
to Complex exponentials, Fourier series representation and its properties (continuous
and discrete time), Filtering concepts and difference equation representations of
filters. Fourier representation of Aperiodic and periodic signals, properties of
Continuous time Fourier transform, Characterization of systems by linear constant
coefficient differential equations. Discrete time Fourier transform of periodic
and non-periodic signals, Properties of Discrete time Fourier transform, Characterization
of systems by linear constant coefficient differential equations. Sampling Techniques,
Sampling Theorem, Interpolation and Decimation, Aliasing and Signal Reconstruction
from its samples. Laplace Transform, ROC, Inverse Laplace Transform, Properties
of Laplace Transform, System function algebra and block diagram representation.
Z-transform, ROC, Inverse z-transform, properties of z-transform, analysis of LTI
systems using z-transform.
|
 |
Prerequisites
|
Working knowledge of Matlab programming and good background in Engineering mathematics
would be required.
|
 |
Suggested Text
|
- Signal & Systems, 2nd Edition, Alan V. Oppenheim, Alan V. Willsksy
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite |
 |
Course Outline
|
The course is aimed at setting up the foundation of Controls Concepts to Derive
dynamic models of engineering systems, Analyze the stability and performance of
a dynamic system in both frequency and time domain, Design controllers for SISO
systems in frequency and time domain, Aware of major controller implementation issues,
Design, implement and test controllers in a CAD framework. |
 |
Broad Course Contents
|
Dynamic System Modeling through Differential Equations. Motivation and Concept of
Laplace Transforms. Basic Transfer Function Modeling of Dynamic Systems. Frequency
domain parameters of a second Order System. Bode Analysis, Root Locus Analysis,
Nyquist Analysis, PID Controller Design, Lead-Lag Compensation,Discrete Time Controller
Design (Z- transform based), State Space Concepts, State Feedback Design, Observer
Design, Linear Quadratic Regulator.
|
 |
Prerequisites
|
Undergraduate level Mathematics, Command on any programming language.
|
 |
Suggested Text
|
- Modern Control Engineering (3rd Edition or higher ) by Katsuhiko Ogata, published
by Prentice-Hall, Inc., ISBN : 0-13-227307-1.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite |
 |
Course Outline
|
This course is an introduction to probability and random processes. The material
covered is of central importance to many fields within electrical engineering and
computer science including communications theory, communications networks and statistical
signal processing. |
 |
Broad Course Contents
|
Introduction to probability, finite sample spaces, conditional probability and independence,
one dimensional random variables, functions of random variables, two and higher
dimensional random variables, further characterization of random variables, The
Poisson and other discrete random variables, some important continuous random variables,
The Moment generating functions, sums of random variables and central limit theorem.
|
 |
Suggested Text
|
- Probability and Random Analysis for Engineers
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Network/ Comm
|
 |
Course Outline
|
Wireless Networks and Mobile Systems, GPRS, Optical Wireless Technology, UMTS, WCDMA,
EDGE, Designing a Wireless Network, Exploring the Design Process, Conducting the
Preliminary , Investigation, Performing Analysis of the Existing Environment, Cross
Layer Design Issues in Wireless Networks, Performance Objectives, Pitfalls of the
Cross-Layer , Design Approach, QoS Provisioning in Wireless Networks, Issues and
Challenges Involved in Providing QoS, Classification of QoS Solutions, QoS Model,
Wireless Environment and Architecture, Diversity of Wireless Environment, Ubiquitous
Computing, Info stations, Wire less Applications an overview, Communication for
Mobile People, Mobile People, Person Layer Requirement, Mobile People Architecture,
Wireless/Mobile Applications, Location and context aware pervasive computing, Service
discovery and the Service Location Protocol, Wireless Imaging, Terahertz Imaging,
Wireless Communication Trends and Challenges, Topological Design, Routing, and Handover
in Satellite Networks, Introduction, Network Mobility and Traffic Modeling, Topology,
Routing and Handover (in Satellite Networks)
|
 |
Prerequisites
|
Computer Networks
|
 |
Suggested Text
|
- Designing a Wireless Network by Jeffrey Wheat, Randy Hiser, Jackie Tucker.
-
Wireless Communication Systems by Xiaodong Wang, H. Vincent Poor
- Broadband Wireless
Mobile 3G and Beyond by Willie W. Lu, SIEMENS,
- Handbook of Wireless Networks
and Mobile Computing by Ivan Stojmenovic
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications
|
 |
Course Outline
|
This is a graduate-level course in internetwork design and architecture. It covers
addressing, binding, routing, internet and application protocols, principles, and
architecture of the global Internet. The focus is on the TCP/IP Internet Protocol
Suite. The goals are:
- To acquaint students with major internet protocols, their features, details, and
functionality
- To introduce students to the literature, and
- To show students principles and abstractions underlying design choices and the consequent
tradeoffs
Students will solve homework problems, read RFCs and other pertinent literature.
|
 |
Broad Course Contents
|
- Introduction to internetworking. Basic networking concepts. Review of network hardware.
Example networks including local and wide area networks (e.g., Ethernet and NSFnet/ANSNET
backbones). Packet types and packet decoding.
- Internet concept. The TCP/IP Internet abstraction and architectural model. Internet
addressing. Need for binding IP addresses. Dynamic binding and ARP protocol.
- Datagram concept and datagram format. Datagram (IP) routing. IP Connectionless delivery
service
- Error messages and error handling. ICMP protocol. Specifics of ICMP
messages
- Routers and datagram processing. Time-to-live. Datagram addresses and route destinations.
Host-specific routes. Default (wildcard) routes.
- Protocol layering. Purpose. Internet reference model.
- Transport protocols. User datagram protocol (UDP) and protocol port numbers.
- Reliable stream delivery service (TCP). Flow control, windowing, acknowledgments.
Three-way handshake. Protocol state diagram.
- Vector-distance and link-status routing algorithms. Route propagation. Core and
non-core internet routing architecture. Example of vector-distance protocols.
- Autonomous systems concept. Reachability advertisement, EGP protocol. Weaknesses
and alternatives. Path routing and BGP.
- Interior gateway protocols (e.g., RIP, HELLO, OSPF). Metric manipulation.
- Client-server model for applications. Examples. Domain name system (DNS).
- Other application-level services including: electronic mail (SMTP), file transfer
(FTP and TFTP), remote login (TELENT and rlogin).
- Network management (SNMP, ASN.1)
- IPv6 and related protocols
- Performance modeling and estimation
- Traffic
statistics and queuing analysis
- New research problems or topics.
Students will solve homework problems, read RFCs and other pertinent literature.
|
 |
Suggested Text
|
- Douglas E. Comer: Internetworking With TCP/IP Vol. 1: Principles, Protocols and
Architecture, Fifth Edition.
- Daniel Minoli, Andrew Schmidt: Internet Architectures
-
Behrouz A. Forouzan: TCP/IP Protocol Suite, Third Edition
- James F. Kurose, Keith
W. Ross: Computer Networking: A Top-Down Approach Featuring The internet, Third
Edition
- William Stallings: High Speed Networks and Internets
- Relevant
Request For Comments (RFC)
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications
|
 |
Course Outline
|
This course covers fundamental techniques in design and operation of first, second,
and third generation wireless networks: cellular systems, medium access techniques,
radio propagation models, error control techniques, handoff, power control, common
air protocols (AMPS, IS-95, IS-136, GSM, GPRS, EDGE, WCDMA, cdma2000, etc), radio
resource and network management.
|
 |
Broad Course Contents
|
- Introduction to wireless communication systems and networks.
- Cellular Wireless
Networks and System Principles.
- Antennas and Radio Propagation.
- Signal
Encoding and Modulation techniques Spread Spectrum.
- UTRA Spreading and Modulation,
Coding and Error Control.
- Multiple access techniques.
- 1G, 2G, and 2.5G
wireless systems (AMPS, GSM, GPRS, EDGE, etc).
- The UMTS network and radio access
technology.
- CDMA 2000.
- Soft handoff and power control.
- Wireless
LANs.
- IEEE 802.1x.
- Miscellaneous Topics.
- Project presentations.
|
 |
Prerequisites |
ECE 6602 Digital Communication, ECE 6607 Computer Networks
|
 |
Suggested Text
|
- T.S. Rappaport, "Wireless Communications: Principles
& Practice", Second Edition, Prentice Hall, 2002.
-
Simon Haykin & Michael Moher, "Modern Wireless Communications", Prentice Hall, 2004.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications |
 |
Course Outline
|
The course introduces frequency domain robust control concepts for MIMO systems.
Starting with SISO systems concepts like singular values, transmission zeros, stability,
performance specifications and disturbance attenuation are also introduced. After
going through loop-shaping and multivariable transmission zeros, state space realizations
of transfer functions is covered. These concepts and definitions are used to formulate
H2 and H¥ controllers. These controllers are synthesized with a treatise on stability
margins. Later on, m-Problem is defined and formalized.
|
 |
Broad Course Contents
|
The course is backed by the following case studies, which will run throughout the
course along with the development of the theoretical concepts: Control of longitudinal
dynamics of an aircraft, Control of a WindMill, Gen-Set Control, Automotive Control,
Missile Control, Nuclear Reactor Control.
|
 |
Prerequisites
|
ECE 6550 Linear Systems and Controls. Command on MATLAB/SIMULINK.
|
 |
Suggested Text
|
Airplane Control Systems; m-synthesis approach by L. Mangiasacale.
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Course Outline
|
The real analysis and / advanced calculus ( a composition of algebra and geometry)
are particularly very important in formulating the real world problems in almost
all the areas of science and technology.
|
 |
Broad Course Contents
|
Review of Basic Concepts of Algebra of the Set of Real Numbers, Euclidean Spaces,
Functions and Linear Transformations, The General Concept of limt, Sequences and
their Convergence, Continuity and Uniform Continuity of Functions, Continuous Functions
between the Euclidean Spaces, The Derivatives, Higher Order Derivatives and Taylor’s
Theorem, Maxima and Minima ( Method of Lagrange Multipliers), The Implicit function
theorem, Reimann Integration, Infinite series of real numbers and functions; Uniform
convergence, Improper Integrals;The Differential forms (if time permits).
|
 |
Suggested Text
|
- Multi-variable Calculus by Lawrance J. Crown & Robert, H.Szczarba, California Institute
of Technology (Marcel Dekker Inc.)
- Modern Mathematical Analysis by Murray, H. Protter & Charles B. Morrey (Addison-Wesley
Publishing company Inc.)
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Broad Course Contents
|
Ideas and techniques for designing, developing and modifying large software systems.
Functions oriented and object oriented modular approach designing for reuse and
maintainability. Specification and documentation. Verification and validation. Cost
and quality metrices and estimation. Project team organization and management.
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications |
 |
Course Outline
|
This course provides fundamental knowledge in the theory and practice of antennas
used in modern wireless telecommunication systems. It starts with an introduction
into the theory of electromagnetic radiation and a description of antenna parameters.
Antenna measurements are introduced in brief. After the students become familiar
with single radiators of geometry, they will be introduced into the principles of
analysis and design of antenna arrays. |
 |
Broad Course Contents
|
- Time varying fields
- Retarded potentials
- Poynting's theorem
-
Reciprocity. Regions of reactive, transition, and far-field. Ideal dipole
- Antenna
parameters: Directivity, Gain, and Aperture
- Dipole and loop antennas
-
Driving point impedance
- CEM techniques for antennas
- Balanced and unbalanced
antennas
- Antenna polarization
- Antenna temperature and noise
-
Aperture antennas
- Feed structures
- Antenna arrays
|
 |
Prerequisites
|
Undergraduate courses on electromagnetic field theory, microwave theory and techniques. |
 |
Suggested Text
|
- Stutzman, Warren L., and Gary A. Thiele, Antenna theory and design, 2nd edition.
-
Kraus, John D., and R.J. Marhefka, Antennas
2nd Edition McGraw-Hill - Balanis, Constantine A., Antenna Theory
2nd Edition Wiley - Elliott, Robert S., Antenna Theory and Design
IEEE press series on electromagnetic wave theory, Wiley-IEEE press
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications
(Also counted for Minor: Mathematics)
|
 |
Course Outline
|
To acquaint students with various ways to model stochastic phenomena in dynamic
systems. The interplay between the theoretical framework and practical applications
is crucial in this course.
|
 |
Broad Course Contents
|
- Introduction to Random Processes
- Characterization of Random Processes
-
The Complex Random Processes
- Mean, Correlation, and Covariance Functions
-
The Concept of Stationarity and Ergodicity
- Properties of Autocorrelation Function
-
Properties of Cross Correlation Function
- Periodic Random Processes
- Cyclostationery
Processes
|
 |
Prerequisites
|
- MATH 4601 Probability and Random Variables
- Courses in Calculus and Linear
Algebra
- Courses in both Discrete and Continuous Time Probability Theory
|
 |
Suggested Text
|
Probability, Random Variable, and Scholastic Processes, 2nd Edition. By Popoulis,
McGraw-hill. |
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications
|
 |
Course Outline
|
Packet Networks have taken over the circuit switched networks in the amount of global
data they handle. Circuit switched networks were designed to provide optimal quality
of service to applications needing dedicated network resources. On the contrary,
data services, that use most of the bandwidth today, present very different traffic
patterns hence requiring packet-switching for better network usage. The trend now
is to converge all services on to packet networks because of their lower initial
and maintenance costs. The course shall be highly biased towards the Internet Protocol
as the underlying transport mechanism.
|
 |
Broad Course Contents
|
The course will be divided in the following main parts.
The first part shall present a brief introduction to the packet networks, from physical
layer up to the transport layer, specifically focusing on Internet Protocol. Both
real-time and non-real-time applications and transport mechanisms shall be discussed.
The second part of the course shall focus on the signaling aspects. Connections
for various types of services use different protocols, examples include SIP for
voice and/or video connection requests and TCP for data.
The third part shall be devoted to the mechanisms that a router can use to control
traffic on a packet-by-packet basis. We shall also study the mechanisms that can
be used on IP flows for better traffic management, including new paradigms like
Multi Protocol Label Switching (MPLS). Service type requesting protocols and traffic
classification and control shall be discussed. This section shall address IETF standardized
IntServ and DiffServe paradigms as well.
The fourth, and the final part, shall focus on the applications, specifically, Voice
Over IP and Video Over IP. We shall walk through the design of a media gateway capable
of transporting voice calls to and from a circuit switched line to an Ethernet link.
Applications and Transport Protocols
We first briefly summarize the main requirements and characteristics of applications
running in IP networks. These applications are built on top of the TCP and RTP/UDP
transport protocols. A good understanding of the performance of these applications
requires a detailed knowledge of the mechanisms used by the underlying transport
protocols. TCP is the basis for almost all client-server applications in use today.
We thus describe in details the error, flow and congestion control mechanisms used
by all TCP implementations today and discuss their impact on traffic control mechanisms.
Multimedia applications on the other hand often rely on the RTP/UDP protocols whose
characteristics are completely different from those of TCP.
Signaling in Packet Networks
Signaling is used for setting up, tearing down, and monitoring network connections
besides other applications like routing, and management. This section shall describe
standardized / common call signaling protocols used in IP networks including H.323,
SIP, Megaco and RTSP. Call setup and tear down procedures while interworking with
the PSTN shall be discussed. Signaling gateway and Softswitch concepts shall also
be discussed.
Traffic Control and QoS
A first method to control IP traffic is to control individual IP packets inside
routers. In practice, a router may decide to delay, reorder or drop packets based
on various criteria. In this second part, we describe all these mechanisms in details
by building a QoS-enabled router step-by-step. These mechanisms include classification,
policing and marking (e.g. Token Bucket, Committed Access Rate), shaping, queueing
(per flow, per class), buffer acceptance (e.g. tail drop, Random Early Detection
(RED)) and scheduling (e.g. WFQ, DRR, fair queueing). In addition, we also discuss
two TCP specific mechanisms: Explicit Congestion Notification (ECN) and TCP rate
control.
A second method to control IP traffic is to control the traffic at the flow level
(e.g. all packets between two communicating applications). At this level, the network
can decide to accept or reject new flows based on the available resources inside
the network. We discuss the utilization of the RSVP protocol to dynamically establish
and release such flows.
In large networks, an important issue to be considered is how the IP traffic can
be distributed in an optimal way inside the network. Several solutions to this traffic
engineering problem have been proposed recently. We describe the IP-based solutions
such as Optimized MultipPath and the solutions based on MultiProtocol Label Switching
(MPLS).
Application Example
The goal of this section is to present, interactively, the design of at least one
example application. We plan to present the Design of a Media Gateway capable of
mediating voice calls between IP and PSTN. All required components needed to establish
such a service shall be discussed.
Student projects shall be presented in the class during the last week of the course.
|
 |
Prerequisites
|
ECE 6607 Computer Networks
|
 |
Suggested Text
|
Carrier Grade Voice Over IP, by Denniel Collins.
|
|
|
|
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Information Security / Computer Networks / Communications
|
 |
Course Outline
|
The Internet, as an open forum, has created security problems of confidentiality,
integrity & authentication. Network security is a set of protocols which protect
us against security attacks in Internet. The most common tool for providing network
security is cryptography, an old technique that has been revived and adapted to
network security. This course, therefore, first introduces the principles of cryptography
and then applies them to describe network security protocols |
 |
Broad Course Contents
|
- Information security overview : Goals, attacks, services,
mechanisms & techniques
- Mathematics for Symmetric
Key Cryptography: Modular Arithmetic, Congruence, Groups, Rings & Finite Fields.
- Traditional Symmetric Key Ciphers: Substitution, Transposition,
One time pad, Steganography
- Modern Symmetric Key
Ciphers: Block cipher, modes of operation, DES, triple-DES, AES, Stream cipher &
RC4
- Number Theory: Prim numbers, Euler’s theorem,
Primality testing, Factorization, Chinese remainder theorem, Discrete logarithm
- Asymmetric key cryptography: RSA, Elgamal & Elliptic
curve cryptosystem, Hash functions
- Message Integrity
& Authentication, MDC, MAC, HMAC & Digital Signature & Entity authentication
- Key Management: KDC, KERBEROS, Diffie-Hellman, CA, X.509
& PKI
- Security at Internet model layers: PGP & S/MIME
(Application layer), SSL & TLS (Transport layer), IPsec (Network layer)
-
Firewalls, IDS/IPS & Wireless Security Protocols
|
 |
Prerequisites
|
ECE 6607 Computer Networks
|
 |
Suggested Text
|
- Cryptography & Network Security;Principles & Practices (4th Ed) by William Stallings
- Cryptography & network Security by B. A. Forouzan
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Computer Networks / Communications
|
 |
Course Outline
|
The course objectives are to learn and understand the design; operation and management
of TCP/IP based intranets and Internets providing security. The intent is to apply
principles of cryptology and OS security toward secure networks. The course also
covers principles of computer systems security. It will also cover various attack
techniques and how to defend against them.
|
 |
Broad Course Contents
|
- General Introduction
- Network Security Overview
- Common Security Threats
- ARP/IP Address/DNS
Spoofing
- Anonymity/anti-anonymity(tracking)
- Virtual private networking
-
Network address translation and tunneling
- Network Layer Security
- Cryptography
- Message Confidentiality and Symmetric Encryption
- Message Authentication
-
Authentication and Encryption Protocols
- IPSEC, AH, ESP
- Public-Key Cryptography
-
Key management and use
- IKE/ISAKMP
- Network Management Security (SNMP)
- Transport Layer Security
- Application Layer Security
- Authentication Applications (Kerberos, X.509)
- Electronic Mail Security (PGP, S/MIME)
- System Security
- Intruders and intrusion detection
- Malicious Software (viruses)
- Firewalls and trusted systems
- Operating System Security
|
 |
Prerequisites
|
ECE 6607: Computer Networks (Students must have a thorough understanding of networks,
and the TCP/IP protocol suite, at the level of ECE 6607 Computer Networks course).
|
 |
Suggested Text
|
- William Stallings, Cryptography and Network Security, 3rd Edition, Prentice Hall
-
Ed Skoudis, Counter Hack - A Step by Step Guide to Computer Attacks and Effective
Defenses, First Edition 2002, Prentice Hall.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture
|
 |
Course Outline
|
The course provides an introduction to advanced principles and current practices
in computer architecture. It covers topics such as instruction set design, hardware
and software methods for exploiting parallelism, memory hierarchies, and input/output
systems. The course also introduces multiprocessor concepts but does not provide
an in-depth study of this area.
|
 |
Broad Course Contents
|
- Computer Organization review
- Instruction Set Design principles and MIPS
architecture
- Pipelining
- Basic pipelining
- Data and control Hazards
-
Exceptions
- Branch Prediction
- Speculation
- Instruction level Parallelism
-
Dynamic Scheduling
- Tomasulo algorithm
- Multiple instruction issue using
superscalar approach
- VLIW
- software based ILP
- Compilers and code
optimization
- Caches
- Cache basics
- Techniques to reduce miss rate
-
Techniques to reduce miss penalty
- Programming for memory performance
-
Main memory organization
- Virtual Memory and paging
- Storage devices
-
Beyond ILP: Future microprocessor architectures
|
 |
Prerequisites
|
You must understand basic machine organization, logic design and assembly language
programming. Basic operating system concepts would be helpful though not an essential
prerequisite.
|
 |
Suggested Text
|
Computer Architecture, Quantitative Approach, 3rd Edition, By Patterson & Hennesey
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Architecture
|
 |
Course Outline |
Linear time-invariant (LTI) systems, convolution sum, finite (FIR) and infinite
(IIR) impulse responses, difference equations, discrete-time Fourier transform (DTFT)
and its properties, z-transform (ZT) and its properties. Sampling of continuous-time
signal and sampling rate conversion: the sampling theorem and some of its variations,
reconstruction formulae, application to the discrete-time processing of continuous-time
signals, sampling rate conversion in mutilate systems, Transform analysis of LTI
systems: pole-zero representation for rational systems, study of various important
systems including all-pass system, inverse system and minimum-phase system. Structure
for discrete-time systems: signal flow graph representation, basic structures for
FIR and IIR systems (direct forms, parallel, cascade, etc.) transposition theorem,
effects of coefficient quantization on frequency response, round-off noise in digital
filtering. Filter design techniques: filter design as a numerical approximation
problem, transformation techniques for the design of IIR filters, FIR filter design
by windowing. Discrete Fourier transform (DFT): definition and properties of the
discrete Fourier series, definition of the DFT and its properties, application to
linear convolution. Computation of the DFT: the computational problem, most commonly
used Fast Fourier Transform (FFT) algorithms (radix-2, decimation-in-time, decimation
infrequency, etc.), possible generalizations and specializations.
|
 |
Prerequisites
|
- Basic concepts in Signals and Systems
- Frequency response of linear systems
-
Laplace and Fourier Transforms
|
 |
Suggested Text
|
- Oppenheim, Schafer, and Buck, "Discrete-Time Signal Processing," 2nd edition.
-
Statistical Digital Signal Processing and Modeling (Hardcover) by Monson H. Hayes.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
DSP / Architecture
|
 |
Course Outline |
Bayesian Decision Theory, - Minimum-Error-Rate Classification, - Classifiers, Discriminants,
and Decision Surfaces, - The Normal Density, - Error Probabilities and Integrals,
- Bayesian Belief Networks, Maximum Likelihood and Bayesian Estimation, - Maximum
Likelihood Estimation, - Bayesian Estimation, - Problems of Dimensionality, - Component
Analysis and Discriminants, - Expectation-Maximization (EM), - Hidden Markov Models,
Nonparametric Techniques, - Density Estimation, - Parzen Windows, - kn--Nearest-Neighbor
Estimation,- Fuzzy Classification, Linear Discriminant Functions, - Linear Discriminant
Functions and Decision Surfaces, - Gradient Descent Procedures, - Minimizing the
Perceptron Criterion Function, - Linear Programming Algorithms, - Support Vector
Machines, - Multicategory Generalizations, Multilayer Neural Networks, - Feedforward
Operation and Classification, - Backpropagation Algorithm, - Second-Order Methods,
Stochastic Methods, - Boltzmann Networks and Graphical Models, - Evolutionary Methods,
- Genetic Programming, Non parametric Methods, - Decision Trees, - CART, - Recognition
with Strings, - Grammatical Methods, - Rule-Based Methods, Unsupervised Learning
and Clustering, - Mixture Densities and Identifiability, - Unsupervised Bayesian
Learning, - Criterion Functions for Clustering, - Hierarchical and On-line clustering,
- Graph-Theoretic-Methods.
|
 |
Prerequisites
|
- ECE 6258 Digital Image Processing, (at least of bachelors level)
- Basic linear
algebra.
- MATH 4601 Probability and Random Variables, Matlab.
|
 |
Suggested Text
|
- Pattern Classification, By Richard O. Duda, Peter E. Hart and David G. Stork, 2nd
ed. John Wiley & Sons, New York, 2001.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Digital Signal Processing / Computer Architecture
|
 |
Course Outline
|
The Computer Vision course is basically designed for the students of Image processing,
Machine Vision, Robot Vision, and 3D graphics applications. In this course the geometric
relations between multiple views of scenes will be highlighted and taught in detail.
The objective is to enable the students to understand the general principles of
parameter estimation and to be able to compute scene and camera properties from
real world images using state-of-the-art algorithms.
|
 |
Broad Course Contents
|
- Background: Projective geometry (2D, 3D), Parameter estimation, Algorithm evaluation.
-
Single View: Camera model, Calibration, Single View Geometry.
- Two Views: Epipolar
Geometry, 3D reconstruction, Computing F, Computing structure, Plane and homographies.
-
Three Views: Trifocal Tensor, Computing T.
- More Views: N-Linearities, Multiple
view reconstruction, Bundle adjustment, auto-calibration, Dynamic SfM, Cheirality,
Duality
|
 |
Prerequisites
|
- ECE 6258 Digital Image Processing, (at least of Undergraduate(Bachelors) level).
-
Understanding of vectors and spaces
- Basic understanding of 3-D geometry
-
Matlab
|
 |
Suggested Text
|
-
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Control / Modeling and Simulation
(Also counted for Minor: Mathematics)
|
 |
Course Outline
|
The course covers Recap of matrix algebra, Linear spaces, Simultaneous Linear Equations,
Eigenvalues and Eigenvectors, Cayley-Hamilton theorem, Analysis of Continuous and
Discrete Time State Equations, Frequency domain system concepts, The Relationship
between State Variable and Transfer Function.
|
 |
Broad Course Contents
|
Background and review: Definition and types of systems, Mathematical modeling/ representation
of systems, Analysis methods in classical control theory, performance measures and
their improvement, State Space description of LTI dynamic systems: methods of obtaining
state space representation, Interconnection of subsystems, Concepts and techniques
of linear algebra: Review of matrix algebra, Vector and vector spaces, Basic vectors
and dimensionality, Orthogonal vectors and their construction, Eigen-vectors and
Eigen-values, Solution of simultaneous linear equations, Characteristic Polynomial
and Cayley- Hamilton Theorem, Analysis and design of continuous-time LTI systems
using state space: System modes and model decomposition, BIBO and internal stability,
Concepts of controllability, Observability, Stability and Detectability, Pole placement
using static output feedback, Design of reduced order and full state observers.
Extension of state-space concepts to LTI discrete time systems: Discrete time and
sampled data systems, State space representations, Analysis and design of discrete
time systems using state space techniques. |
 |
Prerequisites
|
ECE 4501 Control Engineering.
|
 |
Suggested Text
|
- Modern Control Theory, By William L. Brogan
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Mathematics
|
 |
Broad Course Contents
|
Topics covered in this course are: Classical Optimization Techniques with equality
constraints (e.g. Lagrange Multipliers etc) for 1 variable, two variables and many
variables, Linear Programming, Integer Programming, Assignment problem, Transportation
problem, PERT, CPM, Misc. topics in optimization techniques.
|
 |
Suggested Text
|
- Taha, H. A., Operations Research: An Introduction, 7th ed., Prentice Hall, 2002.
-
Hillier, F. S., Introduction to Mathematical Programming, John Wiley and Sons, 1998.
-
Reklaitis, G. V., Engineering Optimization: Methods and Applications, John Wiley,
1983.
- Chong, E. K. P. and Zak, S. H., An Introduction to Optimization, 2nd ed.,
John Wiley and Sons, 2004.
- Fletcher, R., Practical Methods of Optimization,
2nd ed., John Wiley and Sons, 2004.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite
|
 |
Course Outline
|
The objective of this course is to provide an introduction to the to the basic principles
in the design and analysis of communication systems and would cover theoretical
as well as mathematical foundational topics for frequency domain analysis of signals
and systems, analog signal transmission/reception and digital communication techniques.
|
 |
Broad Course Contents
|
Introduction to Communications, Frequency Domain Analysis, - Fourier Series, - Fourier
Transforms, - DFT/FFT, - Bandpass Signals, Analog Communication systems, Amplitude
Modulation, - Angle Modulation, - Radio and Television Broadcasting, Random Processes,
Probability and Random Variables, - Random Processes: Concepts, Noise and Communication
Systems, Information Sources and Source Coding, Digital Transmission through AWGN
Channels, - Optimal Receiver Design, - Probability of Error, - Symbol Synchronization,
Wireless Communications .
|
 |
Prerequisites
|
The pre-requisite is undergraduate level Signals and Systems Course.
|
 |
Suggested Text
|
- Communication Systems, By B.P Lathi
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Minor: Software
|
 |
Course Outline
|
This course explores the field of computer operating systems, emphasizing on basic
operating systems design principles and implementation details. Our focus will be
on two main aspects: First is the engineering and performance trade-offs in the
design of operating systems. The idea is to learn not only what operating systems
are and how they work today, but also why they are designed the way they are and
how they are likely to evolve in the future. The course will cover traditional OS
materials such as scheduling and synchronization, multiprogramming, memory management,
file system, protection and security. However, the material will be covered at a
more advanced level than a typical undergraduate operating systems course. The central
case study will be Linux 2.6 Kernel, although we will also discuss Windows and other
operating systems for comparative purposes. Additionally, we will touch a few advanced
topics including micro-kernel OS, virtual machines, and OS support for highly concurrent
online servers.
The second main focus will be on the implementation aspect. We will have hands-on,
rigorous programming projects based on the Linux kernel. The projects would carry
significant programming work-load and cover various sub-systems of a real-world
operating system. The projects will be done in teams of two or three.
|
 |
Broad Course Contents
|
- Introduction
- OS architectures
- Processes, threads and system calls
-
Concurrency and Synchronization
- Scheduling
- Deadlock
- Memory management
techniques
- Virtual memory systems
- I/O management (Device driver architectures)
-
File systems (Design and case studies)
- Security, Access control and authentication
-
Introduction to Distributed Systems
- Distributed file systems
- Virtual
machine monitors
|
 |
Prerequisites
|
C Language.
|
 |
Suggested Text
|
-
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Pre-Requisite Course
|
 |
Broad Course Contents
|
Data Communication Networks: Introduction to basic networking elements, OSI Layers,
TCP/IP suit, Data transmission(Analog and Digital), Transmission Media, Data Encoding
and Transmission, Multiplexing, Spread Spectrum, Circuit switching, Packet switching,
Cellular System, Cable Networks, Error Detection and Correction , Congestion Control
and Flow Control Methods, Medium Access Methods, Network (packet) Routing Algorithms
, Wired and Wireless LAN, Frame Relay, ATM(Asynchronous Transfer mode), Network
Layer(logical addressing and Interworking), IPv4, IPv6, TCP,UDP,SCTP, SONET/SDH,
DNS(Domain Name System), QoS.
|
 |
Prerequisites
|
The pre-requisite is undergraduate level Signals and Systems Course.
|
 |
Suggested Text
|
- W. Stallings, Data and Computer Communications
- A. S. Tanenbaum, Computer Networks
- L. Peterson and B. Davie, Computer Networks
-
William M. Hancock, Computer Communication and Networking Technologies
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Communications
|
 |
Course Outline
|
This course develops the foundation for advanced courses in the areas of electromagnetic
wave propagation and cattering, antennas and microwave engineering. Brief course
description is as follows:
Review of basic electromagnetic theory, solutions to the wave equation. Plane wave
propagation and polarization. Reflection and transmission of waves. Vector Potentials
and radiation equations, electromagnetic field theorems. Waveguides and resonators.
|
 |
Broad Course Contents
|
- Review of basic electromagnetic theory
- Wave equation in different coordinate systems
- TEM wave propagation
- Polarization (linear, circular, elliptical) and its representation in the complex
plane.
- Reflection and transmission of waves (Fresnel Coefficients)
- Reflection and transmission from multiple interfaces
- Vector potentials and construction of solutions
- Electromagnetic fields theorems
- Dielectric waveguides and cavities
- Introduction to electromagnetic scattering
|
 |
Prerequisites
|
Vector calculus, undergraduate course in electromagnetic field theory.
|
 |
Suggested Text
|
- C. A. Balanis, "Advanced Engineering Electromagnetics", John Wiley & Sons 1998.
-
R. F. Harrington, "Time Harmonic Electromagnetic Fields", McGraw Hill 1961 & 2001.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Information Security
|
 |
Course Outline
|
The course focuses on the security of computer systems at various layers of operating
system & application software. The course includes the security aspects of contemporary
advanced operating systems and database systems.
|
 |
Broad Course Contents
|
programs, non-malicious program errors, malicious code, targeted code, covert channels,
Controls against program threats. Protection in general purpose operating systems:
Object & methods protection, memory & address protection, Access control to objects,
file protection mechanism & user authentication. Trusted Operating Systems: Meaning,
security policies, models of security, designing TOS, Assurance in TOS, Database
& Data Mining Security: concepts, requirements, reliability, integrity & sensitivity
of data, inference, multilevel security & data mining security
|
 |
Prerequisites
|
Understanding of computer architecture & Operating System.
|
 |
Suggested Text
|
- Introduction to Computer Security by M. Bishop
- 2. Security in Computing (4th Ed) by C.P.P fleeger & S.L.P fleezer.
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Software - Minor
|
 |
Course Outline
|
Real-time applications / systems are characterized by the strict requirements imposed
on timely and/or periodic execution of tasks and the fast response to certain asynchronous
events. Design of such systems require special skills/techniques which are seldom
known/practiced by people developing non real-time applications on PCs and workstations
such as word-processors, network browsers, accounting and database packages, etc.
|
 |
Broad Course Contents
|
Scope of real-time systems, Hard versus Soft real-time systems, Reference model
of real-time systems, Classical fore-ground/ back-ground programming technique,
Contemporary approach using RTOS, Real-time scheduling schemes, their merits and
demerits, Multiprocessor scheduling and synchronization, Real-time communication
applications, Survey of commercially available RTOSes.
|
 |
Prerequisites
|
C Language
|
 |
Suggested Text
|
- Real-time Systems, Jane W. S.LIU
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
DSP / Architecture
|
 |
Course Outline
|
- Parallel Computing:Motivation & Scope
- Platforms: architecture, pipeline,
superscalar, VLIW., Interconnection networks, Cache coherence & I/O disk arrays,
, Communication models, Shared memory, Message passing & PRAM platforms, SIMD/ MIMD/
SPMD & Cluster systems.
- Communication operations on various topologies, ring,
mesh, tree, hypercube etc & Performance evaluation.
- Parallel algorithms design:
Models, Decomposition, Interaction & Mapping.
- Parallel programming paradigms:
Message Passing & Share Memory platforms, MPI, Pthread & OpenMP.
- Parallel Algorithm
applications: Sorting/ Searching, Matrix Operation, Graph algorithms, Image processing
& Fast Fourier Transform
- Distributed Systems: Architectural styles, middleware,
process threads, code migration, layered comm. protocol, remote procedure calls,
message/ stream oriented comm, Flat & Structured Naming, Clock synchronization,
Mutual exclusion, Election algorithm, Consistency & Replication models & management,
Security issues, Distributed Web based system.
|
 |
Prerequisites
|
Computer Architecture, Data structures & algorithms, Programming in C/C++
|
 |
Suggested Text
|
- Introduction to Parallel Computing (2nd Ed) by Ananth Grama, Anshul Gupta,
George Karypis, Vipin Kumar
- Distributed Systems: Principles & Paradigms (2nd Ed) by Andrew S Tanenbaum
& Maarten Van Steen
- Parallel Programming: Techniques & applications using networked
workstations & parallel computers (2nd Ed) by Barry Wilkinson & Michael
Allen
|
|
|
|
|
|
 |
Credit Hours |
3 semester credit hours |
 |
Area of Specialization |
Information Security
|
 |
Course Outline
|
- Information Security vulnerabilities & risks
- Risk assessment
- Analysis,
control & management
- Security techniques
- Security plan/ policy design
-
Security standards compliance
- Security Audit
- Incident handling
-
Disaster recovery & continuity planning
- Legal, Privacy
- Cost & technology
constraints
- Information security solution implementation issues
|
 |
Prerequisites
|
Understanding of computer & network security
|
 |
Suggested Text
|
- Principles of Information Security (2nd Ed) by M.E.Whitman & H.J.Mattord
- NIST(USA) Handbook & SP 800-xx publications
- International ISMS Standard
ISO/IEC 27001
|
|
|
|