# Educational Activities in TUC/TELECOM

## Courses Taught

## Graduate Courses

TEL 601: Probability and Random Processes

Instructor:George KarystinosAxioms of probability, independence, conditional probability, random variables, distribution. Expectation, functions of a random variable, joint and conditional densities. Convergence of random sequences, limit theorems, Chernoff bound, Markov/Chebyshev/Jensen inequalities, the weak and strong laws of large numbers. Random vectors, covariance and correlation, transformation of random vectors, Gaussian vectors. Likelihood, ML estimation, MMSE estimation, bias, Cramer–Rao bound. Random processes, correlation functions, stationarity, joint properties of random processes. Bernoulli process, Poisson process, random walk, Brownian motion. Linear systems with random inputs, spectral analysis and estimation. Baseband/narrowband processes, optimal linear systems, Wiener filter, Kalman filter. Markov chain, limiting behavior, application to queuing theory, hidden Markov models. Markov process, birth and death process, renewal process, semi–Markov process

TEL 603: Estimation and Detection Theory

Instructor:Aggelos BletsasIntroduction to estimation theory. Minimum variance unbiased estimation (MVUE). The Cramer–Rao lower bound (CRLB). Linear models. Best linear unbiased estimation (BLUE). Sufficient statistics. Maximum Likelihood Estimation (MLE). Least–squares estimation. Method of moments. Bayesian estimation. Linear MMSE estimation. Introduction to detection theory. Hypothesis testing: simple hypothesis testing (Bayes, minimax, and Neyman–Pearson decision criteria), composite hypothesis testing (generalized likelihood ratio). Detection of signal in noise, detection of signal with unwanted parameters.

TEL 612: Convex Optimization

Instructor:Nikos SidiropoulosConvex functions and their properties; convex optimization problems and examples. Linear programming, linear fractional programming, quadratic optimization, quadratically constrained quadratic programming, second–order cone programming. Geometric programming, semi–definite programming. Duality: Lagrange dual and KKT conditions. Unconstrained convex minimization: descent direction, line search, gradient descent, steepest descent, Newton’s method, damped Newton method, quasi–Newton methods. Convergence and complexity results. Interior point algorithms. Lagrangian relaxation of non–convex problems. Applications in signal processing, communications, networking are discussed throughout the course; application examples include power control, max–flow min–cut, beamforming, MIMO detection.

## Undergraduate Courses

TEL 201: Signals and Systems

Instructor:George KarystinosSignals, systems, signal processing, continuous and discrete time signals, periodic and aperiodic signals, energy and power signals. Continuous and discrete time systems, analysis of linear time–invariant systems, convolution, input–output stability (BIBO).Study of signals and systems with the use of MATLAB.Sinusoidal signals, harmonically related signals, Fourier series of a periodic signal. Continuous–time Fourier transform, properties and applications of Fourier transform, Fourier transform of a periodic continuous–time signal, discrete–time Fourier transform, Nyquist sampling theorem. Amplitude modulation, frequency multiplexing, angle modulation, applications of modulation in telecommunications systems, AM and FM. Laplace transform, region of convergence, inverse Laplace transform, properties and applications of Laplace transform.

TEL 301: Telecommunications Systems I

Instructor:Athanasios LiavasBenefits of digital transmission and storage. The AWGN channel and Shannon's capacity formula ramifications. Analog to digital conversion. Sampling theorem, uniform quantization, optimal quantization and the Lloyd-Max algorithm. Companders, PCM, DPCM, Delta modulation, adaptive Delta modulation. Elements of digital transmission. Geometrical view of signal space: modulation, signal dimension, basis functions. The demodulation process: matched filtering, correlation receiverfront-end. Principles of detection, minimum probability of error detection. Specific modulation formats: PAM, PSK, QAM, orthogonal modulation. Analytical computation of symbol and bit error rates, Monte-Carlo simulation, comparisons; energy-versus bandwidth-limited communication, and the Shannon limit.

TEL 303: Telecommunications Systems II

Instructor:Aggelos BletsasElements of Probability Theory (brief presentation). Stochastic processes, mean, autocorrelation function. Stationary stochastic processes, power spectral density, sampling. Stationary stochastic processes and linear time invariant systems. Cyclostationary processes. Power spectral density of cyclostationary processes. Signal transmission through a bandlimited channel, intersymbol interference, Nyquist pulses. Optimal receivers for ideal bandlimited channels, square root raised cosine pulses. Least squares, channel estimation. Linear Equalization, equalization Viterbi. Adaptive algorithms, adaptive equalization, LMS algorithm. Phase synchronization (Phase–Locked–Loop, PLL). Symbol synchronization. Frame synchronization. Low-pass equivalent representation of signals and channels. Elements of information theory (entropy, mutual information), channel capacity. Link budget.

TEL 412: Analysis and Design of Telecommunication Devices

Instructor:Aggelos BletsasConnection, Composition, and Complementation (3C) of basic telecommunications engineering knowledge along with experimental practice in a real environment. Data transceivers and system parameters. Receiver parameters: noise figure, compression point (IP2), intermodulation and third-order intercept point (IP3), spurious receiver response. Transmitter parameters: frequency stability and spurious signals, output power efficiency, intermodulation, crystal reference oscillators, PLLs. Theoretical elements of waves, transmission lines, and antennas. Synthesis of telecommunications devices: super-heterodyne receiver or GPS receiver. Software Defined Radio (SDR): basic characteristics and limitations. Laboratory exercises: implementation of MSK modulation on a microprocessor, low-cost implementations, high-performance digital link (embedded SDR), and project realization on printed circuit (PCB).

TEL 413: Introduction to Convex Optimization

Instructor:Nikos SidiropoulosIntroduction and examples - motivation for studying optimization theory and algorithms. Linear programming, geometric viewpoint, the simplex method and applications. Maximum flow and minimum cost flow in networks. Linear programming with integer constraints: modeling, relaxation, branch & bound and applications. Dynamic programming and the shortest path problem in acyclic graphs. Unconstrained convex minimization. Preview of modern convex optimization.

TEL 418: Computer Networks II

Instructor:Aggelos BletsasIntroduction to computer networks and the Internet. Application layer: network application principles, examples of network applications and their protocols (the Web and HTTP, file transfer and FTP, electronic mail and SMTP, the Internet’s directory service and DNS), content distribution (web caching, content distribution networks, peer–to–peer systems). Transport Layer: principles and services, connectionless transport and UDP, principles of reliable data transfer, connection–oriented transport and TCP, principles of congestion control, TCP congestion control. Network layer: network service models, routing principles, hierarchical routing, the Internet Protocol (IP), routing in the Internet, router architecture, multicast routing, mobility support and Mobile IP. Multimedia networking: networking applications, streaming stored audio and video, limitations of Internet’s best–effort service, protocols for real–time interactive applications (RTP, SIP and H.323), principles for providing Quality of Service guarantees, scheduling and policing mechanisms, integrated and differentiated services, RSVP. Security in computer networks: definition, principles of cryptography (symmetric key and public key cryptography), authentication, data integrity, key distribution and certification, access control (firewalls), attacks and countermeasures, secure E–mail and PGP, transport layer security, network layer security and IPsec. Introduction to computer network management: infrastructure for network management, the Internet–standard management framework and SNMP.

USRP: Universal Software Radio Peripheral

Instructor:Athanasios Liavas

The USRP1 is the original Universal Software Radio Peripheral™ hardware (USRP) that provides entry-level RF processing capability. It is intended to provide software defined radio development capability for cost-sensitive users and applications. The architecture includes an Altera Cyclone FPGA, 64 MS/s dual ADC, 128 MS/s dual DAC and USB 2.0 connectivity to provide data to host processors. A modular design allows the USRP1 to operate from DC to 6 GHz. The USRP1 platform can support two complete RF daughterboards. This feature makes the USRP ideal for applications requiring high isolation between transmit and receive chains, or dual-band dual transmit/receive operation. The USRP1 can stream up to 8 MS/s to and from host applications, and users can implement custom functions in the FPGA fabric. (source: Ettus Research) The USRP B100 provides low-cost RF processing capability, and is intended for cost-sensitive applications requiring exceptional bandwidth processing capability and dynamic range. The USRP B100 architecture includes a Xilinx® Spartan® 3A 1400 FPGA, 64 MS/s dual ADC, 128 MS/s dual DAC and USB 2.0 connectivity to provide data to host processors. A modular design allows the USRP B100 to operate from DC to 6 GHz. The USRP B100 includes External Reference Input and 1 PPS inputs for synchronization. The USRP B100 can stream up to 8 MS/s to and from host applications, and users may implement custom functions in the FPGA fabric. (source: Ettus Research)