Download Syllabus

SEMESTER I
11PSM101 APPLIED MATHEMATICS FOR ELECTRONICS ENGINEERS
(Common to M.E. Communication Systems and Applied Electronics)
L
3
T
1
P
0
C
4
Course Objectives
To provide strong foundation to the students to expose various emerging new areas of applied
mathematics and appraise them with their relevance in Engineering and Technological field.
UNIT- I
LINEAR ALGEBRA
(9)
Vector spaces and sub spaces–Null spaces, column spaces and linear transformations–Linear
independent sets; Bases-Coordinate systems–Dimensions of a vector space–Rank-Change of
basis-Inner product, Length and Orthogonality–Orthogonal sets–Orthogonal projections–GramScimidt Process.
UNIT- II
WAVE EQUATION
(9)
Solution of initial and boundary value problems–Characteristics–D’Alembert’s Solution–
Significance of characteristic curves–Laplace transform solutions for displacement in a long
string–Free vibrations of a string.
UNIT– III
SPECIAL FUNCTIONS
(9)
Bessel’s equation–Bessel Functions–Legendre’s equation–Legendre’s polynomials–Rodrigue’s
formula–Recurrence relations–generating functions and orthogonal property for Bessel
functions.
UNIT- IV
STOCHASTIC PROCESSES
(9)
Random Variable – Moments and MGF–Binomial, Poisson, Normal Distributions (Concepts only).
Introduction and classification of stochastic processes, possion processes-Discrete marginal chain,
Computation of n-step transition probalities,state classification and continuous time Markov chainBirth and death processes, pure birth processes and death process applications.
UNIT -V
QUEUEING THEORY
(9)
Markovian models – Birth and Death Queuing models- Steady state results: Single and multiple
server queueing models - queues with finite waiting rooms - Finite source models - Little’s
Formula, M/G/1 queue (steady state solutions only),Pollaczek – Khintchine formula.
TOTAL HOURS: 45 + 15=60
REFERENCES:
1.David C Lay, “Linear Algebra and its Applications”,Pearson Education Asia,NewDelhi,2003
2. Greweal B.S. “Higher Engineering Mathematics”, Khanna Publishers, 2005
3. K.S. Trivedi, “Probability and Statistics with Reliability, Queueing and Computer Science
Applications”, John Wiley and Sons, 2nd edition, 2002
4. Sankara Rao.K. “Introduction to Partial Differential Equation “, PHI, 1995.
5. D.Gross and C.M. Harris, “Fundamentals of Queueing Theory”, Wiley Student edition, 2004.
11PBK101
ADVANCED DIGITAL SIGNAL PROCESSING
(Common to M.E. Communication Systems and Applied Electronics)
L
3
T
1
P
0
C
4
Course Objectives
At the end of the course, student should be able to know
 Discrete Random Signal Processing
 Spectrum Estimation ,Linear Estimation and Prediction
 Adaptive Filtering Concepts & Multirate Signal Processing Concepts
{Review of discrete-time signals and systems- DFT and FFT, Z-Transform, Digital Filters is
recommended}
UNIT-I
DISCRETE RANDOM SIGNAL PROCESSING
(9)
Discrete Random Processes- Ensemble averages, stationary processes, Autocorrelation and Auto
covariance matrices. Parseval's Theorem, Wiener-Khintchine Relation- Power Spectral Density
Periodogram, Spectral Factorization, Filtering random processes. Low Pass Filtering of White
Noise. Parameter estimation: Bias and consistency.
UNIT-II
SPECTRUM ESTIMATION
(9)
Estimation of spectra from finite duration signals, Non-Parametric Methods-Correlation Method,
Periodogram Estimator, Performance Analysis of Estimators -Unbiased, Consistent EstimatorsModified periodogram, Bartlett and Welch methods, Blackman –Tukey method. Parametric
Methods - AR, MA, ARMA model based spectral estimation. Parameter Estimation -YuleWalker equations, solutions using Durbin’s algorithm
UNIT-III
LINEAR ESTIMATION AND PREDICTION
(9)
Linear prediction- Forward and backward predictions, Solutions of the Normal equationsLevinson- Durbin algorithms. Least mean squared error criterion -Wiener filter for filtering and
prediction , FIR Wiener filter and Wiener IIR filters ,Discrete Kalman filter
UNIT-IV
ADAPTIVE FILTERS
(9)
FIR adaptive filters -adaptive filter based on steepest descent method-Widrow-Hoff LMS
adaptive algorithm, Normalized LMS. Adaptive channel equalization-Adaptive echo
cancellation-Adaptive noise cancellation- Adaptive recursive filters (IIR). RLS adaptive filtersExponentially weighted RLS-sliding window RLS.
UNIT-V
MULTIRATE DIGITAL SIGNAL PROCESSING
(9)
Mathematical description of change of sampling rate - Interpolation and Decimation, Decimation
by an integer factor - Interpolation by an integer factor, Sampling rate conversion by a rational
factor, Filter implementation for sampling rate conversion- Direct form FIR structures,
Polyphase filter structures, time-variant structures. Multistage implementation of multirate
system. Application to sub band coding - Wavelet transform and filter bank implementation of
wavelet expansion of signals.
TOTAL HOURS=45+15=60
REFERENCES:
1. Monson H.Hayes, “Statistical Digital Signal Processing and Modeling”, John Wiley and Sons,
Inc.,Singapore, 2002.
2. John G.Proakis, Dimitris G.Manolakis, “Digital Signal Processing”, Pearson Education, 2002.
3. John G.Proakis et.al.,”Algorithms for Statistical Signal Processing”, Pearson Education, 2002.
4. Dimitris G.Manolakis et.al.,”Statistical and adaptive signal Processing”, McGraw Hill,
Newyork,2000.
11PBK102
DIGITAL COMMUNICATION TECHNIQUES
L T
3
1
P
0
C
4
Course Objectives
 To learn the fundamental digital techniques for Communication.
 DF Representation of Signal
 Coding theory and Modulation and M'ary signaling
UNIT-I
POWER SPECTRUM AND COMMUNICATION
(9)
PSD of a synchronous data pulse stream; M-ary Markov source; Convolutionaly coded
modulation; CPM–Scalar and vector communication over memoryless channel-Detection
criteria.
UNIT-II
COHERENT AND NON-COHERENT COMMUNICATION
(9)
Coherent receivers–Optimum receivers in WGN– IQ modulation & demodulation–Noncoherent
receivers in random phase channels; M-FSK receivers–Rayleigh and Rician channels–Partially
coherent receives–DPSK; M-PSK; M-DPSK,-BER Performance Analysis.
UNIT-III
BANDLIMITED CHANNELS AND DIGITAL MODULATIONS (9)
Eye pattern; demodulation in the presence of ISI and AWGN; Equalization techniques – IQ
modulations; QPSK; QAM; QBOM; -BER Performance Analysis–CPM; CPFM; CPFSK;
MSK,OFDM.
UNIT-IV
BLOCK CODED DIGITAL COMMUNICATION
(9)
Architecture and performance–Binary block codes; Orthogonal; Biorthogonal; Transorthogonal–
Shannon’s channel coding theorem; Channel capacity; Matched filter; Concepts of Spread
spectrum communication–Coded BPSK and DPSK demodulators – Linear block codes;
Hammning; Golay; Cyclic; BCH ; Reed–Solomon codes.
UNIT-V
CONVOLUTIONAL CODED DIGITAL COMMUNICATION
(9)
Representation of codes using Polynomial, State diagram, Tree diagram, and Trellis diagram–
Decoding techniques using Maximum likelihood, Viterbi algorithm, Sequential and Threshold
methods–Error probability performance for BPSK and Viterbi algorithm, Turbo Coding.
TOTAL HOURS=45+15=60
REFERENCES:
1. M.K.Simon, S.M.Hinedi and W.C.Lindsey, “Digital communication techniques; Signalling
and Detection”, Prentice Hall India, New Delhi. 1995.
2. Simon Haykin, “Digital communications”, John Wiley and sons, 1998
3. Wayne Tomasi, “Advanced electronic communication systems”, 4th Edition Pearson
Education Asia, 1998
4. B.P.Lathi,” Modern digital and analog communication systems”, 3rd Edition, Oxford
University press 1998.
5. John G. Proakis, “Digital Communications”, 4th Edition, McGraw-Hill, New york , 2001
11PBK103
DIGITAL IMAGE PROCESSING
L
3
T
0
P
0
C
3
Course Objectives
 Since image processing is an upcoming embedded field wherein many small systems and
robots are built with image processing functions we give in this subject an idea of image
processing concepts.
 To make the student learn: Basic image processing operations and concepts, multi
resolution analysis and to make a few case studies.
UNIT-I
DIGITAL IMAGE FUNDAMENTALS
(9)
Elements of digital image processing systems, Elements of visual perception, psycho visual
model, brightness, contrast, hue, saturation, mach band effect, Color image fundamentals RGB,HSI models, Image acquisition and sampling, Quantization, Image file formats, Twodimensional convolution, correlation, and frequency responses.
UNIT-II
IMAGE TRANSFORMS
(9)
1D DFT, 2D transforms – DFT, DCT, Discrete Sine, Walsh, Hadamard, Slant, Haar, KLT, SVD,
Radon, and Wavelet Transform.
UNIT-III
IMAGE ENHANCEMENT AND RESTORATION
(9)
Histogram modification and specification techniques, Noise distributions, Spatial averaging,
Directional Smoothing, Median, Geometric mean, Harmonic mean, Contra harmonic filters,
Homomorphic filtering, Color image enhancement. Image Restoration – degradation model,
Unconstrained and Constrained restoration, Inverse filtering, Wiener filtering, Geometric
transformations – spatial transformations, Gray- Level interpolation,
UNIT-IV
IMAGE SEGMENTATION AND RECOGNITION
(9)
Edge detection. Image segmentation by region growing, region splitting and merging, edge
linking, Morphological operators: dilation, erosion, opening, and closing. Image Recognition –
Patterns and pattern classes, matching by minimum distance classifier, Statistical Classifier.
Matching by correlation, Neural network application for image recognition.
UNIT-V
IMAGE COMPRESSION
(9)
Need for image compression, Huffman, Run Length Encoding, Arithmetic coding, Vector
Quantization, Block Truncation Coding. Transform Coding – DCT and Wavelet. Image
compression standards.
TOTAL HOURS=45
REFERENCES:
1. Rafael C. Gonzalez, Richard E.Woods, “Digital Image Processing”, Pearson Education,
Second Edition, 2004.
2. Anil K. Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India, 2002.
3. David Salomon ,” Data Compression – The Complete Reference”, Springer Verlag New York
Inc., 2nd Edition, 2001
4. Rafael C. Gonzalez, Richard E.Woods, Steven Eddins, “Digital Image Processing using
MATLAB”, Pearson Education, Inc., 2004.
5. William K.Pratt, “ Digital Image Processing”, John Wiley, NewYork, 2002.
6. Sid Ahmed, M.A., “Image Processing Theory, Algorithms and Architectures”,
McGrawHill,1995.
7. Lim, J.S., “Two Dimensional Signal and Image Processing”, Prentice-Hall, New Jersey, 1990.
11PBK104
HIGH PERFORMANCE COMMUNICATION NETWORKS
L T P C
3 0 0 3
Course objectives
This course covers the techniques needed to understand and analyze modern data
communications networks. It covers the basic architecture of packet networks and the protocols
used to enable transmission of packets through the network. It covers aspects of traffic
management, such as various call admission control and congestion control algorithms in highspeed packet networks and the influence of traffic on network performance.
UNIT- I
PACKET SWITCHED NETWORKS
(9)
OSI and IP models, Ethernet (IEEE 802.3), Token ring (IEEE 802.5), Wireless LAN (IEEE
802.11) FDDI, DQDB, SMDS: Internetworking with SMDS
UNIT- II
ISDN AND BROADBAND ISDN
(9)
ISDN - overview, interfaces and functions, Layers and services - Signaling System 7 (SS7)Broadband ISDN architecture and Protocols.
UNIT- III
ATM AND FRAME RELAY
(9)
ATM: Main features-addressing, signaling and routing, ATM header structure-adaptation layer,
management and control, ATM switching and transmission.
Frame Relay: Protocols and services, Congestion control, Internetworking with ATM, Internet
and ATM, Frame relay via ATM.
UNIT- IV
ADVANCED NETWORK ARCHITECTURE
(9)
IP forwarding architectures overlay model, Multi Protocol Label Switching (MPLS), integrated
services in the Internet, Resource Reservation Protocol (RSVP), Differentiated services
UNIT -V
BLUE TOOTH TECHNOLOGY
(9)
The Blue tooth module-Protocol stack Part I: Antennas, Radio interface, Base band, The Link
controller, Audio, The Link Manager, The Host controller interface; The Blue tooth moduleProtocol stack Part I: Logical link control and adaptation protocol, RFCOMM, Service discovery
protocol, Wireless access protocol, Telephony control protocol.
TOTAL HOURS=45
REFERENCES:
1. William Stallings,”ISDN and Broadband ISDN with Frame Relay and ATM”, Pearson
education Asia, 4th edition, 2002.
2. Leon Gracia, Widjaja, “Communication networks ", Tata McGraw-Hill, New Delhi, 2000.
3. Jennifer Bray and Charles F.Sturman,”Blue Tooth” Pearson education Asia, 2001.
4. Sumit Kasera, Pankaj Sethi, “ATM Networks ", Tata McGraw-Hill, New Delhi, 2000.
5. Rainer Handel, Manfred N.Huber and Stefan Schroder ,”ATM Networks”, Pearson education
asia, 3rd edition, 2002.
6. Jean Walrand and Pravin varaiya ,”High Performance Communication networks”, Harcourt
and Morgan Kauffman, London, 2nd edition,2000.
7. William Stallings,”High-speed Networks and Internets”, Pearson education Asia, 2nd edition,
2003.
11PBK105
MICROWAVE SYSTEMS
L
3
T
0
P
0
C
3
Course Objectives
The purpose of this course is to make the students understand the fundamentals of Microwave
systems. At the end of the course, student should be able to
 To introduce the Field analysis of planar transmission lines
 To know about periodic structures in microwave systems
 To understand the working of microwave solid state amplifiers
UNIT-I
FIELD ANALYSIS OF PLANAR TRANSMISSION LINES (9)
Microstrip Transmission Lines – Attenuation – High frequency properties of Microstrip lines.
Coupled Microstrip lines – even and odd modes. Strip transmission lines – Coupled strip lines –
Fin lines.
UNIT-II
CIRCUIT THEORY FOR WAVE GUIDE SYSTEMS
(9)
Equivalent voltages and currents – Impedance description of waveguide elements and circuits –
one port circuit. Foster’s reactance theorem. N-port circuits. Two port junctions. Excitation of
waveguides. Probe coupling in rectangular waveguide. Radiation from linear current elements
and current loops. Waveguide coupling by apertures.
UNIT-III
PERIODIC STRUCTURES AND FILTERS
(9)
Wave analysis of periodic structures. Periodic structures composed of Unsymmetrical two port
networks. Terminated Periodic structures. Matching of Periodic structures. Floquet’s theorem
and spatial Harmonics. Microwave Filters – Image parameter method. Filter design by insertion
loss method. Low pass filter design. Microstrip parallel coupled filter.
UNIT-IV
MICROWAVE SOLID STATE AMPLIFIERS
(9)
S-parameters - Unilateral design of amplifiers – simultaneous conjugate match. Bilateral design
of amplifiers. Amplifier stability. Conditional and unconditional stability criteria. Amplifier
power gain. Constant gain circles. Noise temperature concept. Noise factor and noise figure.
Noise temperature for cascaded stages. Constant noise figure circles. Design of single stage
microwave amplifiers.
UNIT-V
MICROWAVES AND OPTICS
(9)
Geometrical optics as a limiting case of wave optics. Ray matrices for paraxial ray optics.
Gaussian beams. Generation of Gaussian beams at microwave frequencies. The beam waist.
Propagation of Gaussian beams in Homogeneous medium. Transformation of Gaussian beams
with lenses.
TOTAL HOURS=45
REFERENCES
1. R.E.Collin “ Foundations for Microwave Engineering”, McGraw-Hill, 1992.
2. Ramo, Whinnery and Van Duzer “Fields and Waves in communication electronics”. 3rd
Edition., Wiley, 1997.
3. David M Pozar,” Microwave Engineering”, John Wiley & Sons Inc, 2004
11PBK106
COMMUNICATION SYSTEM LAB – I
L T
0
0
P
3
C
2
LIST OF EXPERIMENTS
1.
2.
3.
4.
5.
6.
7.
Design and performance analysis of error control encoder and decoder
Study of GPS.
Channel equalizer design using MATLAB ( LMS, RLS )
Design and Analysis of Spectrum Estimators ( Borlett , Welch )
Simulation of OFDMA transceivers using MATLAB
Simulation of Turbo coding
Performance Evaluation of digital modulation schemes, Spread spectrum types
8. Transform based compression techniques
9. Simulation of ADPCM in MATLAB
10. Performance evaluation of simulated CDMA System.
TOTAL HOURS=30
SEMESTER II
11PBK201
SPACE TIME WIRELESS COMMUNICATION
L T
3 1
P
0
C
4
Course objectives:
 The knowledge on various modulation and coding schemes for space-time wireless
communications
 The capability of formulating and solving new fundamental problems in space-time
wireless communications.
UNIT-I
MULTIPLE ANTENNA PROPAGATION AND ST CHANNEL
CHARACTERIZATION
(9)
Wireless channel, Scattering model in macrocells, Channel as a ST random field, Scattering
functions, Polarization and field diverse channels, Antenna array topology, Degenerate channels,
reciprocity and its implications, Channel definitions, Physical scattering model, Extended
channel models, Channel measurements, sampled signal model, ST multiuser and ST
interference channels, ST channel estimation.
UNIT-II CAPACITY OF MULTIPLE ANTENNA CHANNELS AND SPATIAL
DIVERSITY
(9)
Capacity of frequency flat deterministic MIMO channel: Channel unknown to the transmitter,
Channel known to the transmitter, capacity of random MIMO channels, Influence of ricean
fading, fading correlation, XPD and degeneracy on MIMO capacity, Capacity of frequency
selective MIMO channels, Diversity gain, Receive antenna diversity, Transmit antenna
diversity, Diversity order and channel variability, Diversity performance in extended channels,
Combined space and path diversity ,Indirect transmit diversity, Diversity of a space-timefrequency selective fading channel.
UNIT-III
MULTIPLE ANTENNA CODING AND RECEIVERS
(9)
Coding and interleaving architecture, ST coding for frequency flat channels, ST coding for
frequency selective channels, Receivers(SISO,SIMO,MIMO),Iterative MIMO receivers,
Exploiting channel knowledge at the transmitter: linear pre-filtering, optimal pre-filtering for
maximum rate, optimal pre-filtering for error rate minimization, selection at the transmitter,
Exploiting imperfect channel knowledge.
UNIT-IV ST OFDM, SPREAD SPECTRUM AND MIMO MULTIUSER DETECTION
(9)
SISO-OFDM modulation, MIMO-OFDM modulation, Signaling and receivers for MIMOOFDM,SISO-SS modulation, MIMO-SS modulation, Signaling and receivers for MIMOSS.MIMO-MAC,MIMO-BC, Outage performance for MIMO-MU,MIMO-MU with
OFDM,CDMA and multiple antennas
UNIT-V ST CO-CHANNEL INTERFERENCE MITIGATION AND PERFORMANCE
LIMITS IN MIMO CHANNELS
(9)
CCI characteristics, Signal models, CCI mitigation on receive for SIMO,CCI mitigating
receivers for MIMO,CCI mitigation on transmit for MISO, Joint encoding and decoding, SS
modulation, OFDM modulation, Interference diversity and multiple antennas, Error performance
in fading channels, Signaling rate vs PER vs SNR, Spectral efficiency of ST doing/receiver
techniques, System Design, Comments on capacity
TOTAL HOURS=45+15=60
REFERENCES:
1. A. Paulraj, Rohit Nabar, Dhananjay Gore., “Introduction to Space Time Wireless
Communication Systems”, Cambridge University Press, 2003
2. Sergio Verdu “ Multi User Detection” Cambridge University Press, 1998
3. Andre Viterbi “ Principles of Spread Spectrum Techniques” Addison Wesley 1995
11PBK202
MULTIMEDIA COMPRESSION TECHNIQUES
L
3
T
1
P
0
C
4
Course Objectives:
 To understand various text, audio, image and video compression techniques in
Multimedia.
 It covers multimedia compression - with an emphasis on compressing and transmitting of
multimedia objects over the Web. Lossless compression methods include statistical
coding and dictionary coding. Lossy compression schemes include scalar, vector,
differential, subband and transform methods for images and for speech and audio.
UNIT-I
INTRODUCTION
(9)
Special features of Multimedia – Graphics and Image Data Representations – Fundamental
Concepts inVideo and Digital Audio – Storage requirements for multimedia applications -Need
for Compression - Taxonomy of compression techniques – Overview of source coding, source
models, scalar and vector quantization theory – Evaluation techniques – Error analysis and
methodologies
UNIT-II
TEXT COMPRESSION
(9)
Compaction techniques – Huffmann coding – Adaptive Huffmann Coding – Arithmetic coding –
Dictionary techniques – LZW family algorithms.
UNIT-III
AUDIO COMPRESSION
(9)
Audio compression techniques - µ- Law and A- Law companding. Frequency domain and
filtering – Basic sub-band coding – Application to speech coding – G.722 – Application to audio
coding – MPEG audio, progressive encoding for audio – Silence compression, speech
compression techniques – Formant and CELP Vocoders
UNIT-IV
IMAGE COMPRESSION
(9)
Predictive techniques – DM, PCM, DPCM: Optimal Predictors and Optimal Quantization–
Transform Coding – JPEG Standard – Sub-band coding algorithms: Design of Filter banks –
Wavelet based compression: Implementation using filters – EZW, SPIHT coders – JPEG 2000
UNIT-V
VIDEO COMPRESSION
(9)
Video compression techniques and standards–MPEG Video Coding I: MPEG–1 and 2–MPEG
Video Coding II: MPEG–4 and 7–Motion estimation and compensation techniques–H.261
Standard.
TOTAL HOURS=45+15=60
REFERENCES:
1. Khalid Sayood, “Introduction to Data Compression”, Morgan Kauffman Harcourt India, 2nd
Edition, 2000.
2. David Salomon “Data Compression – The Complete Reference”, Springer Verlag New York
Inc. 2nd Edition, 2001.
3. Yun Q.Shi, Huifang Sun, “ Image and Video Compression for Multimedia Engineering –
Fundamentals, Algorithms & Standards”, CRC press, 2003.
4. Peter Symes “ Digital Video Compression”, McGraw Hill Pub., 2004.
5. Mark Nelson “Data compression”, BPB Publishers, New Delhi,1998.
6. Mark S.Drew, Ze-Nian Li “Fundamentals of Multimedia”, PHI, 1st Edition, 2003.
7. Watkinson,J “Compression in Video and Audio”, Focal press,London.1995.
11PBK203
MICROWAVE INTEGRATED CIRCUITS
L
3
T
1
P
0
C
4
Course Objectives:
The student should master the following topics and perform the following tasks
 Understanding of the different types of MICs and different transmission lines to be used
in MICs
 Knowledge of the concept of microstrip line and its interpretation in the analysis and
design of microstrip line
 Design and Analysis of non-reciprocal components, active devices, High Power and Low
Power Circuits
 Microfabrication of MIC devices will be covered in order to understand the major MIC
fabrication techniques and how they interact with system design strategies
UNIT-I
TECHNOLOGY OF HYBRID MICS
(9)
Dielectric substrates - thick film technology and materials - thin film technology and materials –
methods of testing – encapsulation of devices for MICs – mounting of active devices.
UNIT-II
TECHNOLOGY OF MONOLITHIC MICS
(9)
Processes involved in fabrication – epitaxial growth of semiconductor layer – growth of
dielectric layer – diffusion-ion implantation – electron beam technology.
UNIT-III
ANALYSIS OF MICROSTRIP LINE
(9)
Methods of conformal transformation – numerical method for analysis – hybrid mode analysis –
coupled mode analysis- method of images – losses in miscrostrips.
UNIT-IV COUPLED MICROSTRIPS, SLOT LINE AND COPLANAR WAVEGUIDES
(9)
Coupled microstrips – even and odd mode analysis – microstrip directional couplers – branch
line couplers – periodic branch line couplers – synchronous branch line couplers.
UNIT-V LUMPED ELEMENTS AND NON-RECIPROCAL COMPONENTS
(9)
Design and fabrication using microstrips – flat resistors – flat inductors – interdigital capacitors –
sandwich capacitors – ferromagnetic substrates for non-reciprocal devices – microstrip
circulators – latching circulators – isolators – phase shifters.
TOTAL HOURS=45+15=60
REFERENCES:
1. Gupta,K.C, and Amarjit singh “Microwave Integrated Circuits” John Wiley and sons , Wiley
Eastern Reprint, 1978.
2. Hoffmann, R.K, “Handbook of Microwave Integrated Circuits” ,Artech House, 1987.
11PBK204
RF CIRCUIT DESIGN
L
3
T
1
P
0
C
4
Course Objectives:
 This course covers the basic RF principles associated with transmission lines, the Smith
Chart,impedance matching, amplifier design and system applications.
 One of the goals is to develop the ability to recognize when RF design techniques are
required and the skills to implement them. These skills include the ability to use the Smith
Chart to solve problems involving both lumped and distributed circuit elements, design
impedance-matching circuits, and design simple RF transistor amplifiers.
UNIT- I PASSIVE RF COMPONENTS AND TRANSMISSION LINE ANALYSIS (9)
High frequency resistors, capacitors and inductors- Transmission line analysis: LINE
EQUATION, Microstrip line, Voltage reflection co-efficeient, propagation constsnt, phase
velocity and special termination- Smith chart Impedence transformation- Analysis of parallel RL
circuit and parallel RC circuit
UNIT-II
SINGLE AND MULTI PORT NETWORK THEORY AND RF FILTER
DESIGN
(9)
Definitions- properties –interconnection of networks- ABCD parameters and s parameters- RF
Filter resonator and filter configuration- Butterworth and chebyshev filters
UNIT-III
DESIGN OF MATCHING NETWORK
(9)
Matching by discrete components- design of two component matching network, design of T and
π matching networks- matching by microstrip line- design of matching network- design of stub
matching.
UNIT- IV
RF ACTIVE COMPONENTS, THEIR MODELLING AND RF AMPLIFIER
DESIGN
(9)
Components: RF diode, PIN Diode and GUNN diode, RF Bipolar junction Transistors, RF FETModelling: diode model, Transistors model, FET model- Rf Amplifier: Characterstics, power
relations and stability consideration.
UNIT-V
RF OSCILLATOR AND MIXER DESIGN
(9)
Basic oscillator model- Design of fixed frequency oscillator- Dielectric resonator oscillatorVoltage controlled oscillator- gunn element oscillator- Basic concepts- design of single ended
mixer- double ended mixer .
TOTAL HOURS=45+15=60
REFERENCES:
1. Reinhold Ludwigand pavel Bretchko, “RF Circuit Design”, Pearson Education Asia
Publication, 2001.
2. Matthew M Radmanesh, “Radio Frequency and Microelectronic Illustrated”, Pearson
Education Asia Publication, 2001.
3. Peter P Keinington, “ High Linearity RF Amplifier Design”, Artech House, 2002.
4. Razavi ,”RF Micro Electronics”, Prentice Hall PTR, 1998.
11PBK205
COMMUNICATION SYSTEM LAB - II
L
0
T
0
P
3
C
2
LIST OF EXPERIMENTS:
1. Simulation of Audio compression algorithms
2. Simulation of EZW / SPIHT Image coding algorithm.
3. Programing in MATLAB for Arithmetic coding, Huffman coding
4. Implementation of image segmentation by median filters
5. Deblurring of image by using wiener filters.
6. Implementation of an edge detection algorithm in MATLAB
7. Noise Removal by median filters
8. Design and testing of a Microstrip Antennas and coupler.
9. Antenna Radiation Pattern measurement
10. Implementation of Shortest Path Routing/ Sliding Window Protocol Algorithm/ Distance
Vector routing/ Link State routing Algorithms using Network Simulation softwares.
TOTAL HOURS=30
LIST OF ELECTIVES
Sl.N
o.
SUBJECT
CODE
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
11PBEX01
11PBEX02
11PBEX03
11PBEX04
11PBEX05
11PBEX06
11PBEX07
11PBEX08
11PBEX09
11PBEX10
11PBEX11
11PBEX12
11PBEX13
11PBEX14
11PBEX15
11PBEX16
11PBEX17
11PBEX18
19
20
11PBEX19
11PBEX20
SUBJECT NAME
OPTICAL COMMUNICATION NETWORKS
ADVANCED RADIATION SYSTEMS
COMMUNICATION PROTOCOL ENGINEERING
NETWORK ROUTING ALGORITHMS
SOFT COMPUTING
INTERNETWORKING MULTIMEDIA
MOBILE COMMUNICATION NETWORKS
MOBILE AND PERSONAL COMMUNICATION
HIGH SPEED SWITCHING ARCHITECTURE
COMMUNICATION NETWORK SECURITY
ROUTING IN COMMUNICATION NETWORKS
CRYPTOGRAPHY AND NETWORK SECURITY
ADVANCED DIGITAL IMAGE PROCESSING
MULTI USER THEORY
DESIGN AND ANALYSIS OF ALGORITHMS
4G WIRELESS NETWORKS
NEXT GENERATION IP NETWORKS
MODELLING AND SIMULATION OF WIRELESS
SYSTEMS
MOBILE AD HOC NETWORKS
MEDICAL IMAGE PROCESSING
Hours/Wee
k
L T P
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
3
0
0
C
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
0
0
3
3
3
0
0
0
0
3
3
11PBEX01
OPTICAL COMMUNICATION NETWORKS
L T
3
0
P
0
C
3
Course Objectives:
The main purpose of this course is to introduce students the important areas of communication
networks, mainly optical networks. This will enable the students to acquire a solid understanding
of foundations of optical networks technologies, systems, networks issues as well as economic
deployment considerations
UNIT -I
OPTICAL NETWORKING COMPONENTS
(9)
First- and second-generation optical networks, Components: couplers, isolators, circulators,
multiplexers, filters, amplifiers, switches, and wavelength converters.
UNIT- II
SONET AND SDH NETWORKS
(9)
Integration of TDM signals, Layers, Framing, Transport overhead, Alarms, Multiplexing,
Network elements, Topologies, Protection architectures, Ring architectures, Network
Management
UNIT- III
BROADCAST – AND- SELECT NETWORKS
(9)
Topologies, Single-hop, Multihop, and Shufflenet multihop networks, Media-Access control
protocols, Test beds.
UNIT- IV
WAVELENGTH-ROUTING NETWORKS
(9)
Node designs, Issues in Network design and operation, Optical layer cost Tradeoffs, Routing and
Wavelength assignment, Wavelength routing test beds.
UNIT- V
HIGH CAPACITY NETWORKS
(9)
SDM, TDM, and WDM approaches, Application areas, Optical TDM Networks: Multiplexing
and demultiplexing, Synchronization, Broadcast networks, Switch-based networks, OTDM test
beds.
TOTAL HOURS=45
REFERENCES:
1. Rajiv Ramaswami and Kumar Sivarajan, “Optical Networks: A practical perspective,” Morgan
Kaufmann", 2nd edition, 2001.
2. Vivek Alwayn, “Optical Network Design and Implementation”, Pearson Education, 2004.
3. Hussein T.Mouftab and Pin-Han Ho, “Optical Networks: Architecture and Survivability”,
Kluwer Academic Publishers, 2002.
4. Biswanath Mukherjee,” Optical Communication Networks”, McGraw Hill, 1997
11PBEX02
ADVANCED RADIATION SYSTEMS
L
3
T
0
P
0
C
3
COURSE OBJECTIVES:
The purpose of introducing this course is to describe the advanced design principles used in the
radiating systems.
 Understanding of the different types of antennas and sources of radiation
 Knowledge of the concepts of antenna synthesis techniques
UNIT- I
CONCEPTS OF RADIATION
(9)
Retarded vector potentials – Heuristic approach and Maxwell’s equation approach. Electric
vector potential F for a magnetic current source M. Duality theorem. The Lorentz gauge
condition. Vector potential in Phasor form. Fields radiated by an alternating current element and
half wave dipole. Total power radiated and radiation resistance of alternating current element and
half wave dipole. Power radiated in the far field. Linear, Elliptical and circular polarization.
Development of the Poincare sphere.
UNIT- II
ANTENNA ARRAYS
(9)
N element linear arrays – uniform amplitude and spacing- Phased arrays- Directivity of
Broadside and End fire arrays. Three dimensional characteristics - Pattern multiplicationBinomial arrays and Dolph- Tchebycheff arrays. Circular array. Mutual coupling in arrays,
multidimensional arrays- phased arrays and array feeding techniques.
UNIT- III
ANTENNA SYNTHESIS
(9)
Synthesis problem-Line source based beam synthesis methods (Fourier transform and
Woodward- Lawson sampling method – Linear array shaped beam synthesis method – Low side
lobe, narrow main beam synthesis methods - discretization of continuous sources. Schelkunoff
polynomial method
UNIT- IV
APERTURE ANTENNAS
(9)
Radiation from apertures - Huygens Principle. Rectangular apertures- techniques for evaluating
gain, Circular apertures and their design considerations- Babinets principle Fraunhoffer and
Fresnel diffraction. Complimentary screens and slot antennas. Slot and dipoles as dual antennas.
Fourier transform in aperture antenna theory.
UNIT- V
HORN, MICROSTRIP, REFLECTOR ANTENNAS
(9)
E and H plane sectoral Horns-Pyramidal horns-Conical and corrugated Horns-Multimode hornsPhase center.Microstrip antennas–feeding methods. Rectangular patch-Transmission line model–
Circular patch Parabolic Reflector antennas–Prime focus and cassegrain reflectors-Equivalent
focal length of Cassegrain antennas-Spillover and taper efficiencies. Optimum illumination.
TOTAL HOURS=45
REFERENCES:
1. Balanis, C.A., “Antenna Theory” Wiley,2003
2. Warren L. Stutzman and Gary A. Thiele,“ Antenna theory and design”John Wiley and sons
1998
3. Jordan, E.C., “ Electromagnetic waves and Radiating systems”. PHI 2003
4. Krauss, J.D., “ Radio Astronomy” McGraw-Hill 1966, for the last unit (reprints available)
5. Krauss, J.D.,, Fleisch,D.A., “Electromagnetics” McGraw-Hill,1999
11PBEX03
COMMUNICATION PROTOCOL ENGINEERING
L T P
3
0
0
C
3
Course Objectives:
Introduction to Communication Protocols: Communication basics, Network reference model,
Communication protocol specifications, Protocol verification, Protocol conformance and
testing,Protocol
synthesis
and
implementation.
UNIT- I
NETWORK REFERENCE MODEL
(9)
Communication model-software, subsystems, protocol, protocol development methods, Protocol
engineering process, Layered architecture, Network services and Interfaces, Protocol functions,
OSI model ,TCP/IP protocol suite
UNIT- II
PROTOCOL SPECIFICATIONS
(9)
Components of protocol, Specifications of Communication service, Protocol entity, Interface,
Interactions, Multimedia protocol, Internet protocol, SDL, SDL based protocol- other protocol
specification languages
UNIT- III
PROTOCOL VERIFICATION/VALIDATION
(9)
Protocol verification, Verification of a protocol using finite state machines, Protocol validation
approaches, protocol design errors, SDL based protocol verification validation
UNIT- IV
PROTOCOL CONFORMANCE/PERFORMANCE TESTING
(9)
Conformance testing methodology and frame work, Conformance test architectures, Test
sequence generation methods, Distributed architecture by local methods, Conformance testing
with TTCN, systems with semi controllable interfaces - RIP,SDL based tools for conformance
testing, SDL based conformance testing of MPLS Performance testing, SDL based performance
testing of TCP and OSPF, Interoperability testing, SDL based interoperability testing of
CSMA/CD and CSMA/CA protocol using Bridge, Scalability testing
UNIT- V
PROTOCOL SYNTHESIS AND IMPLEMENTATION
(9)
Protocol synthesis, Interactive synthesis algorithm, Automatic synthesis algorithm, Automatic
synthesis of SDL from MSC, Protocol Re-synthesis; Requirements of protocol implementation,
Object based approach to protocol implementation, Protocol compilers, Tool for protocol
engineering
TOTAL HOURS=45
REFERENCES:
1. Pallapa Venkataram and Sunilkumar S.Manvi, “Communication protocol Engineering”,
Eastern Economy edition, 2004
2. Richard Lai and Jirachiefpattana, “Communication Protocol Specification and Verification”,
Kluwer Publishers, Boston, 1998.
3. Tarnay, K., “Protocol Specification and Testing”, Plenum, New York, 1991.
4. Mohamed G. Gouda, “Elements of Network Protocol Design”, John Wiley & Sons, Inc. New
York, USA, 1998
5. V.Ahuja, “Design and Analysis of Computer Communication networks”, McGraw-Hill,
London,1982.
6. G.J.Holtzmann, “Design and validation of Computer protocols”, Prentice Hall, New York,
1991.
11PBEX04
NETWORK ROUTING ALGORITHMS
L
T
P
C
3
0
0
3
Course Objectives:
The main purpose of this course is to introduce students the various Network Routing
Algorithms. To learn about
 Routing algoithms in Circuit switching network & Packet switching networks
 Routing algoithms in Routing in High speed and mobile networks
 Routing algoithms in Mobile Ad-hoc networks
UNIT- I
CIRCUIT SWITCHING NETWORKS
(9)
AT & T’s Dynamic Routing Network, Routing in Telephone Network-Dynamic NonHierarchical
Routing- Trunk Status Map Routing-Real Time Network Routing, Dynamic Alternative RoutingDistributed Adaptive Dynamic Routing-Optimized Dynamic Routing
UNIT- II
PACKET SWITCHING NETWORKS
(9)
Distance vector Routing, Link State Routing, Inter domain Routing-Classless Interdomain
routing (CIDR), Interior Gateway routing protocols (IGRP) - Routing Information Protocol
(RIP), Open Shortest Path First (OSPF), Exterior Gateway Routing Protocol (EGRP) - Border
Gateway Protocol (BGP), Apple Talk Routing and SNA Routing
UNIT- III
HIGH SPEED NETWORKS
(9)
Routing in optical networks-The optical layer, Node Designs, Network design and operation,
Optical layer cost tradeoffs, Routing and wavelength assignment, Architectural variations,
Routing in ATM networks- ATM address structure, ATM Routing, PNNI protocol, PNNI
signaling protocol, Routing in the PLANET network and Deflection Routing.
UNIT -IV
MOBILE NETWORKS
(9)
Routing in Cellular Mobile Radio Communication networks-Mobile Network Architecture,
Mobility management in cellular systems, Connectionless Data service for cellular systems,
Mobility and Routing in Cellular Digital Packet Data (CDPD) network, Packet Radio RoutingDARPA packet radio network, Routing algorithms for small, medium and large sized packet
radio networks.
UNIT- V
MOBILE AD-HOC NETWORKS (Manet)
(9)
Internet based mobile ad-hoc networking, communication strategies, routing algorithms – Tabledriven routing - Destination Sequenced Distance Vector (DSDV), Source initiated on-demand
routing- Dynamic Source Routing (DSR), Ad-hoc On- demand Distance Vector (AODV),
Hierarchical based routing- Cluster head Gateway Switch Routing (CGSR) and TemporallyOrdered Routing Algorithm (TORA), Quality of Service.
TOTAL HOURS=45
REFERENCES
1. M. Steen strub, “Routing in Communication networks”, Prentice Hall International, NewYork,
1995.
2. “Internetworking Technologies Handbook”, Fourth Edition, Inc. Cisco Systems, ILSG Cisco
Systems, 2003.
3. William Stallings, “ISDN and Broadband ISDN with Frame Relay and ATM”, PHI, New
Delhi, 2004.
4. Behrouz A Forouzan, “Data Communications and Networking (3/e), TMH, 2004
5. William Stallings, “High Speed Networks TCP/IP and ATM Design Principles”, Prentice Hall
International, New York, 1998.
6. Mohammad Ilyas, “The Handbook of Ad hoc Wireless Networks” CRC Press, 2002.
7. Vijay K.Garg, “Wireless Network Evolution: 2G to 3G”, Pearson Education, New Delhi,
India, 2003.
8. Rajiv Ramaswami and Kumar N.Sivarajan, “Optical Networks”,Morgan Kaufmann
Publishers,1998.
9. Sumit Kasera and Pankaj sethi, ”ATM Networks”, Tata McGraw-Hill Publishing Company
limited, New Delhi,2001.
10. IEEE Journal on Selected Areas in Communications, Special issue on Wireless Ad-hoc
Networks,Vol. 17, No.8, 1999.
11PBEX05
SOFT COMPUTING
L
3
T
0
P
0
C
3
Course Objectives
To introduce the techniques of soft computing and adaptive neuro-fuzzy inferencing systems
which differ from conventional AI and computing in terms of its tolerance to imprecision and
uncertainty. To introduce the ideas of fuzzy sets and use of heuristics based on human
experience
UNIT- I
ARTIFICIAL NEURAL NETWORKS
(9)
Basic concepts-single layer perceptron-Multi layer perceptron-Adaline-Madaline-Learning rulesSupervised learning-Back propagation networks-Training algorithm, Practical difficulties,
Advanced algorithms-Adaptive network- Radial basis network-modular network-Applications
UNIT- II
UNSUPERVISED NETWORKS
(9)
Introduction- unsupervised learning -Competitive learning networks-Kohonen self organising
networks-Learning vector quantisation-Hebbian learning-Hopfield network-Content addressable
nature, Binary Hopfield network, Continuous Hopfield network Traveling Salesperson problem Adaptive resonance theory –Bidirectional Associative Memory-Principle component Analysis
UNIT- III
FUZZY SYSTEMS
(9)
Fuzzy sets-Fuzzy rules: Extension principle, Fuzzy relation-fuzzy reasoning–fuzzy inference
systems: Mamdani model, Sugeno model. Tsukamoto model-Fuzzy decision making-Multiobjective Decision Making,-Fuzzy classification-Fuzzy control methods –Application
UNIT- IV
NEURO-FUZZY MODELLING
(9)
Adaptive Neuro Fuzzy based inference systems – classification and regression trees: decision
tress, Cart algorithm – Data clustering algorithms: K means clustering, Fuzzy C means
clustering, Mountain clustering, Subtractive clustering – rule base structure identification –
Neuro fuzzy control: Feedback Control Systems, Expert Control, Inverse Learning, Specialized
Learning, Back propagation through Real – Time Recurrent Learning.
UNIT -V
GENETIC ALGORITHM
(9)
Fundamentals of genetic algorithm-Mathematical foundations-Genetic modeling-Survival of the
fittest crossover- Inversion and Deletion-mutation-reproduction-Generational cycle-rank methodrank space method- Other derivative free optimization-simulated annealing, Random search,
Downhill simplex search- Application
TOTAL HOURS=45
REFERENCES
1. Jang J.S.R.,Sun C.T and Mizutani E, “Neuro Fuzzy and Soft computing”, Pearson education
(Singapore) 2004
2. David E.Goldberg “Genetic Algorithms in Search, Optimization, and Machine Learning”,
Pearson Education, Asia,1996
3. Laurene Fauseett:”Fundamentals of Neural Networks”, Prentice Hall India, New Delhi,1994.
4. Timothy J.Ross:”Fuzzy Logic Engineering Applications”, McGrawHill, NewYork,1997.
5. S.Rajasekaran and G.A.Vijayalakshmi Pai “Neural networks,Fuzzy logics,and Genetic
algorithms”, Prentice Hall of India,2003
6. George J.Klir and Bo Yuan,”Fuzzy Sets and Fuzzy Logic”,Prentice Hall Inc., NewJersey,1995
11PBEX06 INTERNETWORKING MULTIMEDIA
L
3
T
0
P
0
C
3
Course Objectives:
 Fundamentals of multimedia, media and data streams, sound/audio, image, graphics,
video and animation.
 Topics in data compression including coding requirements, source, entropy, and hybrid
coding, JPEG, H.261 (px64), MPEG, MP3 and etc.
 Multimedia operating system issues such as real-time operation, resource management,
process management, file systems, and Multimedia networking.
UNIT- I
MULTIMEDIA NETWORKING
(9)
Digital sound, video and graphics, basic multimedia networking, multimedia characteristics,
evolution of Internet services model, network requirements for audio/video transform,
multimedia coding and compression for text, image, audio and video.
UNIT- II
BROADBAND NETWORK TECHNOLOGY
(9)
Broadband services, ATM and IP, IPV6, High speed switching, resource reservation, Buffer
management, traffic shaping, caching, scheduling, and policing, throughput, delay and jitter
performance. Storage and media services, voice and video over IP, MPEG-2 over ATM/IP,
indexing synchronization of requests, recording and remote control.
UNIT- III
RELIABLE TRANSPORT PROTOCOL AND APPLICATIONS
(9)
Multicast over shared media network, multicast routing and addressing, scaling multicast and
NBMA networks, Reliable transport protocols, TCP adaptation algorithm, RTP, RTCP. MIME,
Peer- to-Peer computing, shared application, video conferencing, centralized and distributed
conference control, distributed virtual reality, light weight session philosophy.
UNIT- IV
MULTIMEDIA COMMUNICATION STANDARDS
(9)
Objective of MPEG-7 standard, Functionalities and systems of MPEG-7, MPEG-21 Multimedia
Framework Architecture-Content representation, Content Management and usage, Intellectual
property management, Audio visual system-H322: Guaranteed QOS LAN systems; MPEG_4
video Transport across internet.
UNIT- V
MULTIMEDIA COMMUNICATION ACROSS NETWORKS
(9)
Packet Audio/video in the network environment, video transport across Generic networksLayered video coding, error Resilient video coding techniques, Scalable Rate control, Streaming
video across Internet, Multimedia transport across ATM networks and IP network, Multimedia
across wireless networks.
TOTAL HOURS=45
REFERENCES
1. Jon Crowcroft, Mark Handley, Ian Wakeman, “Internetworking Multimedia”, Harcourt Asia
Pvt. Ltd.Singapore, 1998.
2. B.O. Szuprowicz, “Multimedia Networking”, McGraw Hill, Newyork. 1995.
3. Tay Vaughan,” Multimedia - Making it to work”, Tata McGraw Hill , 4ed, NewDelhi, 2000.
11PBEX07 MOBILE COMMUNICATION NETWORKS
L
3
T
0
P
0
C
3
Course Objectives:
 To study various aspects of Network Security Attacks, Services and Mechanisms.
 To deal with various Encryption, Authentication and Digital Signature Algorithms
 To deal with different general purpose and application specific Security Protocols
UNIT-I
OPERATION OF MOBILE COMMUNICATION NETWORKS
(9)
Operation of first, second, and third generation wireless networks: cellular systems, medium
access techniques, Mobile networks Elementary Principles of cellular Telephony Channel
Division Techniques (TDMA, FDMA, CDMA) Cellular Coverage Methods Network Planning
and Resource Allocation, Network Dimensioning ,Mobility Management Procedures
UNIT-I
PROPAGATION MODELS AND AIR PROTOCOLS
(9)
Radio propagation models, error control techniques, handoff, power control, Soft handover,
Forward link, Reverse link, common air protocols(AMPS,IS-95,IS-136,GSM,GPRS,EDGE,
WCDMA, cdma2000)
UNIT-III
MOBILE NETWORK ARCHITECTURE
(9)
General Architecture definition, Mobile Terminals (MT, SIM) Radio Section (BTS, BSC) Core
Network (MSC, G-MSC, VLR, HLR, AuC) User and Control Plane Protocol Stack, MAP &
SS#7, the Key Role of Signaling Interfaces and Network Entities Relation The Physical Channel,
The Logical Channels Terminal, Call and Network Management Procedures, Network Planning.
UNIT-IV
WIRELESS LOCAL AREA NETWORKS
(9)
Wireless Local Area Networks , General Characteristics of the Hyper LAN System, 802.11
Standard, Basic DCF access & DCF Access Scheme with Handshaking, PCF Access Scheme,
802.11a Standard, Mobile Ad Hoc Networks, Wireless Sensor Networks, Routing Energy
Efficiency, Localization, Clustering.
UNIT-V
SECURITY ISSUES IN WIRELESS NETWORKS
(9)
Security in Wireless Networks, Secure routing, Key Pre-distribution and Management,
Encryption and Authentication, Security in Group Communication, Trust Establishment and
Management, Denial of Service Attacks, Energy-aware security mechanisms, Location
verification, Security on Data fusion.
TOTAL HOURS=45
REFERENCES:
1. W. Stallings, "Wireless Communications and Networks",Second Edition Prentice Hall, 2007.
2. . Uyless Black ,”Mobile and Wireless Networks” , Prentice Hall PTR, 1996..
3. T.S.Rappaport,"Wireless Communications: Principles & Practice",Second Edition, Prentice
Hall, 2002.
4. Leon-Garcia and I. Widjaja, "Communication Networks, Fundamental Concepts and Key
Architectures", McGraw-Hill, 2000.
5. J.Schiller,”Mobile Communications", Addison Wesley, 2000.
6. Fred Halsall, "Multimedia Communications, Applications, Networks, Protocols and
Standards",Addison Wesley, 2001.
11PBEX08
MOBILE AND PERSONAL COMMUNICATION
L
3
T
0
P
0
C
3
Course Objectives:
This course teaches the fundamentals of Radio propagation and its models, Channel allocation
for radio wave communication and handover of calls, various modulation and mulitple access
techniques, Equalization, diversity and coding used in radio wave communication and
fundamentals of personal coomuincation.
UNIT –I
RADIO PROPOGATION
(9)
Radio Propagation Characteristics, Models for Path loss, Shadowing & Multipath fading- delay
spread, Coherence bandwidth, Coherence Time, Doppler Spread.
UNIT –II
CHANNEL ALLOCATION & HANDOVER
(9)
Frequency Reuse, basic theory of hexagonal cell layout, spectrum efficiency, FDM/TDM,
Cellular System, channel allocation schemes, Handover analysis, cellular CDMA, Erlang
capacity, Antennas for mobile radio and characteristics.
UNIT –III
MODULATION AND MULTIPLE ACCESS TECHNIQUES
(9)
Digital modulation for Mobile radio, Analysis under fading channel, diversity techniques and
RAKE demodulator, Spread Spectrum Communication, Multiple Access Techniques used in
Mobile Wireless Communication.
UNIT –IV
EQUALIZATION, DIVERSITY AND CODING
(9)
Linear and Nonlinear Equalization, Adaptive Equalization, Diversity techniques, RAKE
Receiver, Speech codes and channel codes.
UNIT –V
PCS & SATELLITE SYSTEMS
(9)
PACS – Architecture, PHS, PCS and ISM bands, satellites for Personal Communication
Services, WLL, Cordless telephones.
REFERENCES:
1. T. S. Rappaport, “Wireless Communications: Principles and Practice”, Pearson
Education, Prentice Hall of India, Third Indian Reprint 2003.
2. W. C. Y. Lee, “Mobile Communications Engineering: Theory and applications”, McGraw-Hill
International, 2nd Edition, 1998.
11PBEX09
HIGH SPEED SWITCHING ARCHITECTURE
L T
3
0
P
0
C
3
Course objectives
 To highlight the features of different technologies involved in High Speed Switching
architecures and their performance.
 Students will get an introduction about ISDN and ATM.
 Students will be provided with different Queueing techniques used in ATM switches
UNIT- I
HIGH SPEED NETWORK
(9)
LAN and WAN network evolution through ISDN to BISDN - Transfer mode and control of
BISDN - SDH multiplexing structure - ATM standard; ATM adaptation layers.
UNIT- II
LAN SWITCHING TECHNOLOGY
(9)
Switching concepts; Switch forwarding techniques; switch path control - LAN switching; cut
through forwarding; store and forward - virtual LANs.
UNIT- III
ATM SWITCHING ARCHITECTURE
(9)
Switch models - Blocking networks – basic and enhanced banyan networks - sorting networks –
merge sorting - rearrangeable networks - full and partial connection networks - nonblocking
networks – recursive network – construction and comparison of non-blocking network - switches
with deflection routing – shuffle switch - tandem banyan.
UNIT- IV
QUEUES IN ATM SWITCHES
(9)
Internal queuing – Input, output and shared queuing - multiple queuing networks –combined
input, output and shared queuing – performance analysis of queued switches.
UNIT- V
IP SWITCHING
(9)
Addressing mode - IP switching types-flow driven and topology driven solutions - IP Over ATM
address and next hop resolution – multicasting - IPv6 over ATM.
TOTAL HOURS=45
REFERENCES:
1.Achille Patavina, “Switching Theory: Architectures and performance in Broadband ATM
Networks”John Wiley & Sons Ltd., New York.1998.
2.Christopher Y Metz, “Switching protocols & Architectures” McGraw Hill, New York.1998.
3.Ranier Handel, Manfred N Huber and Stefan Schrodder, “ATM Networks-concepts, protocols,
applications”, Adisson Wesley, New York, 3rd Edition, 1999.
4.John A.Chiong,” Internetworking ATM for the internet and enterprise networks”, McGraw
Hill, NewYork, 1998.
11PBEX10
COMMUNICATION NETWORK SECURITY
L T
3
0
P
0
C
3
Course objectives:
To study various aspects of Network Security Attacks, Services and Mechanisms.
 To deal with various Encryption, Authentication and Digital Signature Algorithms
 To deal with different general purpose and application specific Security Protocols and
Techniques
UNIT- I
SYMMETRIC CIPHERS
(9)
Introduction – Services, Mechanisms and Attacks, OSI security Architecture, Model for network
Security; Classical Encryption Techniques- Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Product ciphers , Data Encryption Standard- Block Cipher Principles,
Strength of DES, Differential and Linear Crypt Analysis, Block Cipher Design Principles, Block
Cipher Modes of Operation, Stegnography;
UNIT- II
ADVANCED ENCRYPTION STANDARD AND STREAM CIPHERS
(9)
Evaluation Criteria for AES, AES Cipher; Contemporary Symmetric Ciphers- Triple DES,
Blowfish, RC5- Characteristics of Advanced Symmetric Block Ciphers, Stream ciphers based on
LFSRs,RC4 Stream Cipher; Random Number Generation. Traffic Confidentiality, Key
Distribution
UNIT- III
PUBLIC-KEY ENCRYPTION AND HASH FUNCTIONS
(9)
Public Key Cryptography and Key Management- RSA Algorithm and other public key
cryptosystems-, Diffie-Hellman Key Exchange, Elliptic Curve arithmetic, Elliptic Curve
Cryptography; Message Authentication and Hash Functions- Authentication Requirements, MD5 Message Digest Algorithm; Secure Hash Algorithm, RIPEMD 160, HMAC; Digital
Signatures and Authentication Protocols- Digital Signature Standards.
UNIT- IV
NETWORK SECURITY PRACTICE
(9)
Authentication Applications- Kerberos, X.509 Authentication Service; Electronic Mail SecurityPretty Good Privacy, S/MIME; IP Security- overview and Architecture, Authentication Header,
Encapsulating Security Payload, Combining Security Associations; Web Security- Web Security
Considerations, Secure Sockets Layer and Transport Layer Security, Secure Electronic
Transaction.
UNIT- V
SYSTEM SECURITY
(9)
Intruders- Intruder Detection, Password Management; Malicious Software- Virus and Related
Threats, Virus Counter Measures; Firewalls- Firewall Design Principles, Trusted Systems.
TOTAL HOURS=45
REFERENCES
1. William Stallings, “Cryptography and Network Security”, Prentice Hall of India, New Delhi,
3rd Edition, 2004
2. William Stallings, “Network Security Essentials”, Prentice Hall of India, New Delhi, 2nd
Edition, 2004
3. Charlie Kaufman , “Network Security: Private Communication in Public World”, Prentice
Hall of India, New Delhi, 2nd Edition, 2004
11PBEX11
CRYPTOGRAPHY AND NETWORK SECURITY
L T P
3
0
0
C
3
Course objectives:
To study various aspects of Network Security Attacks, Services and Mechanisms.
 To deal with various Encryption, Authentication and Digital Signature Algorithms
 To deal with different general purpose and application specific Security Protocols and
Techniques
UNIT- I
SYMMETRIC CIPHERS
(9)
Introduction, Classical Encryption Techniques-Symmetric Cipher Model, Substitution
Techniques, Transposition Techniques, Block Ciphers and Data Encryption Standard–Simplified
DES, Block Cipher Principles, Data Encryption Standard, Strength of DES, Differential and
Linear Crypt Analysis, Block Cipher Design Principles, Block Cipher Modes of operation.
UNIT- II
AES AND CONFIDENTIALITY
(9)
Advanced Encryption Standard-Evaluation Criteria for AES, AES Cipher; Contemporary
Symmetric Ciphers-Triple DES, Confidentiality using Symmetric Encryption-Placement of
Encryption Function, Traffic Confidentiality, Key Distribution, and Random Number
Generation.
UNIT- III
PUBLIC-KEY ENCRYPTION AND HASH FUNCTIONS
(9)
Public Key Cryptography and RSA- Principles of Public Key Cryptosystems, RSA Algorithm;
Key Management, Diffie-Hellman Key Exchange, Elliptic Curve Cryptography; Message
Authentication and Hash Functions- Authentication Requirements, Authentication Functions,
Message Authentication Codes, Hash Functions and MACs; Hash Algorithms- MD5 Message
Digest Algorithm; Secure Hash Algorithm, Digital Signatures and Authentication Protocols,
Digital Signature Standards.
UNIT- IV
NETWORK SECURITY PRACTICE
(9)
Authentication Applications- Kerberos, X.509 Authentication Service; Electronic Mail SecurityPretty Good Privacy, S/MIME; IP Security- IP Security Overview, IP Security Architecture,
Authentication Header, Encapsulating Security Payload, Combining Security Associations; Web
Security- Web Security Considerations, Secure Sockets Layer and Transport Layer Security,
Secure Electronic Transaction.
UNIT- V
SYSTEM SECURITY
(9)
Intruders- Intruder Detection, Password Management; Malicious Software- Virus and Related
Threats, Virus Counter Measures; Firewalls- Firewall Design Principles, Trusted Systems.
TOTAL HOURS=45
REFERENCES
1. William Stallings, “Cryptography and Network Security”, 3rd Edition. Prentice Hall of
India, New Delhi, 2004
2. William Stallings, “Network Security Essentials”, Prentice Hall of India,New Delhi, 2nd
Edition, 2004
3. Charlie Kaufman , “Network Security: Private Communication in Public World”, Prentice
Hall of India, 2nd Edition,New Delhi, 2004
11PBEX12
ROUTING IN COMMUNICATION NETWORKS
L T P
3
0
0
C
3
Course objectives:
The main purpose of this course is to introduce students the various Network Routing
Algorithms. To learn about
 Routing algoithms in Circuit switching networks and Packet switching networks
 Routing in High speed and mobile networks and Mobile Ad-hoc networks
UNIT- I
CIRCUIT SWITCHING NETWORKS
(9)
Dynamic Alternative Routing-Dynamic Routing in Telephone Network– ATM networks with
virtual paths–Statistical multiplexing and homogeneous sources, delay guarantees, No statistical
multiplexing, heterogonous sources.
UNIT- II
PACKET SWITCHING NETWORKS
(9)
Distance vector Routing, Link State Routing, Inter domain Routing-Classless Interdomain
routing (CIDR), Interior Gateway routing protocols (IGRP) - Routing Information Protocol
(RIP), Open Shortest Path First (OSPF), Exterior Gateway Routing Protocol (EGRP) - Border
Gateway Protocol (BGP), Apple Talk Routing.
UNIT- III
HIGH SPEED NETWORKS
(9)
Routing in optical networks-Optical link networks-Single hop, multi hop optical networks,
hybrid optical networks, photonic networks, Routing in the PLANET network-Packet level
Routing–Call level Routing–Network infrastructure-Deflection Routing-Topologies, Deflection
routing Algorithms-Performance of routing algorithms on regular topologies –Deflection routing
on time varying topologies, resequencing – unslotted operation.
UNIT- IV
MOBILE NETWORKS
(9)
Routing in Cellular Mobile Radio Communication networks- Network Architecture, Air
interface functionality, Mobility management, Connectionless Data service for cellular systems,
Mobility and Routing in Cellular Digital Packet Data (CDPD) network, Packet Radio RoutingDARPApacket radio network, Routing algorithms for small, medium and large sized packet
radio networks.
UNIT- V
MOBILE AD-HOC NETWORKS
(9)
Internet based mobile ad-hoc networking, Routing algorithms – Table-driven routing-Destination
Sequenced Distance Vector(DSDV), Source initiated on-demand routing-Dynamic Source
Routing (DSR), Ad-hoc On- demand Distance Vector (AODV), Hierarchical based Routing Cluster head Gateway Switch Routing (CGSR)-Temporally-Ordered Routing Algorithm(TORA).
TOTAL HOURS=45
REFERENCES
1. M. Steen strub, “Routing in Communication networks”, Prentice Hall International,NewYork,
1995.
2. Internetworking Technologies Handbook, Inc. Cisco Systems, ILSG Cisco Systems, 4th
Edition, 2003.
3. William Stallings, “ISDN and Broadband ISDN with Frame Relay and ATM”, PHI, New
Delhi, 2004.
4. Behrouz A Forouzan, “Data Communications and Networking “,TMH, 3rd Edition, 2004
5. William Stallings,” High Speed Networks TCP/IP and ATM Design Principles”, Prentice Hall
International, New York, 1998.
11PBEX13
ADVANCED DIGITAL IMAGE PROCESSING
L T
3
0
P
0
C
3
Course objectives
 To study the image fundamentals and mathematical transforms necessary for image
processing.
 To study the image enhancement techniques
 To study image restoration procedures.
 To study the image compression procedures.
 To study the image segmentation and representation techniques.
UNIT- I
IMAGE REPRESENTATION AND TRANSFORMS
(9)
Image representation - Gray scale and color Images, image sampling and quantization. Two
dimensional orthogonal transforms - DFT, FFT, Haar transform, KLT, DCT.
UNIT- II
IMAGE ENHANCEMENT AND RESTORATION
(9)
Filters in spatial and frequency domains, histogram-based processing, homomorphic filtering.
Image Restoration - PSF, circulant and block-circulant matrices, deconvolution, restoration
using inverse filtering, Wiener filtering and maximum entropy-based methods.
UNIT- III
MORPHOLOGICAL OPERATIONS AND EDGE DETECTION (9)
Edge detection - Non parametric and model based approaches, LOG filters, localization problem.
Mathematical morphology - binary morphology, dilation, erosion, opening and closing,
duality relations, gray scale morphology, applications such as hit-and-miss transform,
thinning and shape decomposition.
UNIT- IV
TEXTURE ANALYSIS AND COMPUTER TOMOGRAPHY
(9)
Computer tomography - parallel beam projection, Radon transform, and its inverse,
Backprojection operator, Fourier-slice theorem, CBP and FBP methods, ART, Fan beam
projection. Image texture analysis - co-occurrence matrix, measures of textures, statistical
models for textures - Hough Transform, boundary detection, chain coding and segmentation,
thresholding methods.
UNIT- V
IMAGE COMMUNICATION
(9)
JPEG, MPEGs and H.26x standards, packet video, error concealment.
TOTAL HOURS=45
REFERENCES
1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson education,
2nd Edition,2002.
2. A. K. Jain, “Fundamentals of digital image processing”, Prentice Hall of India, 1989.
3. R.M. Haralick, and L.G. Shapiro, “Computer and Robot Vision”, Vol-1, Addison Wesley,
Reading, MA, 1992.
4. R. Jain, R. Kasturi and B.G. Schunck, “Machine Vision”, McGraw-Hill International
Edition, 1995.
5. W. K. Pratt, “Digital image processing”, Prentice Hall, 1989.
11PBEX14
MULTI USER THEORY
L
3
T
0
P
0
C
3
Course objectives
To know about the advanced area of multiple access and signal detection. To impart
 Code division multiple access channels
 Optimum detection matched filter design
UNIT- I
MULTIACCESS COMMUNICATIONS
(9)
The multi-access channel - FDMA and TDMA - Random Multiaccess-CDMA - CDMA channel
- Basic synchronous and asynchronous CDMA model - signature waveform - data streams modulation-fading-antenna arrays - Discrete time synchronous and asynchronous models.
UNIT- II
SINGLE-USER MATCHED FILTER
(9)
Hypothesis testing - Optimal receiver for single user channel - Q function - matched filter in the
CDMA function - Asymptotic multiuser efficiency and related measures - coherent single user
matched filter in Reyleigh fading - differentially coherent demodulation - non coherent
demodulation.
UNIT-III OPTIMUM MULTIUSER DETECTION AND DECORRELATING
DETECTOR
(9)
Optimum Detection and error probability for synchronous and asynchronous - channels Reyleigh fading - optimum noncoherent multiuser detection - decorrelating detector in
synchronous and asynchronous channel.
UNIT- IV
NONDECORRELATING LINEAR MULTIUSER DETECTION
(9)
Optimum linear multiuser detection- Minimum mean square linear multiuser detection performance of MMSE linear multiuser detection - Adaptive MMSE linear multiuser detection canonical representation of linear multiuser detectors - blind MMSE multiuser detection.
UNIT- V
SUCCESSIVE
CANCELLATION
AND
DECISION-FEEDBACK
MULTIUSER DETECTION
(9)
Successive cancellation - performance analysis of successive cancellation - multistage detection CT tentative decisions - decision feedback multiuser detection.
TOTAL HOURS=45
REFERENCES:
1. Sergio Verdo , "Multiuser Detection" Cambridge University Press, 1991
2. IEEE Transaction of communication "Special Issue on Multiuser detection", November,
1997
11PBEX15
DESIGN AND ANALYSIS OF ALGORITHMS
L T
3
0
P
0
C
3
Course objectives:
This course aims to introduce the classic algorithms in various domains, and techniques for
designing efficient algorithms.
UNIT- I INTRODUCTION
(9)
Polynomial and Exponential algorithms, big "oh" and small "oh" notation, exact algorithms and
heuristics, direct / indirect / deterministic algorithms, static and dynamic complexity, stepwise
refinement.
UNIT- II DESIGN TECHNIQUES
(9)
Subgoals method, working backwards, work tracking, branch and bound algorithms for traveling
salesman problem and knapsack problem, hill climbing techniques, divide and conquer method,
dynamic programming, greedy methods.
UNIT -III SEARCHING AND SORTING
(9)
Sequential search, binary search, block search, Fibonacci search, bubble sort, bucket sorting,
quick sort, heap sort, average case and worst case behavior, FFT.
UNIT- IV GRAPH ALGORITHMS
(9)
Minimum spanning, tree, shortest path algorithms, R-connected graphs, Even's and Kleitman's
algorithms, ax-flow min cut theorem, Steiglitz's link deficit algorithm.
UNIT-V SELECTED TOPICS
(9)
NP Completeness Approximation Algorithms, NP Hard Problems, Strasseu's Matrix
Multiplication Algorithms, Magic Squares, Introduction To Parallel Algorithms and Genetic
Algorithms, Monti-Carlo Methods, Amortised Analysis.
TOTAL HOURS= 45
REFERENCES
1. Sara Baase, "Computer Algorithms : Introduction to Design and Analysis", Addison Wesley,
1988.
2. T.H.Corman, C.E.Leiserson and R.L.Rioest, "Introduction to Algorithms", Mc Graw Hill,
1994.
3. E.Horowitz and S.Sahni, "Fundamentals of Computer Algorithms", Galgotia Publications,
1988.
4. D.E.Goldberg, "Genetic Algorithms : Search Optimization and Machine Learning", Addison
Wesley, 1989.
11PBEX16
4G WIRELESS NETWORKS
L
3
T
0
P
0
C
3
Course Objectives:
 In a fourth-generation wireless system, cellular providers have the opportunity to offer
data access to a wide variety of devices.
 A spectrally efficient system (in bits/s/Hz and bits/s/Hz/site)
 High network capacity: more simultaneous users per cell,
 Smooth handoff across heterogeneous networks, Seamless connectivity and global
roaming across multiple networks, High quality of service for next generation multimedia
support (real time audio, high speed data)
UNIT I
WIRELESS SYSTEMS
(9)
Cellular concept – cellular architecture. Cellular systems – 1G, 2G, 3G.Wireless in Local Loop,
Wireless ATM. Broadband Wireless Access – UWB, IEEE802.11a/b (Wi-Fi),
IEEE802.16(WiMax) – HIPERACCESS, IEEE802.20(MobileFi),IEEE802.21(MIHS) and
IEEE802.22(WRAN). Optical wireless networks.
UNIT II
4G – MAC
(9)
Introduction – 4G systems. Hybrid 4G network protocols, Channel modeling for 4GMIMO
and UWB. Adaptive and Reconfigurable Link layer, adaptive MAC-AMC, HARQ, CDMA,
TDMA/OFDMA. Software radio-DAB, DVB.
UNIT III
4G – ROUTING
(9)
Network overlay in 4G, Network synchronization and Power optimal routing. Adaptive network
layer-routing with topology aggregation. Adaptive resource management, Network deployment
and management.
UNIT IV
4G – MOBILITY MANAGEMENT
(9)
Mobility management – Concept, requirements and operations. Mobility support for LAN/MAN.
Mobility management models – Macro mobility and Micro mobility. Mobile IP-MIPv6, HMIP,
cellular IP, HAWAII and IDMP, Context-aware mobility management.
UNIT V
4G – TCP AND QoS
(9)
Adaptive TCP and cross layer optimization. Positioning in wireless networks, QoS –Issues.
Classifications of QoS approaches – MAC and Network layer solutions. QoS framework – QoS
models, QoS Resource reservation signaling, INSIGNIA, INORA, SWAN and proactive
RTMAC.
TOTAL HOURS= 45
REFERENCES:
1. Savo G.Glisic, “Advanced Wireless Networks: 4G Technologies”, Kindle Editions, 2006.
2. C.Siva Ram Murthy and B.S.manoj, “Ad-Hoc Wireless Networks- Architectures and
Protocols”, Pearson Education, 2004.
3. Hendrik Bernt, “Towards 4G Technologies: Services with Initiate”, Kindle Editions, 2006.
4. www.3gpp.org
11PBEX17
NEXT GENERATION IP NETWORKS
L T
3
0
P
0
C
3
Course Objectives:
 Gives important insights into the design of wireless IP networks
 Illustrates the standards and network architectures defined by leading standards bodies
(including MWIF, 3GPP and 3GPP2)
 Discusses protocols in four key areas: signaling, mobility, quality of service, and security
UNIT- I
IP V6 ADRESSING
(9)
Next Generation Networks-Overview-IP V6 Specification-Addressing Architecture- Address
Allocation Management-Unicast Address Allocation-Global Unicast Address Format-Testing
Address Allocation-Multicast Addressing-Reversed IP V6 Subnet any cast addresses.
UNIT -II
IP V6 TRANSMISSION AND SECURITY
(9)
Internet Control Message Protocol-Hop-by-Hop Options-Header Compression-Packet Tunneling
-Domain Name System-Transition Mechanisms-Routing-Renumbering-IP Privacy -Security
Architecture for the Internet Protocol-IP Authentication Header-IP Encapsulation Security
Payload-IP Authentication using Keyed MD5-The ESP DESCBC Transform.
UNIT- III
IP V6 OVER DIFFERENT NETWORKS
(9)
IP V6 over Ethernet Networks-IP V6 over FDDI Networks-IP V6 over Token ring Networks- IP
V6 over ARCnet Networks- IP V6 over PPP- IP V6 over NBMA Networks- IP V6 over ATM
Networks.
UNIT- IV
WIRELESS IP NETWORK ARCHITECTURES
(9)
3GPP Packet Data Networks, Network architecture, Protocol Reference Model, Packet Data
Protocols, Bearers, and connections for Packet Services, Packet Data Protocol (PDP) Context,
Steps for a Mobile to Access 3GPP Packet-Switched Services, User Packet Routing and
Transport, Configuring PDP Addresses on Mobile Stations, GPRS Attach Procedure, Access to
MWIF Networks, Session Management.
UNIT- V
NETWORK CONGESTION CONTROL AND AVOIDANCE
(9)
Introduction-Queue Management-Scheduling-Types of flows-Queue Management Techniques:
RED-FRED-SRED-PI Controller-REM- E-RED Scheduling Algorithms: Fair Queing-CFS.
TOTAL HOURS= 45
REFERENCES:
1. RFC 2373, -IP V6 Addressing Architecture, RFC 1881-IPv6 Address Allocation Management
2. RFC 2463-Internet Control Message Protocol, RFC 2402-IP Authentication Header
3. RFC 2497-Transmission of IPv6 Packets over ARCnet Networks, RFC-2492-IPv6 over ATM
Networks
4. http://www.faqs.org/rfcs/
5. JYH-CHENG CHEN, TAO ZHANG,”IP-Based Next Generation Wireless Networks
(Systems, Architectures and Protocols)”, by John Wiley & Sons, Published by John Wiley &
Sons, Inc., Hoboken, New Jersey.2004.
6. http://www.icir.org/floyd/red.html
11PBEX18 MODELING AND SIMULATION OF WIRELESS SYSTEMS
L T P C
3
0
0
3
Course objectives:
The analysis of wireless networks of interest today may include a potentially high number
of simulated hosts, their respective computationally-relevant protocol stacks, and their
complex, causally-determined aggregate behaviors.
 Simulation requirements determine memory- and computation-bottlenecks resulting in
performance and scalability problems for discrete-event sequential simulation tools and
methods, on a single physical execution unit (PEU).
UNIT I
SIMULATION OF RANDOM VARIABLES AND RANDOM PROCESS (9)
Univariate and multi-variate models, Transformation of random variables, Bounds and
Approximation, Random process models-Markov AND ARMA sequences, Sampling rate for
simulation, Computer generation and testing of random numbers.
UNIT II
MODELING OF COMMUNICATION SYSTEMS
(9)
Information Sources, Formatting/Source Coding, Digital Waveforms, Line Coding, Channel
Coding, Radio frequency and Optical Modulation, Demodulation and Detection, Filtering,
Multiplexing/Multiple Access, Synchronization, Calibration of Simulations.
UNIT III
COMMUNICATION CHANNELS & MODELS
(9)
Fading & Multipath Channels, Almost Free-Space Channels, Finite State Channel Models,
Methodology for Simulating Communication Systems Operating over Fading Channels,
Reference Models for Mobile Channels: GSM, UMTS-IMT-2000.
UNIT IV
ESTIMATION OF PARAMETERS IN SIMULATION
(9)
Quality of an estimator, Estimating the Average Level of a Waveform, Estimating the Average
power of a waveform, Estimating the Power Spectral Density of a process, Estimating the Delay
and Phase.
UNIT V ESTIMATION OF PERFORMANCE MEASURES FROM SIMULATION (9)
Estimation of SNR, Performance Measures for Digital Systems, Importance sampling method,
Efficient Simulation using Importance Sampling, Quasianalytical Estimation. Case Studies: 16QAM Equalized Line of Sight Digital Radio Link, CDMA Cellular Radio System.
TOTAL HOURS=45
REFERENCES:
1. M.C. Jeruchim, Philip Balaban and K.Sam Shanmugam, “ Simulation of Communication
Systems Modeling, Methodology and Techniques”, Kluwer Academic/Plenum Publishers, New
York, 2000.
2. C. Britton Rorabaugh, “Simulating Wireless Communication Systems: Practical Models in
C++”, Prentice Hall, 2004.
3. William H. Tranter, K. Sam Shanmugan, Theodore S. Rappaport, Kurt L. Kosbar, “Principles
of Communication Systems Simulation with Wireless Applications”, Prentice Hall PTR, 2002.
4. John G. Proakis, Masoud Salehi, Gerhard Bauch, Bill Stenquist, Tom Ziolkowski,
“Contemporary Communication Systems Using MATLAB” Thomson-Engineering, 2ndEdition,
2002.

11PBEX19
MOBILE AD HOC NETWORKS
L T
3
0
P
0
C
3
Course objectives
 To give sufficient background for undertaking AD-HOC networks.
 To introduce students to various MAC and NETWOK protocols
UNIT I
INTRODUCTION
(9)
Introduction to Ad Hoc networks - definition, characteristics features, appiications,
Characteristics of Wireless channel. Adhoc Mobility Models: - entity and group models.
UNIT II
MEDIUM ACCESS PROTOCOLS
(9)
MAC Protocols: design issues, goals and classification. Contention based protocols, reservation
based protocols, scheduling algorithms, protocols using directional antennas.
UNIT III
NETWORK PROTOCOLS
(9)
Addressing issues in ad hoc network, Routing Protocols: Design issues, goals and classification
Proactive Vs reactive routing, Unicast routing algorithms, Multicast routing algorithms, hybrid
routing algorithm, Power/ Energy aware routing algorithm, Hierarchical Routing, QoS aware
routing.
UNIT IV
END -TO - END DELIVERY AND SECURITY
(9)
Transport layer: Issues in designing- Transport layer classification, adhoc transport protocols.
Security issues in adhoc networks: issues and challenges, network security attacks, secure
routing protocols.
UNIT V CROSS LAYER DESIGN AND INTEGRATION OF ADHOC FOR 4G (9)
Cross layer Design: Need for cross layer design, cross layer optimization, parameter optimization
techniques, Cross layer cautionary perspective, Co-operative networks;- Architecture, methods
of co-operation, co-operative antennas, Integration of ad hoc network with other wired and
wireless networks.
TOTAL HOURS=45
REFERENCES
1. C.Siva Ram Murthy and B.S.Manoj, 'Ad hoc Wireless Networks Architectures and protocols",
2nd edition, Pearson Education. 2007.
2. Charles E. Perkins, "Ad hoc Networking", Addison - Wesley, 2000.
3. Stefano Basagni, Marco Conti, Silvia Giordano and Ivan stojmenovic, "Mobile adhoc
networking", Wiley-IEEE press, 2004.
4. Mohammad llyas, "The handbook of adhoc wireless networks", CRC press, 2002.
5. T. Camp, J. Boleng, and V Davies "A Survey of Mobility Models for Ad Hoc Network
Research," Wireless Communication and Mobile Comp., Special Issue on Mobile Ad Hoc
Networking Research, Trends and Applications, vol. 2, no. 5, 2002, pp.483-502.
6. Fekri M. Abduljalil and Shrikant K Bodhe , "A survey of integrating IP mobility protocols and
Mobile Ad hoc networks", IEEE communication Survey and tutorials, v 9.no.1 2007.
11PBEX20
MEDICAL IMAGE PROCESSING
L
3
T
0
P
0
C
3
Course objectives
 To give sufficient background for undertaking image processing fundamentals and
preprocessing techniques
 To introduce students to the image reconstruction and classification
UNIT I
IMAGE FUNDAMENTALS
(9)
Image Perception - MTF of the Visual System - Image Fidelity Criteria - Image Model – Image
Sampling and Quantization - Two Dimensional Sampling Theory - Image Quantization Optimum Mean Square Quantizer - Image Transforms - 2D - DFT and Other Transforms.
UNIT II
IMAGE PREPROCESSING
(9)
Image Enhancement - Point Operation - Histogram Modeling - Spatial Operations - Transform
Operations - Image Restoration - Image Degradation Model - Inverse and Weiner Filtering Image Compression - Spatial and Transform Methods
UNIT III
MEDICAL IMAGE RECONSTRUCTION
(9)
Mathematical Preliminaries and Basic Reconstruction Methods - Image Reconstruction in CT
Scanners - MRI, FMRI, Ultra Sound Imaging - 3D Ultra Sound Imaging Nuclear Medicine
Imaging Modalities - SPECT.PET - Molecular Imaging.
UNIT IV
IMAGE ANALYSIS AND CLASSIFICATION
(9)
Image Segmentation - Pixel Based - Edge Based - Region Based Segmentation - Image
Representation and Analysis - Feature Extraction and Representation - Statistical - Shape Texture - Feature and Image Classification - Statistical - Rule Based – Neural Network
Approaches.
UNIT V
IMAGE REGISTRATIONS AND VISUALIZATION
(9)
Rigid Body Visualization - Principal Axis Registration - Interactive Principal Axis Registration Feature based Registration - Elastic Deformation based Registration – Image Visualization - 2D
Display Methods - 3D Display Methods - Virtual Reality based Interactive Visualization.
TOTAL HOURS=45
REFERENCES
1. Atam P.Dhawan, “Medical Image Analysis”, Wiley Interscience Publication, 2003.
2. R.C.Gonzalez and R.E.Woods, “Digital Image Processing”, Pearson Education, 2002.
3. Anil. K. Jain, “Fundamentals of Digital Image Processing”, Pearson Education, 2003.
4. Alfred Horowitz, “MRI Physics for Radiologists - A Visual Approach”, Springer Verlag,
1991.
5. Kavyan Najarian and Robert Splerstor, “ Biomedical Signals and Image Processing”,2006.
6. John LSemmlow, “Biosignal and Biomedical Image Processing Matlab Based Applications”,
2004.
7. Jerry L.Prince and Jnathan M.Links, “Medical Imaging Signals and Systems”, Pearson
Education, 2006.