ldssyll

5�

I – SEMESTER

LINEAR ALGEBRA Subject Code : 12EC046 IA Marks : 50

No. of Lecture Hours/Week : 04 Exam Marks : 03

Total No. of Lecture Hours : 52 Exam Hours : 100

Linear equations: Fields; system of linear equations, and its solution sets; elementary row operations and echelon forms; matrix operations; invertible matrices, LU-factorization. (Ref.2 Chap.1) Vector Spaces: Vector spaces; subspaces; bases and dimension; coordinates; summary of row-equivalence; computations concerning subspaces. (Ref.1 Chap.2) Linear Transformations: Linear transformations; algebra of linear transformations; isomorphism; representation of transformations by matrices; linear functionals; transpose of a linear transformation.(Ref.2 Chap.3) Canonical Forms: Characteristic values; annihilating polynomials; invariant subspaces; direct-sum decompositions; invariant direct sums; primary decomposition theorem; cyclic bases; Jordan canonical form. Iterative estimates of characteristic values. (Ref.2 Chap.6) Inner Product Spaces: Inner products; inner product spaces; orthogonal sets and projections; Gram-Schmidt process; QR-factorization; least-squares problems; unitary operators. (Ref.1 Chap.8) Symmetric Matrices and Quadratic Forms: Digitalization; quadratic forms; constrained optimization; singular value decomposition. (Ref.2 Chap.7) REFERENCE BOOKS:

1.Gilbert Strang, "Linear Algebra and its Applications”, 3rd edition, Thomson Learning Asia, 2003. 2.Kenneth Hoffman and Ray Kunze, "Linear Algebra ," 2nd edition, Pearson Education (Asia) Pte. Ltd/ Prentice Hall of India, 2004. 3.David C. Lay, “Linear Algebra and its Applications,” 3rd edition, Pearson Education (Asia) Pte. Ltd, 2005 4.Bernard Kolman and David R. Hill, "Introductory Linear Algebra

with Applications," Pearson Education (Asia) Pte. Ltd, 7th edition, 2003.

6�

ANTENNA THEORY & DESIGN

Subject Code : 12EC011 IA Marks : 50

No. of Lecture Hours/Week : 04 Exam Hours : 03

Total No. of Lecture Hours : 52 Exam Marks : 100

Antenna Fundamentals and Definitions: Radiation mechanism - over view, Electromagnetic Fundamentals, Solution of Maxwell’s Equations for Radiation Problems, Ideal Dipole, Radiation Patterns, Directivity and Gain, Antenna Impedance, Radiation Efficiency. Antenna Polarization Resonant Antennas: Wires and Patches, Dipole ntennas, Yagi - Uda Antennas, Micro strip Antenna. Arrays: Array factor for linear arrays, uniformly excited, equally spaced Linear arrays, pattern multiplication, directivity of linear arrays, non- uniformly excited -equally spaced linear arrays, Mutual coupling, multidimensional arrays, phased arrays, feeding techniques, perspective on arrays. Broad band Antennas: Traveling - wave antennas, Helical antennas, Biconical antennas, sleave antennas, and Principles of frequency - independent Antennas, spiral antennas, and Log - Periodic Antennas. Aperture Antennas: Techniques for evaluating Gain, reflector antennas - Parabolic reflector antenna principles, Axi -symmetric parabolic reflector antenna, offset parabolic reflectors, dual reflector antennas, Gain calculations for reflector antennas, feed antennas for reflectors, field representations, matching the feed to the reflector, general feed model, feed antennas used in practice. Antenna Synthesis: Formulation of the synthesis problem, synthesis principles, line sources shaped beam synthesis, linear array shaped beam synthesis — Fourier Series, Woodward — Lawson sampling method, comparison of shaped beam synthesis methods, low side lobe narrow main beam synthesis methods Dolph Chebyshev linear array, Taylor line source method. ] Method of Moments : Introduction to method of Moments, Pocklington’s integral equation, integral equations and Kirchoff’s Networking Equations, Source Modeling Weighted residuals formulations and computational consideration, calculation of antenna and scatter characteristics.

7�

CEM for Antennas : Finite Difference Time Domain Method Geometrical Optics Wedge diffraction theory, ray fixed coordinate system, uniform theory of wedge diffraction, E - Plane analysis of Horn antennas. Cylindrical parabolic antenna, radiation by a slot on a finite ground plane, radiation by a monopole on a finite ground plane, equivalent current concepts, multiple diffraction formulation, by curved surfaces, physical optics, method of stationary phase, physical theory of diffraction, cylindrical parabolic reflector antennas. REFERENCE BOOKS:

1.C. A. Balanis: “Antenna Theory Analysis and Design”, John Wiley, 2nd Edition, 1997 2.Kraus: “Antennas”, McGraw Hill, TMH, 3rd/4th Edition. 3.Stutzman and Thiele, “Antenna Theory and Design”, 2ndEd, John Wiley and Sons Inc..

4. Sachidananda et. el, “Antenna and Propagation”, Pearson Edu.

Laboratory Experiments: (FEKO simulator can be used)

1. MATLAB / C Implementation to obtain radiation pattern of an antenna 2. Experimental study of radiation pattern of antenna. 3. Significance of pocklington’s integral equation 4. Measurement techniques of radiation characteristics of antenna. 5. Survey on frequency independent antennas 6. Analysis of E plane and H- plane Horns. (Any other experiments can be added to support the theory)

PROBOBALITY & RANDOM PROCESS




Introduction to Probability Theory: Experiments, sample space, Events, Axioms, Assigning probabilities, Joint and conditional probabilities, Baye’s Theorem, Independence, Discrete Random Variables, Engg Example.

8�

Random Variables, Distributions, Density Functions: CDF, PDF, Gaussian random variable, Uniform Exponential, Laplace, Gamma, Erlang, Chi-Square, Raleigh, Rician and Cauchy types of random variables . Operations on a Single R V: Expected value, EV of Random variables, EV of functions of Random variables, Central Moments, Conditional expected values. Characteristic functions, Probability generating functions, Moment generating functions, Engg applications, Scalar quantization, entropy and source coding.

Pairs of Random variables, Joint CDF, joint PDF, Joint probability mass functions, Conditional Distribution, density and mass functions, EV involving pairs of Random variables, Independent Random variables, Complex Random variables, Engg Application. Multiple Random Variables: Joint and conditional PMF, CDF, PDF,.EV involving multiple Random variables, Gaussian Random variable in multiple dimension, Engg application, linear prediction. Random Process: Definition and characterization, Mathematical tools for studying Random Processes, Stationary and Ergodic Random processes, Properties of ACF. Example Processes: Markov processes, Gaussian Processes, Poisson Processes, Engg application, Computer networks, Telephone networks. REFERENCE BOOKS:

1.Probability and random processes: application to Signal processing and communication - S L Miller and D C Childers: Academic Press / Elsivier 2004. 2.Probability, Random variables and stochastic processes - A. Papoullis and S U Pillai: McGraw Hill 2002. 3.Probability, Random variables and Random signal principles - Peyton Z Peebles: TMH 4th Edition 2007. 4.Probability, random processes and applications - H Stark and Woods: PHI 2001

DIGITAL CIRCUITS AND LOGIC DESIGN


9�

No. of Lecture Hours /week : 04 Exam Hours : 03 Total no. of Lecture Hours : 52 Exam Marks : 100

Threshold Logic: Introductory Concepts, Synthesis of Threshold Networks. Reliable Design and Fault Diagnosis Hazards: Fault Detection in Combinational Circuits, Fault-Location Experiments, Boolean Differences, Fault Detection by Path Sensitizing, Detection of Multiple Faults, Failure-Tolerant Design, Quadded Logic Capabilities, Minimization, and Transformation of Sequential Machines: The Finite- State Model, Further Definitions, Capabilities and Limitations of Finite – State Machines, State Equivalence and Machine Minimization, Simplification of Incompletely Specified Machines. Structure of Sequential Machines: Introductory Example, State Assignments Using Partitions, The Lattice of closed Partitions, Reductions of the Output Dependency, Input Independence and Autonomous Clocks, Covers and Generation of closed Partitions by state splitting, Information Flow in Sequential Machines, Decompositions, Synthesis of Multiple Machines. State—Identifications and Fault-Detection Experiments: Homing Experiments, Distinguishing Experiments, Machine Identification, Fault-Detection Experiments, Design of Diagnosable Machines, Second Algorithm for the Design of Fault Detection Experiments, Fault-Detection Experiments for Machines which have no Distinguishing Sequences. REFERENCE BOOKS:

1.Zvi Kohavi, “Switching and Finite Automata Theory”, 2nd Edition. Tata McGraw Hill Edition 2.Charles Roth Jr., “Digital Circuits and Logic Design”, 3.Parag K Lala, “Fault Tolerant And Fault Testable Hardware Design”, Prentice Hall Inc. 1985 4.E. V. Krishnamurthy, “Introductory Theory Of Computer ”, Macmillan Press Ltd, 1983 5.Mishra & Chandrasekaran, “Theory Of Computer Science –

Automata, Languages And Computation”, 2nd Edition, PHI,2004 ELECTIVE I

CMOS VLSI DESIGN


10

No. of Lecture Hours /week : 04 Exam Hours : 03 Total no. of Lecture Hours : 52 Exam Marks : 100

MOS Transistor theory: n MOS / p MOS transistor, threshold voltage equation, body effect, MOS device design equation, sub threshold region, Channel length modulation. mobility variation, Tunneling, punch through, hot electron effect MOS models, small signal AC Characteristics, CMOS inverter, βn / βp ratio, noise margin, static load MOS inverters, differential inverter, transmission gate, tristate inverter, BiCMOS inverter. CMOS Process Technology: Lambda Based Design rules, scaling factor, semiconductor Technology overview, basic CMOS technology, p well / n well / twin well process. Current CMOS enhancement (oxide isolation, LDD. refractory gate, multilayer inter connect) , Circuit elements, resistor , capacitor, interconnects, sheet resistance & standard unit capacitance concepts delay unit time, inverter delays , driving capacitive loads, propagate delays, MOS mask layer, stick diagram, design rules and layout, symbolic diagram, mask feints, scaling of MOS circuits. Basics of Digital CMOS Design: Combinational MOS Logic circuits-Introduction, CMOS logic circuits with a MOS load, CMOS logic circuits, complex logic circuits, Transmission Gate. Sequential MOS logic Circuits - Introduction, Behavior of hi stable elements, SR latch Circuit, clocked latch and Flip Flop Circuits, CMOS D latch and triggered Flip Flop. Dynamic Logic Circuits - Introduction, principles of pass transistor circuits, Voltage boot strapping synchronous dynamic circuits techniques, Dynamic CMOS circuit techniques CMOS Analog Design: Introduction, Single Amplifier. Differential Amplifier, Current mirrors, Band gap references, basis of cross operational amplifier. Dynamic CMOS and Clocking: Introduction, advantages of CMOS over NMOS, CMOS\SOS technology, CMOS\bulk technology, latch up in bulk CMOS., static CMOS design, Domino CMOS structure and design, Charge sharing, Clocking- clock generation, clock distribution, clocked storage elements. REFERENCE BOOKS:

1.Neil Weste and K. Eshragian,”Principles of CMOS VLSI Design: A System Perspective”, 2nd edition, Pearson Education (Asia) Pte. Ltd., 2000. 2. Wayne, Wolf, “Modern VLSI design: System on Silicon”, Pearson Education, Second Edition

11

3.Douglas A Pucknell & Kamran Eshragian , “Basic VLSI Design”, PHI 3rd Edition (original Edition – 1994) 4.Sung Mo Kang & Yosuf Lederabic Law, “CMOS Digital Integrated Circuits: Analysis and Design”, McGraw-Hill (Third Edition).

NETWORK PROTOCOL DESIGN

Subject Code : 12EC057 IA Marks : 50 No. of Lecture Hours /week : 04 Exam Hours : 03 Total no. of Lecture Hours : 52 Exam Marks : 100

Introduction: How to specify network protocols? Semantics of traditional protocol specifications, syntax of traditional protocol specifications new protocol specifications first protocol examples a vending machine protocol a request/reply protocol a Manchester encoding protocol the current internet network processes constants, inputs, and variables actions protocol execution processes in the internet more on processes messages with fields nondeterministic assignment process arrays parameters a resource allocation protocol process communication in the internet Transmission and Error: types of transmission errors protocol execution under error occurrence protocols that tolerate error occurrence normal timeout actions implementing normal timeout actions transmission errors in the internet connections using timeouts connections using identifiers full-duplex and half-duplex connections, connections in the internet data transfer and multiplexing data with idleness multiplexing data with control multiplexing data with data, data transfer and multiplexing in the internet error detection, detection of message corruption detection of message loss detection of message reorder error detection in the internet error recovery forward error recovery backward error recovery cumulative acknowledgment individual acknowledgment block acknowledgment error recovery in the internet flow control window size control rate control circular buffer control flow control in the internet maintaining topology information local and global topology information maintaining local topology information maintaining hierarchical topology information maintaining topology information in the internet the abstraction of perfect channel using the abstraction of perfect channel the abstraction of perfect channel in the internet Routing and Switching: hierarchical routing random routing detection of message reorder error detection in the internet circuit switching datagram switching , switching in networks with changing topologies switching in the internet congestion control congestion control in circuit networks congestion control in datagram networks deadlock prevention in datagram networks congestion control in the internet the abstraction of virtual neighborhood the

12

abstraction of virtual neighborhood in the internet using the abstraction of virtual neighborhood naming and name resolution hierarchical names name resolution name caches naming and name resolution in the internet Security and Applications: asymmetric and symmetric keys authentication using asymmetric keys authentication using symmetric keys privacy and integrity non-repudiation authorization message digest security in the internet data compression Huffman coding static Huffman compression dynamic Huffman compression context-sensitive compression lossy compression data compression in the internet broadcast and multicast maintaining spanning trees low-level broadcast high -level broadcast ordered precedence, and recall broadcasts hierarchy of broadcast primitives broadcast and multicast in the internet application structures sockets clients and servers using sockets clients and servers using remote procedures application structures in the internet applications echo file transfer remote login applications in the internet ring networks types of ring networks slotted ring networks token ring networks ring networks in the internet broadcast networks broadcast processes collision prevention collision resolution broadcast networks in the internet protocol layers and hierarchies protocols versus protocol layers a connection protocol layer an error recovery protocol layer a protocol hierarchy example protocol hierarchies in computer networks the next internet. REFERENCE BOOKS:

1.Mohamed G. Gouda, “Elements of Network Protocol Design”, John

Wiley & Sons 2004

2.Douglas E Comer, “Computer Networks and Internet with Internet

Applications”, Fourth Edition, Pearson 2004

DIGITAL SYSTEM DESIGN USING VERILOG Subject Code : 12EC121 IA Marks : 50 No. of Lecture Hours /week : 04 Exam Hours : 03 Total no. of Lecture Hours : 52 Exam Marks : 100

Introduction and Methodology:

13

Digital Systems and Embedded Systems, Binary representation and Circuit Elements, Real-World Circuits, Models, Design Methodology. Combinational Basics: Boolean Functions and Boolean Algebra, Binary Coding, Combinational Components and Circuits, Verification of Combinational Circuits. Number Basics: Unsigned and Signed Integers, Fixed and Floating-point Numbers. Sequential Basics: Storage elements, Counters, Sequential Datapaths and Control, Clocked Synchronous Timing Methodology. Memories: Concepts, Memory Types, Error Detection and Correction. Implementation Fabrics: ICs, PLDs, Packaging and Circuit Boards, Interconnection and Signal Integrity. Processor Basics: Embedded Computer Organization, Instruction and Data, Interfacing with memory. I/O interfacing: I/O devices, I/O controllers, Parallel Buses, Serial Transmission, I/O software. Accelerators: Concepts, case study, Verification of accelerators. Design Methodology: Design flow, Design optimization, Design for test, Refernces: 1.“Digital Design: An Embedded Ssytems Approach Using VERILOG”, Peter J. Ashenden, Elesvier, 2010.

14

SEMSTER - II ADVANCED DIGITAL COMMUNIC ATIONS


Digital Modulation Techniques: Digital Modulation Formats, Coherent Binary Modulation Techniques, Coherent Quadrature –Modulation Techniques, NonCoherent Binary Modulation Techniques, Comparison of Binary and Quaternary Modulation Techniques, M-ary Modulation Techniques, Power Spectra, Bandwidth Efficiency, M-ary Modulation formats viewed in the Light of the channel capacity Theorem, Effect of Intersymbol Interference, Bit Versus Symbol Error Probabilities, Synchronisation, Applications.(Ref.3 Chap.7)

Coding Techniques: Convolutional Encoding, Convolutional Encoder Representation, Formulation of the Convolutional Decoding Problem, Properties of Convolutional Codes: Distance property of convolutional codes, Systematic and Nonsystematic Convolutional Codes, Performance Bounds for Convolutional Codes, Coding Gain. Other Convolutional Decoding Algorithms: Sequential Decoding, Feedback Decoding,Turbo Codes.(Ref.2 Chap.7 & 8)

Communication through band limited linear filter channels: Optimum receiver for channels with ISI and AWGN, Linear equalization, Decision-feedback equalization, reduced complexity ML detectors, Iterative equalization and decoding-Turbo equalization. (Ref.1 Chap.10)

Adaptive Equalization: Adaptive linear equalizer, adaptive decision feedback equalizer, adaptive equalization of Trellis- coded signals, Recursive least squares algorithms for adaptive equalization, self recovering (blind) equalization. (Ref.1 Chap.11)

Spread Spectrum Signals for Digital Communication: Model of Spread Spectrum Digital Communication System, Direct Sequence Spread Spectrum Signals, Frequency-Hopped Spread Spectrum Signals, CDMA, time-hopping SS, Synchronization of SS systems. (Ref.1 Chap.13)

Digital Communication Through Fading Multi-Path Channels: Characterization of fading multi-path channels, the effect of signal characteristics on the choice of a channel model, frequency-Nonselective, slowly fading channel, diversity techniques for fading multi-path channels, Digital signal over a frequency-selective, slowly fading channel, coded wave forms for fading channels, multiple antenna systems. (Ref.1 Chap.14)

15

REFERENCE BOOKS:

1. John G. Proakis, ―Digital Communications�, 4th edition, McGraw Hill, 2001.

2. Bernard Sklar, ―”Digital Communications - Fundamentals and

Applications” , 2nd

Edition Pearson Education (Asia) Ptv. Ltd, 2001.

3. Simon Haykin, ― Digital Communications�, John Wiley and Sons,

4. Andrew J. Viterbi, ―CDMA: Principles of Spread Spectrum Communications�, Prentice Hall, USA, 1995.

--------------------------------------------------------

Advanced Communication Lab List of Experiments:- 1.Measurements of directivity and beamwidth of the following antennae from their

Radiation pattern: Pyramidal from ( Waveguide type). Parabola (dish type).

2.Determination of Modes, Transit time, Electronic timing range and sensitivity of Klystron source. 3.Determination of VI characteristic of GUNN Diode and measurement of guide wavelength, frequency and VSWR. 4.Determination of coupling coefficient and insertion loss of directional coupler and magic tree. 5.Antenna Resonance and Gain Bandwidth measurements.. 6.Generation of bi-phase code from NRZ and vice-versa. 7.Digital modulation of speech signals and demodulation. 8.Generation of pseudo-random code using shift register, filtering. 9.Voice and data multiplexing (TDM) using optical fiber. 10.Performance of digital modulation and demodulation of known signals in presence of noise. 11.Study of WGN, computation of its auto-correlation and statistical parameter (MATLBA/SCILAB may used). 12.Discrete version of DPSK modulation & demodulation. 13.ASK, PSK and FSK using CD4051 IC.

Any other experiments may be added to supplement the theory.

MODERN DSP

16


Introduction and Discrete Fourier Transforms: Signals, Systems and Processing, Classification of Signals, The Concept of Frequency in Continuous-Time and Discrete-Time Signals, Analog-to-Digital and Digital-to-Analog Conversion, Frequency-Domain Sampling: The Discrete Fourier Transform, Properties of the DFT, Linear Filtering Methods Based on the DFT(Ref.1 Chap.1 & 7). Design of Digital Filters: General Considerations, Design of FIR Filters, Design of IIR Filters from Analog Filters, Frequency Transformations. (Ref.1 Chap.10)

Multirate Digital Signal Processing: Introduction, Decimation by a factor ‘D’, Interpolation by a factor ‘I’, Sampling rate Conversion by a factor ‘I/D’, implementation of Sampling rate conversion, Multistage implementation of Sampling rate conversion, Sampling rate conversion of Band Pass Signals, Sampling rate conversion by an arbitrary factor, Applications of Multirate Signal Processing, Digital Filter banks, Two Channel Quadrature Mirror Filter banks, M-Channel QMF bank.(Ref.1 Chap.11)

Adaptive Filters: Applications of Adaptive Filters, Adaptive Direct Form FIR Filters- The LMS Algorithm, Adaptive Direct Form Filters-RLS Algorithm. (Ref.1 Chap.13)

References:

1. Proakis and Manolakis, “Digital Signal Processing”, Prentice Hall 1996. (third edition).

2. Roberto Cristi, “Modern Digital Signal Processing”, Cengage Publishers, India, (erstwhile Thompson Publications), 2003.

3. S.K. Mitra, “Digital Signal Processing: A Computer Based Approach” , III Ed, Tata McGraw Hill, India, 2007.

4. E.C. Ifeachor and B W Jarvis, “Digital Signal Processing, a practitioners approach,” II Edition, Pearson Education, India, 2002 Reprint.

--------------------------------- Laboratory Experiments: I. Modern Digital Signal Processing

i. Using MATLAB 1 Question based on response of LTI systems to different inputs

17

A LTI system is defined by the difference equation y[n]=x[n]+x[n-1]+x[n-2]. (a) Determine the impulse response of the system and sketch it. (b) Determine the output y[n] of the system when the input is x[n]=u[n]. (c) Determine the output of the system when the input is a complex exponential (Eg. x[n]=2ej0.2πn).

2.Question on design of simple digital filter using the relationship between

pole and zeros and the frequency response of the system Design a simple digital FIR filter with real co-efficients to remove a narrowband (i.e., sinusoidal) disturbance with frequency F0=50 Hz. Let Fs=300 Hz be the sampling frequency. (a) Determine the desired zeros and poles of the filter. (b) Determine the filter coefficients with the gain K=1 (c) Sketch the magnitude of the frequency response. 3 Question on simple digital filtering using the relationship between pole and zeros and the frequency response of the system Design an IIR filter with real co-efficients with same specifications mentioned in Q2 and repeat the steps (a) to (c). 4. Question to understand the effect of time domain windowing Generate a signal with two frequencies x(t)=3cos(2πF1t) + 2cos(2πF2t) sampled at Fs=8 kHz. Let F1=1 kHz and F2=F1+∆ and the overall data length be N=256 points. (a) From theory, determine the minimum value of ∆ necessary to distinguish between the two frequencies. (b) Verify this result experimentally. Using the rectangular window, look at the DFT with several values of ∆ so that you verify the resolution. (c) Repeat part (b) using a Hamming window. How did the resolution change? 5 Comparison of DFT and DCT (in terms of energy compactness) Generate the sequence x[n]=n-64 for n=0,…127. (a) Let X[k]=DFT{x[n]}. For various values of L, set to zero the “high frequency coefficients” X[64-L]=….X[64]=…….=X[64+L]=0 and take the inverse DFT. Plot the results. (b) Let XDCT[k]=DCT(x[n]}. For the same values of L, set to zero the “high frequency coefficients” XDCT[127-L]=…….XDCT[127]. Take the inverse DCT for each case and compare the reconstruction with the previous case. 6 Filter design Design a discrete time low pass filter with the specifications given below:

18

Sampling frequency = 2 kHz. Pass band edge = 260 Hz Stop band edge = 340 Hz Max. pass band attenuation = 0.1 dB Minimum stop band attenuation = 30 dB Use the following design methodologies: Hamming windowing Kaiser windowing Applying bilinear transformation to a suitable, analog Butterworth filter. Compare the obtained filters in terms of performance (accuracy in meeting specifications) and computational complexity. ii. Using DSP PROCESSOR 1 Write an ALP to obtain the response of a system using linear convolution whose input and impulse response are specified. 1.Write an ALP to obtain the impulse response of the given system, given the difference equation. . 2.Sampling of an Image. 3.Design of equiripple filters. 4.Application of frequency transformation in filter design. 5.Computation of FFT when N is not a power of 2. 6.Sampling rate conversion and plot of spectrum. 7.Analysis of signals by STFT and WT. 8.Delayed auditory feedback signal using 6713 processor. 9.Record of machinery noise like fan or blower or diesel generator

and obtaining its spectrum. 11. Synthesis of select dual tone multi frequency signals using 6713 processor. 12. Fourier Transform & its inverse Fourier Transform of an image. Any other experiments can be added to supplement the theory. ------------------------------------------------ ADVANCED EMBEDDED SYSTEMS Subject Code : 12EC118 IA Marks : 50 No. of Lecture Hours /week : 04 Exam Hours : 03 Total no. of Lecture Hours : 70 Exam Marks : 100

19

Typical Embedded System : Core of the Embedded System, Memory, Sensors and Actuators, Communication Interface, Embedded Firmware, Other System Components Characteristics and Quality Attributes of Embedded Systems : Hardware Software Co-Design and Program Modelling : Fundamental Issues in Hardware Software Co-Design, Computational Models in Embedded Design, Introduction to Unified Modelling Language, Hardware Software Trade-offs Embedded Firmware Design and Development : Embedded Firmware Design Approaches, Embedded Firmware Development Languages. Real-Time Operating System (RTOS) based Embedded System Design : Operating System Basics, Types of OS, Tasks, Process and Threads, Multiprocessing and Multitasking, Task Scheduling, Threads, Processes and Scheduling: Putting them altogether, Task Communication, Task Synchronization, Device Drivers, How to Choose an RTOS The Embedded System Development Environment: The Integrated Development Environment (IDE), Types of Files Generated on Cross-compilation, Disassembler/Decompiler, Simulators, Emulators and Debugging, Target Hardware Debugging, Boundary Scan Trends in the Embedded Industry : Processor Trends in Embedded System, Embedded OS Trends, Development Language Trends, Open Standards, Frameworks and Alliances, Bottlenecks Reference Books:: 1.Shibu K V, Introduction to Embedded Systems, Tata McGraw Hill Education Private Limited, 2009 2.James K Peckol, Embedded Systems – A contemporary Design Tool, John Wiely, 2008. Advanced Embedded System Lab: Lab Experiments:-

1. Use the EDA (Electronic Design Automation) tools to learn the Embedded Hardware Design and for PCB design. 2. Familiarize the different entities for the circuit diagram design. 3. Familiarize with the layout design tool, building blocks, component placement, routings, design rule checking etc.

Embedded Programming Concepts (RTOS):

4. Create ‘n’ number of child threads. Each thread prints the message “ I’m in thread number …” and sleeps for 50 ms and then quits. The main

20

thread waits for complete execution of all the child threads and then quits. Compile and execute in Linux.

5. Implement the multithread application satisfying the following : 6. Two child threads are crated with normal priority. a. Thread 1 receives and prints its priority and sleeps for 50ms and then quits. b. Thread 2 prints the priority of the thread 1 and rises its priority to above normal and retrieves the new priority of thread 1, prints it and then quits. c. The main thread waits for the child thread to complete its job and quits. d. Implement the usage of anonymous pipe with 512 bytes for data sharing between parent and child processes using handle inheritance mechanism. 7. Test the program below using multithread application-

a. The main thread creates a child thread with default stack size and name ‘Child_Thread’. b. The main thread sends user defined messages and the message ‘WM_QUIT’ randomly to the child thread. c. . The child thread processes the message posted by the main thread and quits when it receives the ‘WM_QUIT’ messge. d. The main thread checks the termination of the child thread and quits when the child thread complete its execution. e. The main thread continues sending the random messages to the child thread till the ‘WM_QUIT’ message is sent to child thread. f. The messaging mechanism between the main thread and child thread is synchronous. 8. Test the program application for creating an anonymous pipe with 512

bytes of size and pass the ‘Read Handle’ of the pipe to a second process using memory mapped object. The first process writes a message ‘ Hi from Pipe Server’. The 2nd process reads the data written by the pipe server to the pipe and displays it on the console. Use event object for indicating the availability of data on the pipe and mutex objects for synchronizing the access in the pipe.

9. Create a POSIX based message queue for communicating between two tasks as per the requirements given below:-

a. Use a named message queue with name ‘MyQueue’. b. Create two tasks(Task1 & Task2) with stack size 4000 & priorities 99 & 100 respectively. c. Task 1 creates the specified message queue as Read Write and reads the message present, if any, from the message queue and prints it on the console. d. Task2 open the message queue and posts the message ‘Hi from Task2’.

21

f. Handle all possible error scenarios appropriately. Any other experiments can be included to support the theory.

_____________________________________________________

ADVANCED COMPUTER ARCHITECTURE


Parallel Computer Models: The state of computing, Classification of parallel computers, Multiprocessors and multicomputers, Multivector and SIMD computers. Program and Network Properties: Conditions of parallelism, Data and resource Dependences, Hardware and software parallelism, Program partitioning and scheduling, Grain Size and latency, Program flow mechanisms, Control flow versus data flow, Data flow Architecture, Demand driven mechanisms, Comparisons of flow mechanisms Principles of Scalable Performance: Performance Metrics and Mesaures, Parallel Processing Applications, Speedup Performance Laws, Scalability Analysis and Approches. Advanced Processors: Advanced processor technology, Instruction-set Architectures, CISC Scalar Processors, RISC Scalar Processors, Superscalar Processors, VLIW Architectures, Vector and Symbolic processors Pipelining: Linear pipeline processor, nonlinear pipeline processor, Instruction pipeline Design, Mechanisms for instruction pipelining, Dynamic instruction scheduling, Branch Handling techniques, branch prediction, Arithmetic Pipeline Design, Computer arithmetic principles, Static Arithmetic pipeline, Multifunctional arithmetic pipelines Memory Hierarchy Design: Cache basics & cache performance, reducing miss rate and miss penalty, multilevel cache hierarchies, main memory organizations, design of memory hierarchies. Multiprocessor Architectures: Symmetric shared memory architectures, distributed shared memory architectures, models of memory consistency, cache coherence protocols (MSI, MESI, MOESI), scalable cache coherence,

22

overview of directory based approaches, design challenges of directory protocols, memory based directory protocols, cache based directory protocols, protocol design tradeoffs, synchronization, Multithread and Dataflow Architecure: Principles of Multithreading, Scalable and Multithreaded Architecure, Dataflow Architecture REFERENCE BOOKS:

1.Kai Hwang, “Advanced computer architecture”; TMH. 2.Kai Hwang and Zu, “Scalable Parallel Computers Architecture”; MGH. 3.M.J Flynn, “Computer Architecture, Pipelined and Parallel Processor Design”; Narosa Publishing. 4.D.A.Patterson, J.L.Hennessy, “Computer Architecture :A quantitative approach”; Morgan Kauffmann feb,2002.

ELECTIVE – II

NANOELECTRONICS


Introduction: Overview of nanoscience and engineering,Development milestones in microfabrication and electronic industry,Moores law and continued miniaturization,Classification of Nano structures,Electronic properties of atoms and solids: Isolated atom, Bonding between atoms,Giant molecular solids,Free electron models and energy bands,crystalline solids, Periodicity of crystal lattices, Electronic conduction,effects of nanometer length scale,Fabrication methods: Top down processes,Bottom up processes methods for templating the growth of nanomaterials, ordering of nanosystems.

Characterization: Classification, Microscopic techniques, Field ion microscopy, scanning probe techniques, diffraction techniques: bulk ,surface, spectroscopy techniques: photon, radiofrequency, electron, surface analysis and dept profiling: electron, mass, Ion beam, Reflectrometry, Techniques for property measurement: mechanical, electron, magnetic, thermal properties.

23

Inorganic semiconductor nanostructures: overview of semiconductor physics,Quantum confinement in semiconductor nanostructures:quantum wells,quantum wires,quantum dots,superlattices,band offsets,electronic density of states.

Fabrication techniques: requirements of ideal semiconductor,epitaxial growth of quantum wells, lithography and etching,cleaved edge overgrowth,growth of vicinal substrates,strain induced dots and wires,electrostatically induced dots and wires,Quantum well width fluctuations,thermally annealed quantum wells,semiconductor nanocrystals,collidal quantum dots,self-assembly techniques.

Physical processes: modulation doping,quantum hall effect,resonant tunneling,charging effects,ballistic carrier transport,Inter band absorption, intraband absorption,Light emission processes,phonon bottleneck, quantum confined stark effect,nonlinear effects,coherence and dephasing, characterization of semiconductor nanostructures:optical electrical and structural.

Methods of measuring properties:structure: atomic,crystallography,microscopy,spectroscopy. Properties of nanoparticles: metal nano clusters, semiconducting nanoparticles, rare gas and molecular clusters, methods of synthesis(RF, chemical, thermolysis,pulsed laser methods) Carbon nanostructures and its applications(field emission and shielding,computers,fuel cells,sensors,catalysis).Self assembling nanostructured molecular materials and devices: building blocks,principles of self assembly, methods to prepare and pattern nanoparticles,templated nanostructures,liquid crystal mesophases.Nanomagnetic materials and devices:magnetism,materials,magneto resistance,nanomagnetism in technology,challenges facing nano magnetism.

Applications: Injection lasers,quantum cascade lasers,singe photon sources,biological tagging,optical memories,coulomb blocade devices,photonic structures,QWIP’s,NEMS,MEMS.

References:

1.Ed Robert Kelsall,Ian Hamley,Mark Geoghegan, “ Nanoscale science and technology” ,John wiley and sons,2007.

2.Charles P Poole,Jr,Frank J owens “Introduction to Nanotechnology”,John wiley,copyright 2006,Reprint 2011.

3.Ed William A Goddard III,Donald W Brenner,Sergey Edward Lyshevski,Gerald J Lafrate, “ Hand Book of Nanoscience Engineering and Technology” ,CRC press,2003.

24

WIRELESS AND MOBILE NETWORKS


Review of fundamentals of wireless communication and networks. Wireless communication channel specifications, wireless communication systems, wireless networks, switching technology, communication problems, wireless network issues and standards. Wireless body area networks (WBAN). Properties, network architecture, components, technologies, design issues, protocols and applications. Wireless personal area networks. Architecture, components, requirements, technologies and protocols, Bluetooth and Zigbee. Wireless LANS. Network components, design requirements, architectures, IEEE 802.11x, WLAN protocols, 802.11 p and applications. WMANs. IEEE 802.16, architectures, components, WiMax mobility support, protocols, broadband networks and applications. WWANs. Cellular networks, Satellite networks, applications. Wireless adhoc networks. Mobile adhoc networks, Sensor networks, Mesh networks, VANETs. Research issues in wireless networks. References: 1. S. S. Manvi, M. S. Kakkasageri, “Wireles and Mobile Network concepts and protocols”, Wiley, First edition, 2010. 2. P. Kaveh, Krishnamurthy, “Principles of wireless networks: Aunified approach”, PHI, 2006. 3. Iti Saha Mishra, “Wireless communication and networks 3G and beyond “, MGH, 2009 4. Mullet, “Introduction to wireless telecommunication systems and networks”, Cengage, 2009. 5. D. P. Agarwal, Qing An Zeng, “Introduction to wireless and mobile systems”, Cengage, 2008.

25

6. Yi-Bing Lin, Imrich Chlamtac, “ Wireless and Mobile Network Architectures” , Wiley, 2009 AUTOMOTIVE ELECTRONICS

Subject Code :12EC117 IA Marks : 50 No. of Lecture Hours /week : 04 Exam Hours : 03 Total no. of Lecture Hours : 52 Exam Marks : 100

Automotive Fundamentals Overview – Four Stroke Cycle, Engine Control, Ignition System, Spark plug, Spark pulse generation, Ignition Timing, Drive Train, Transmission, Brakes, Steering System, Battery, Starting System

Air/Fuel Systems – Fuel Handling, Air Intake System, Air/ Fuel Management Sensors – Oxygen (O2/EGO) Sensors, Throttle Position Sensor (TPS), Engine Crankshaft Angular Position (CKP) Sensor, Magnetic Reluctance Position Sensor, Engine Speed Sensor, Ignition Timing Sensor, Hall effect Position Sensor, Shielded Field Sensor, Optical Crankshaft Position Sensor, Manifold Absolute Pressure (MAP) Sensor - Strain gauge and Capacitor capsule, Engine Coolant Temperature (ECT) Sensor, Intake Air Temperature (IAT) Sensor, Knock Sensor, Airflow rate sensor, Throttle angle sensor Actuators – Fuel Metering Actuator, Fuel Injector, Ignition Actuator Exhaust After-Treatment Systems – AIR, Catalytic Converter, Exhaust Gas Recirculation (EGR), Evaporative Emission Systems

Electronic Engine Control – Engine parameters, variables, Engine Performance terms, Electronic Fuel Control System, Electronic Ignition control, Idle sped control, EGR Control Communication – Serial Data, Communication Systems, Protection, Body and Chassis Electrical Systems, Remote Keyless Entry, GPS

Vehicle Motion Control – Cruise Control, Chassis, Power Brakes, Antilock Brake System (ABS), Electronic Steering Control, Power Steering, Traction Control, Electronically controlled suspension Automotive Instrumentation – Sampling, Measurement & Signal Conversion of various parameters.

Integrated Body – Climate Control Systems, Electronic HVAC Systems,

26

Safety Systems – SIR, Interior Safety, Lighting, Entertainment Systems Automotive Diagnostics – Timing Light, Engine Analyzer, On-board diagnostics, Off-board diagnostics, Expert Systems Future Automotive Electronic Systems – Alternative Fuel Engines, Collision Avoidance Radar warning Systems, Low tire pressure warning system, Radio navigation, Advance Driver Information System

REFERENCE BOOKS: 1. William B. Ribbens: Understanding Automotive Electronics, 6th Edition, SAMS/Elsevier Publishing 2. Robert Bosch GmbH: Automotive Electrics Automotive Electronics Systems and Components, 5th edition, John Wiley& Sons Ltd., 2007

SEMESTER – III

ERROR CONTROL AND CODING


Introduction to Algebra: Groups, Fields, Binary Field Arithmetic, Construction of Galois Field GF (2m) and its basic properties, Computation using Galois Field GF (2m) Arithmetic, Vector spaces and Matrices.(Ref.1 Chap.2) Linear Block Codes: Generator and Parity check Matrices, Encoding circuits, Syndrome and Error Detection, Minimum Distance Considerations, Error detecting and Error correcting capabilities, Standard array and Syndrome decoding, Decoding circuits, Hamming Codes, Reed – Muller codes, The (24, 12) Golay code, Product codes and Interleaved codes.(Ref.1 Chap.3)

27

Cyclic Codes: Introduction, Generator and Parity check Polynomials, Encoding using Multiplication circuits, Systematic Cyclic codes – Encoding using Feed back shift register circuits, Generator matrix for Cyclic codes, Syndrome computation and Error detection, Meggitt decoder, Error trapping decoding, Cyclic Hamming codes, The (23, 12) Golay code, Shortened cyclic codes.(Ref.1 Chap.5) BCH Codes: Binary primitive BCH codes, Decoding procedures, Implementation of Galois field Arithmetic, Implementation of Error correction. Non – binary BCH codes: q – ary Linear Block Codes, Primitive BCH codes over GF (q), Reed – Solomon Codes, Decoding of Non – Binary BCH and RS codes: The Berlekamp - Massey Algorithm.(Ref.1 Chap.6) Majority Logic Decodable Codes: One – Step Majority logic decoding, one – step Majority logic decodable Codes, Two – step Majority logic decoding, Multiple – step Majority logic decoding.(Ref.1 Chap.8) Convolutional Codes: Encoding of Convolutional codes, Structural properties, Distance properties, Viterbi Decoding Algorithm for decoding, Soft – output Viterbi Algorithm, Stack and Fano sequential decoding Algorithms, Majority logic decoding(Ref.1 Chap.11) Concatenated Codes & Turbo Codes: Single level Concatenated codes, Multilevel Concatenated codes, Soft decision Multistage decoding, Concatenated coding schemes with Convolutional Inner codes, Introduction to Turbo coding and their distance properties, Design of Turbo codes.(Ref.1 Chap.15) Burst – Error – Correcting Codes: Burst and Random error correcting codes, Concept of Inter – leaving, cyclic codes for Burst Error correction – Fire codes, Convolutional codes for Burst Error correction.(Ref.1 Chap.21)

REFERENCE BOOKS:

1.Shu Lin & Daniel J. Costello, Jr. “Error Control Coding ” Pearson / Prentice Hall, Second Edition, 2004. (Major Reference) 2.Blahut, R.E. “Theory and Practice of Error Control Codes”

Addison Wesley, 1984

ELECTIVE – III

SIMULATION MODELING AND ANALYSIS Subject Code : 12EC128 IA Marks : 50

No. of Lecture Hours/Week : 04 Exam Hours : 03

28

Total No. of Lecture Hours : 52 Exam Marks : 100

Basic simulation modeling: nature of simulation, system models, discrete event simulation, single server simulation, alternative approaches, other types of simulation.(Ref.1 Chap.1) Building valid, credible and detailed simulation models. Techniques for increasing model validity and credibility, comparing real world observations. (Ref.1 Chap.5) Selecting input probability distributions. Useful probability distributions, assessing sample independence, activity I, II and III. Models of arrival process.(Ref.1 Chap.6) Random numbers generators: linear congruential, other kinds, testing random number generators. Random variate generation: approaches, continuous random variates, discrete random variates, correlated random variates.(Ref.1 Chap.8) Output data analysis. Statistical analysis for terminating simulations, analysis for steady state parameters. Comparing alternative system configurations. Confidence intervals. Variance reduction techniques. Antithetic and Control variates.(Ref.1 Chap.9) References: 1.Averill Law, “ Simulation modeling and analysis”, MGH,

4th edition, 2007 2. Jerry Banks, “Discrete event system simulation”, Pearson, 2009. 3. Seila, Ceric, & Tadikamalla, “Applied simulation modeling”, Cengage, 2009. 4. George S. Fishman, “Discrete event simulation”, Springer, 2001. 5. N. Viswanadham, Y. Narahari, “Performance modeling of automated manufacturing systems”, PHI, 2000. 6. Frank L. Severance, “System modeling and simulation”, Wiley, 2009.

MULTIMEDIA COMMUNICATION



29


Multimedia Communications: multimedia information representation, multimedia networks, multimedia applications, network QoS and application QoS. Information Representation: text, images, audio and video, Text and image compression, compression principles, text compression, image compression. Audio and video compression, audio compression, video compression, video compression principles, video compression standards: H.261, H.263, P1.323, MPEG 1, MPEG 2, Other coding formats for text, speech, image and video. Detailed Study of MPEG 4: coding of audiovisual objects, MPEG 4 systems, MPEG 4 audio and video, profiles and levels. MPEG 7 standardization process of multimedia content description, MPEG 21 multimedia framework, Significant features of JPEG 2000, MPEG 4 transport across the Internet. Synchronization: Notion of synchronization, presentation requirements, reference model for synchronization, Introduction to SMIL, Multimedia operating systems, Resource management, process management techniques. Multimedia Communication Across Networks: Layered video coding, error resilient video coding techniques, multimedia transport across IP networks and relevant protocols such as RSVP, RTP, RTCP, DVMRP, multimedia in mobile networks, multimedia in broadcast networks. Assignments / Practicals can be given on writing the programs to encode and decode the various kinds of data by using the algorithms. Students can collect several papers from journals/conferences/Internet on a specific area of multimedia communications and write a review paper and make a presentation. REFERENCE BOOKS:

1.Fred Halsall, “Multimedia Communications”, Pearson education, 2001 2.K. R. Rao, Zoran S. Bojkovic, Dragorad A. Milovanovic, “Multimedia Communication Systems”, Pearson education, 2004 3.Raif steinmetz, Klara Nahrstedt, “Multimedia: Computing, Communications and Applications”, Pearson education, 2002 4.John Billamil, Louis Molina, “Multimedia : An Introduction ”, PHI, 2002

30

ADVANCES IN VLSI SYSTEMS


Review of MOS Circuits: MOS and CMOS static plots, switches, comparison between CMOS and BI - CMOS. MESFETS: MESFET and MODFET operations, quantitative description of MESFETS. MIS Structures and MOSFETS: MIS systems in equilibrium, under bias, small signal operation of MESFETS and MOSFETS. Short Channel Effects and Challenges to CMOS: Short channel effects, scaling theory, processing challenges to further CMOS miniaturization Beyond CMOS: Evolutionary advances beyond CMOS, carbon Nano tubes, conventional vs. tactile computing, computing, molecular and biological computing Mole electronics-molecular Diode and diode- diode logic .Defect tolerant computing, Super Buffers, Bi-CMOS and Steering Logic: Introduction, RC delay lines, super buffers- An NMOS super buffer, tri state super buffer and pad drivers, CMOS super buffers, Dynamic ratio less inverters, large capacitive loads, pass logic, designing of transistor logic, General functional blocks - NMOS and CMOS functional blocks. Special Circuit Layouts and Technology Mapping: Introduction, Talley circuits, NAND-NAND, NOR- NOR, and AOI Logic, NMOS, CMOS Multiplexers, Barrel shifter, Wire routing and module lay out. System Design: CMOS design methods, structured design methods, Strategies encompassing hierarchy, regularity, modularity & locality, CMOS Chip design Options, programmable logic, Programmable inter connect, programmable structure, Gate arrays standard cell approach, Full custom Design. REFERENCE BOOKS:

1.Kevin F Brrnnan “Introduction to Semi Conductor Device”,

Cambridge publications

31

2.Eugene D Fabricius “Introduction to VLSI Design”, McGraw-Hill

International publications

3.D.A Pucknell “Basic VLSI Design”, PHI Publication

Wayne Wolf, “Modern VLSI Design” Pearson Education, Second Edition , 2002

ELECTIVE - IV

CRYPTOGRAPHY AND NETWORK SECURITY Subject Code : 12EC023 IA Marks : 50 No. of Lecture Hours /week : 04 Exam Hours : 03 Total no. of Lecture Hours : 52 Exam Marks : 100

Overview: Services, Mechanisms and attacks, OSI security architecture, Model for network security. Classical Encryption Techniques: Symmetric cipher model, Substitution techniques, Transposition techniques, Rotor machine, Steganography, Problems. Block Ciphers and DES (Data Encryption Standards): Simplified DES, Block cipher principles, DES, Strength of DES, Block cipher design principles, Block cipher modes of operation, Problems. Public Key Cryptography and RSA: Principles of public key cryptosystems, RSA algorithm, Problems. Other Public Key Crypto Systems and Key Management: Key management, Diffie-Hellman key exchange, Elliptic curve arithmetic, Elliptic curve cryptography, Problems. Message Authentication and Hash Functions: Authentication requirements, Authentication functions, Message authentication codes, Hash functions, Security of hash functions and MAC’s, Problems. Digital Signature and Authentication Protocol: Digital signature, Authentication protocols, Digital signature standard. Authentication Applications: Kerberos, X.509 authentication service, Kerberos encryption technique, Problems.

32

Electronic Mail Security: Pretty good privacy, S/MIME, Data compression using ZIP, Radix-64 conversion, PGP random number generator. IP Security: Overview, IP security architecture, Authentication header, ESP (encapsulating security pay load), Security associations, Key management, Problems.) Firewalls: Firewall design principles; Trusted systems, Problems. REFERENCE BOOKS: 1.William Stallings, “Cryptography and Network Security,” 3rd edition,

Pearson Education (Asia) Pte. Ltd./ Prentice Hall of India, 2003.

2.C. Kaufman, R. Perlman, and M. Speciner, "Network Security: Private

Communication in a Public World”, 2nd edition, Pearson Education (Asia)

Pte. Ltd., 2002.

3.Atul Kahate, “Cryptography and Network Security”, Tata

McGraw-Hill, 2003.

4.Eric Maiwald, “Fundamentals of Network Security”, McGraw-Hill,

2003.

REAL TIME OPERATING SYSTEMS


Introduction: Real Time System, Types, Real Time Computing, Design Issue, Sample Systems, Hardware Requirements- Processor in a system, System Memories, System I/O, Other Hardware Devices (A/D, D/A, USART, Watchdog Timers, Interrupt Controllers). Device Drivers, Interrupt Servicing Mechanism & Interrupt Latency. Embedded Systems: Introduction, Various System Architecture for Embedded System, High Performance Processors - Strong ARM processors, Programming, Interrupt Structure, I/O architecture.

33

Real Time Operating System: Fundamental Requirements of RTOS, Real Time Kernel Types, Schedulers, Various Scheduling modules with examples, Latency (Interrupt Latency, Scheduling Latency and Context Switching Latency), Tasks, State Transition Diagram, Task Control Block. Inter-task communication and synchronization of tasks. Memory and File Management: Pipelining and Cache Memories, Paging and Segmentation, Fragmentation, Address Translation. Case Study: Introduction to VX Works/Mucos/pSOS; Example systems. Development and Verification of Real Time Software: Building Real Time applications; Considerations such as double buffing. REFERENCE BOOKS:

1. Stuart Bennett, “Real-Time Computer Control: An Introduction”, 2nd Edn. Pearson Education, 2005

2.Philip. A. Laplante, “Real-Time Systems Design and Analysis- an Engineer’s Handbook”- Second Edition, PHI Publications. 3.Jane W.S. Liu, “Real-Time Systems”, Pearson Education Inc., 2000. 4.Dr. K.V.K K Prasad, “Embedded Real Time Systems: Concepts Design and Programming”, Dreamtech Press New Delhi, 2003. 5.David A. Evesham, “Developing Real Time Systems – A Practical Introduction ”, Galgotia Publications, 1990.

RF AND MICROWAVE CIRCUIT DESIGN


Wave Propagation in Networks: Introduction to RF/Microwave Concepts and applications; RF Electronics Concepts; Fundamental Concepts in Wave Propagation; Circuit Representations of two port RF/MW networks Passive Circuit Design: The Smith Chart, Application of the Smith Chart in Distributed and lumped element circuit applications, Design of Matching networks.

34

Basic Considerations in Active Networks: Stability Consideration in Active networks, Gain Considerations in Amplifiers, Noise Considerations in Active Networks. Active Networks: Linear and Nonlinear Design: RF/MW Amplifiers Small Signal Design, Large Signal Design, RF/MW Oscillator Design, RF/MW Frequency Conversion Rectifier and Detector Design, Mixer Design, RF/MW Control Circuit Design, RF/MW Integrated circuit design. REFERENCE BOOKS:

1.Matthew M. Radmanesh, “Radio Frequency and Microwave

Electronics Illustrated” , Pearson Education (Asia) Pte. Ltd., 2004.

2.Reinhold Ludwig and Pavel Bretchko, “RF Circuit Design: Theory

and Applications”, Pearson Education (Asia) Pte. Ltd., 2004.

ldssyll

Documents

galois field

gaussian random

sampling rate

slowly fading

short channel

finite ground

traditional

discrete event