Class 3. P: ECE 30100 and ECE 36500. A treatment of Voice and Video over IP and wireless communication algorithms, protocols, standards and implementation using multicore digital signal processors and communications processor modules. Discussion of voice over IP and wireless communication algorithms, protocols and standards, and advanced wireless and voice over IP applications.
P: ECE 30100 and ECE 36200, or Graduate Standing. Class 3. Treatment of multimedia algorithms and their hardware and software implementations using FPGA and ASIC. Detailed discussion of entropy coding, transform coding, speech compression, image compression, and video compression.
P: ECE 44000 or Graduate Standing. Class 3. Introduction to digital communication systems and spread spectrum communications. Analog message digitization, signal space representation of digital signals, binary and M-ary signaling methods, detection of binary and M-ary signals, comparison of digital communication systems in terms of signal energy and signal bandwidth requirements. The principal types of spread-spectrum systems are analyzed and compared. Application of spread spectrum to multiple-access systems and to secure communication systems is discussed.
P: ECE 30200 or Graduate Standing. Class 3. A qualitative and quantitative study of issues in design, analysis, and operation of computer communication and telecommunication networks as they evolve toward the integrated networks of the future, employing both packet and circuit-switching technology. Packet and circuit switching, the OSI standards for architecture and protocols, elementary queuing theory for performance evaluation, random access techniques, local area networks, reliability and error recovery, and integrated networks.
P: ECE 38200 or Graduate Standing. Class 3. Basic components of robotic systems; selection of coordinate frames; homogeneous transformations; solutions to kinematics of manipulator arms; velocity and force/torque relations; dynamic equations using Euler-Lagrange formulation; digital simulation of manipulator motion; motion planning; obstacle avoidance; controller design using torque method; and classical controllers for manipulators. Lab experiments and final project required.
The first third of the course covers functional and symbolic programming, symbolic evaluation, and rewrite systems, and their application to tasks such as symbolic mathematics and simulation of digital systems. The second third of the course covers nondeterministic programming and constraint satisfaction problems and their application to tasks such as parsing, scene labeling, qualitative physics, and multiple fault diagnosis. The last third of the course covers automated reasoning including techniques such as semantic tableaux, resolution, and congruence closure.
Class 3. P or C: Graduate standing or consent of instructor. Introduction to the mobile computing and the principles to design and implement application system for a smart device, including mobile computing architecture, mobile and pervasive computing environments, applications and services, context-aware computing, and human-computer interaction.
Engineering applications of probability theory. Problems of events, independence, random variables, distribution and density functions, expectations, and characteristic functions. Dependence, correlation, and regression; multivariate Gaussian distribution. Stochastic processes, stationarity, ergodicity, correlation functions, spectral densities, random inputs to linear systems, Gaussian processes.
Basic principles of static and electromechanical energy conversion. Control of static power converters. Reference frame theory applied to the analysis of rotating devices. Analysis and dynamic characteristics of induction and synchronous machines. State variable analysis of electromechanical devices and converter supplied electromechanical drive systems. Typically offered in the Fall.
This course introduces the basic concepts of cryptography. Various encryption systems and cryptographic protocols are presented including transposition and substitution systems, block ciphers, stream ciphers, and public-key cryptosystems. The background and the design criteria of cryptographic protocols and ciphers are discussed in detail. Methods used to attack ciphers will be discussed as well as remedies. Within the course we will develop the mathematical tools that are needed. We will discuss how cryptography a_ects many of the communication protocols that are commonly used.
Introduction to the basic concepts and various approaches of pattern recognition and decision making process. The topics include various classifier designs, evaluation of classifiability, learning machines, feature extraction and modeling.
Theoretical methods in optimal control theory. Topics include the calculus of variations and the Pontryagin minimum principle with applications to minimum energy problems. Geometric methods will be applied to the solution of minimum time problems. Computational methods, singular problems, observer theory, and sufficient conditions for existence of solutions are also discussed.
The course will explore the fundamental issues emerged from a booming wireless communication technology. Topics will include 802.11 and various issues in ad-hoc and sensor networks, including power management, coverage, topology and location discovery. Students are expected to read two or three articles per week, to participate in discussions, to present their findings.
Purdue School of Engineering & Technology social media channels