course hand-out b.tech. - semester iv … hand-out-ktu.pdf · v sundarapandian , probability,...

96
COURSE HAND-OUT B.TECH. - SEMESTER IV DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Upload: truongdat

Post on 29-Aug-2018

226 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

COURSE HAND-OUT

B.TECH. - SEMESTER IV

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Page 2: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 2

RAJAGIRI SCHOOL OF ENGINEERING AND TECHNOLOGY (RSET)

VISION

TO EVOLVE INTO A PREMIER TECHNOLOGICAL AND RESEARCH INSTITUTION,

MOULDING EMINENT PROFESSIONALS WITH CREATIVE MINDS, INNOVATIVE

IDEAS AND SOUND PRACTICAL SKILL, AND TO SHAPE A FUTURE WHERE

TECHNOLOGY WORKS FOR THE ENRICHMENT OF MANKIND

MISSION

TO IMPART STATE-OF-THE-ART KNOWLEDGE TO INDIVIDUALS IN VARIOUS

TECHNOLOGICAL DISCIPLINES AND TO INCULCATE IN THEM A HIGH DEGREE

OF SOCIAL CONSCIOUSNESS AND HUMAN VALUES, THEREBY ENABLING

THEM TO FACE THE CHALLENGES OF LIFE WITH COURAGE AND CONVICTION

Page 3: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 3

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

(EC), RSET

VISION

TO EVOLVE INTO A CENTRE OF EXCELLENCE IN ELECTRONICS AND

COMMUNICATION ENGINEERING, MOULDING PROFESSIONALS HAVING

INQUISITIVE, INNOVATIVE AND CREATIVE MINDS WITH SOUND PRACTICAL

SKILLS WHO CAN STRIVE FOR THE BETTERMENT OF MANKIND

MISSION

TO IMPART STATE-OF-THE-ART KNOWLEDGE TO STUDENTS IN ELECTRONICS

AND COMMUNICATION ENGINEERING AND TO INCULCATE IN THEM A HIGH

DEGREE OF SOCIAL CONSCIOUSNESS AND A SENSE OF HUMAN VALUES,

THEREBY ENABLING THEM TO FACE CHALLENGES WITH COURAGE AND

CONVICTION

Page 4: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 4

B.TECH PROGRAMME

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

1. Graduates shall have sound knowledge of the fundamental and advanced concepts of

electronics and communication engineering to analyze, design, develop and

implement electronic systems or equipment.

2. Graduates shall apply their knowledge and skills in industrial, academic or research

career with creativity, commitment and social consciousness.

3. Graduates shall work in a team as a member or leader and adapt to the changes taking

place in their field through sustained learning.

PROGRAMME OUTCOMES (POs)

Graduates will be able to

1. Engineering knowledge: Apply the knowledge of mathematics, science, Engineering

fundamentals, and Electronics and Communication Engineering to the solution of

complex Engineering problems.

2. Problem analysis: Identify, formulate, review research literature, and analyze

complex Engineering problems reaching substantiated conclusions using first

principles of mathematics, natural sciences, and Engineering sciences.

3. Design/development of solutions: Design solutions for complex Engineering

problems and design system components or processes that meet the specified needs

with appropriate consideration for the public health and safety, and the cultural,

societal, and environmental considerations.

4. Conduct investigations of complex problems: Use research based knowledge and

research methods including design of experiments, analysis and interpretation of data,

and synthesis of the information to provide valid conclusions.

5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and

modern engineering and IT tools including prediction and modeling to complex

Engineering activities with an understanding of the limitations.

6. The Engineer and society: Apply reasoning informed by the contextual knowledge

to assess societal, health, safety, legal and cultural issues and the consequent

responsibilities relevant to the professional Engineering practice.

7. Environment and sustainability: Understand the impact of the professional

Engineering solutions in societal and environmental contexts, and demonstrate the

knowledge of, and the need for sustainable developments.

8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities

and norms of the Engineering practice.

Page 5: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 5

9. Individual and team work: Function effectively as an individual,and as a member or

leader in diverse teams, and in multidisciplinary settings.

10. Communication: Communicate effectively on complex Engineering activities with

the Engineering Community and with society at large, such as, being able to

comprehend and write effective reports and design documentation, make effective

presentations, and give and receive clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of the

Engineering and management principles and apply these to one‟s own work, as a

member and leader in a team, to manage projects and in multi disciplinary

environments.

12. Life -long learning: Recognize the need for, and have the preparation and ability to

engage in independent and life- long learning in the broadest context of technological

change.

Programme-Specific Outcomes (PSOs)

Engineering graduates will be able to:

1. demonstrate their skills in designing, implementing and testing analogue and digital

electronic circuits, including microprocessor systems, for signal processing,

communication, networking, VLSI and embedded systems applications;

2. apply their knowledge and skills to conduct experiments and develop applications

using electronic design automation (EDA)tools;

3. demonstrate a sense of professional ethics, recognize the importance of continued

learning, and be able to carry out their professional and entrepreneurial

responsibilities in electronics engineering field giving due consideration to

environment protection and sustainability.

Page 6: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 6

INDEX

1. Semester Plan 7

2. Scheme 8

3. Probability Random Process & Numerical Methods 9

3.1 Course Information Sheet 10

3.2 Sample Question 15

4. Signals & System 24

4.1. Course Information Sheet 25

4.2. Course Plan 31

4.3. Sample Questions 34

5. Analog Integrated Circuits 40

5.1. Course Information Sheet 41

5.2. Course Plan 45

6. Computer Organization 47

6.1. Course Information Sheet 48

6.2. Course Plan 55

6.3. Sample Questions 57

7. Analog Communication Engineering 62

7.1. Course Information Sheet 67

7.2. Course Plan 68

7.3. Sample Questions 69

8. Analog Integrated Circuits Lab 73

8.1. Course Information Sheet 74

8.2. Course Plan 77

8.3. Sample Questions 78

9. Logic Circuit Design Lab 92

9.1. Course Information Sheet 93

9.2. Course Plan 96

Page 7: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 7

1.SEMESTER PLAN

2017 S4SemesterPlan 2017 KTU

Page 8: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 8

3. SCHEME: B.TECH 3 RD

SEMESTER

(Electronics & Communication Engineering)

Course

Code

Course Name L-T-P Credits Exam

Slot

MA 204 Probability Random Process &

Numerical Methods

3-1-0 4 A

EC202 Signals & System 3-1-0 4 B

EC204 AnalogIntegreted Circuits 4-0-0 4 C

EC206 Computer Organization 3-1-0 3 D

EC208 Analog Communication Engineering 3-0-0 3 E

HS210 Life Skills 2-0-2 3 F

EC232 AnalogIntegretedCircuits Lab 0-0-3 1 S

EC230 Logic Circuits Design Lab 0-0-3 1 T

Total Credits = 24 Hours: 28/29

Cumulative Credits= 71

Page 9: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 9

3

MA 204

PROBABILITY RANDOM PROCESS & NUMERICAL METHODS

Page 10: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 10

3.1 COURSE INFORMATION SHEET

PROGRAMME: ECE DEGREE: BTECH

COURSE: PROBABILITY

DISTRIBUTIONS, RANDOM

PROCESSES AND NUMERICAL

METHODS

SEMESTER: 4 CREDITS:4

COURSE CODE: MA204

REGULATION:

COURSE TYPE: CORE

COURSEAREA/DOMAIN: CONTACT HOURS: 4 hours/Week.

CORRESPONDING LAB COURSE

CODE :

LAB COURSE NAME:

Course No. Course Name L-T-P-

Credits

Year of Introduction

MA204 PROBABILITY

DISTRIBUTIONS, RANDOM

PROCESSES AND

NUMERICAL METHODS

3-1-0-4 2016

Course Objectives

To introduces the modern theory of probability and its applications to modelling and

analysis and processing of random processes and signals. To learn most of the important

models of discrete and continuous probability distributions

and widely used models of random processes such as Poisson processes and Markov chains.

To understand some basic numerical methods for interpolation and integration and also for

finding roots of equations and solutions of ODEs.

Syllabus

Discrete random variables- Continuous Random variables-Multiple Random variables. Random

Processes- Autocorrelation, Power spectrum-Special Random Processes. Numerical Methods.

Expected outcome .

At the end of the course students would have become familiar with quantifying and analysing

random phenomena using various models of probability distributions and random processes.

They would also have learned the concepts of autocorrelation and power spectral density which

are useful in the analysis of random signals. Some of the fundamental numerical methods

learned in the course would help them to solve a variety of mathematical problems by the use of

computers when analytical methods fail or are difficult.

Page 11: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 11

Text Book:

1. T Veerarajan , Probability Statistics and Random Process, Fourth Edition-M c Graw Hill

2. V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI

Learning

References:

Athanasios Papoulis,S UnnikrishnaPillai , Probability Random process and stochastic

Process, Fourth edition, M c Graw Hill, 2002

COURSE PLAN

COURSE NO: MA204 L-T-P:3-1-0

COURSE NAME: RANDOM PROCESSES

AND QUEUING THEORY

CREDITS:4

MODULE CONTENT HRS END SEM.

EXAM MARKS

(OUT OF 100)

I

Discrete random variables [Text 1: Relevant

portions of sections 2.1, 2.2,2.3, 2.5, 3.3 and

3.4] Discrete random variables, probability

mass function, cumulative distribution

function, expected value, mean and variance.

Binomial random variable-, mean, variance

Poisson random variable, mean, variance,

approximation of binomial by Poisson.

Distribution fitting-binomial and Poisson

7 15

Page 12: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 12

II

Continuous random variables [Text 1:

Relevant portions of sections 2.4, 2.5, 3.7, 3.8

and 3.11] Continuous random variables,

Probability density function, expected value,

mean and variance. Uniform random variable-,

mean, variance. Exponential random variable-

mean, variance, memoryless property. Normal

random variable-Properties of Normal curve

mean, variance (without proof), Use of Normal

tables 7

15

FIRST INTERNAL EXAM

III

Joint distributions [Text 1: Relevant portions

of sections 4.1, 4.2, 4.4 4.7and 4.10] Joint

probability distributions- discrete and

continuous, marginal distributions,

independent random variables. Expectation

involving two or more random variables,

covariance of pairs of random variables.

Central limit theorem (without proof). 7

15

IV

Random processes [Text 1: Relevant portions

of sections 5.1, 5.2, 5.3 and 6.2] Random

processes, types of random processes, Mean,

correlation and covariance functions of

random processes, Wide Sense Stationary

(WSS) process, Properties of

autocorrelationand auto covariance functions

of WSS processes. Power spectral density and

its properties 7

15

SECOND INTERNAL EXAM

V

Special random processes [Text 1: Relevant

portions of sections 5.5, 5.5.1, 5.5.2,

5.5.3,5.5.4) and 5.6] Poisson process-

properties, probability distribution of inter

arrival times. Discrete time Markov chain-

Transition probability matrix, Chapman

Kolmogorov theorem (without proof),

computation of probability distribution and

higher order transition probabilities, stationary

distribution 7

15

Page 13: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 13

VI

Numerical Methods [Text 2: Relevant

portions of sections 19.2, 19.3, 19.5 and 21.1]

(Derivation of formulae not required in this

module) Finding roots of equations-Newton-

Raphson method. Interpolation-Newton's

forward and backward difference formula,

Lagrange's interpolation method. Numerical

Integration-trapezoidal rule, Simpson's 1/3rd

rule. Numerical solution of first order ODE-

Euler method, RungeKutta fourth order

(classical method). 7

15

END SEMESTER EXAM

COURSE PRE-REQUISITES: nil

GAPS / TOPICS BEYOND THE SYLLABUS TO MEET THE INDUSTRIAL

REQUIREMENT:

No gaps identified

WEB SOURCE REFERENCES:

1 http://www.math.com/

2 https://www.math.umn.edu/~olver/pdn.html,

3 http://www.mheducation.co.in

4 http://tutorial.math.lamar.edu/

5 http://nptel.ac.in/

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

☐ CHALK &

TALK

☐ STUD.

ASSIGNMENT

☐ WEB

RESOURCES

☐ LCD/SMART

BOARDS

☐ STUD.

SEMINARS

☐ ADD-ON

COURSES

ASSESSMENT METHODOLOGIES-DIRECT

☐ ASSIGNMENTS ☐ STUD.

SEMINARS

☐ TESTS/MODEL

EXAMS

☐ UNIV.

EXAMINATION

☐ STUD. LAB

PRACTICES

☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

CERTIFICATIONS

☐ ADD-ON ☐ OTHERS

Page 14: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 14

COURSES

ASSESSMENT METHODOLOGIES-INDIRECT

☐ ASSESSMENT OF COURSE OUTCOMES

(BY FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON

FACULTY (TWICE)

☐ ASSESSMENT OF MINI/MAJOR

PROJECTS BY EXT. EXPERTS

☐ OTHERS

Prepared by Approved

by

MARIA SEBASTIAN

( HOD)

Page 15: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 15

3.2 SAMPLE QUESTIONS

CONTINUOUS RANDOM VARIABLES

TUTORIAL

1. Let X be a continuous random variable with p.d.f.

where k is a constant.

i. Determine the value of k

ii. Find p(

2. A continuous random variable X that can assume any value between x=2 and x=5 has a

density function given by

3. A radar unit is used to measure speeds of cars on a motorway. The speeds are normally

distributed with a mean of 90 km/hr and a standard deviation of 10 km/hr. What is the

probability that a car picked at random is travelling at more than 100 km/hr?

4. If X is continuous r.v with pdf

, then

find P(X >10).

5. Let X = length, in seconds of an eight week old baby‟s smile. If X is uniformly

distributed on (0, 23) [i.e. X∼U(0,23)], find the probability that the random eight week

old baby smiles more than 12 seconds knowing that the baby smiles more than 8

seconds?

UNITWISE QUESTIONBANK

6. The systolic blood pressure for a certain group of obese people has a mean of 132 mmHg

and a standard deviation of 8mmHg, find the probability that a randomly selected obese

person will have the following blood pressure. Assume that the variable is normally

distributed.

7. Let X~U(-k,k). Find the value of „k‟ such that P(X>1) = 1/3.

8. A continuous random variable X has a p.d.f. ,0 Find the mean and

variance of X.

9 . Let X equal the IQ of a randomly selected American. Assume X ~ N(100, 162). What is

the probability that a randomly selected American has an IQ below 90?

10. The number of miles that a particular car can run before its battery wears out is

exponentially distributed with an average of 10,000 miles. The owner of the car needs to

take a 5000-mile trip. What is the probability that he will be able to complete the trip

without having to replace the car battery?

11. If X is normally distributed with mean 5 and standard deviation 2, find p(X>8).

12. Buses arrive to a bus stop according to an exponential distribution with rate λ = 4

busses/hour.

a. If you arrived at 8:00 am to the bus stop, what is the expected time of the next

bus?

b. Assume you asked one of the people waiting for the bus about the arrival time of

the last bus and he told you that the last bus left at 7:40 am. What is the expected

time of the next bus?

Page 16: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 16

13. The average life of a certain type of motor is 10 years, with a standard deviation of 2

years. If the manufacturer is willing to replace only 3% of the motors that fail, how long a

guarantee should he offer? Assume that the lives of the motors follow a normal distribution.

14. Consider a computer system with Poisson job-arrival stream at an average of 2 per

minute. Determine the probability that in any one-minute interval there will be (i) 0 jobs; (ii)

exactly 2 jobs; (iii) at most 3 arrivals. (iv) What is the maximum jobs that should arrive one

minute with 90 % certainty.

15. A shop sells five pieces of shirt every day, then what is the probability of selling three

shirts today?

16. The mean height of 500 students is 151 cm. and the S.D is 15 c.m. Assuming that the

heights are normally distributed, find how many students heights lie between 120 c.m and

155 c.m.

ASSIGNMENT

1. A random variable X has the density function

.

i. Find the value of the constant c.

ii. Find the probability that X2 lies between 1/3 and 1.

2. The lifetime T (years) of an electronic component is a continuous random variable with

a probability density function given by f(t)= , t ≥ 0 . Find the lifetime L which a

typical component is 60% certain to exceed.

3. The time that a skier takes on a downhill course has a normal distribution with a mean

of 12.3 minutes and standard deviation of 0.4 minutes. Then find the probability that on

a random run the skier takes between 12.1 and 12.5 minutes.

4. Check whether

is a pdf.

5. Suppose that X is a continuous random variable whose probability density function is

given by

f(x) = C (4x-2x2), 0<x<2 and f(x) = 0 ,otherwise. Then find C and P( X>1).

6. The time required to repair a machine is an exponential random variable with mean 2

hours. What is the probability that the repair time will take at least four hours given that

the repair man have been working on the machine for 3 hours?

7. A shoe manufacturer collected data regarding men shoe sizes and found that the

distribution of sizes exactly fits the normal curve. If the mean shoe size is 10 and the

standard deviation is 1.5. What percent of men have shoe size greater than

11.5?(approximately)

8. If X follows Exponential distribution with parameter k ,then find E(X2-X).

9. Suppose the p.d.f. of a continuous random variable X is defined as:Vf(x) = x + 1 for

−1 < x < 0, and f(x) = 1 – x for 0 ≤ x < 1. Find the c.d.f. F(x).

Page 17: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 17

10. Let X be a continuous random variable whose probability density function is:

for an interval 0 < x < c. What is the value of the constant c that makes f(x) a valid

probability density function?

MODULE III JOINT DISTRIBUTION

TUTORIAL

1. Two random variables X and Y have the joint pdf Find correlation coefficient between X and Y.

2. A continuous r.v ( X, Y) has joint density given by f(x,y)= c ;0 < y ≤ x <1 and 0

,otherwise.

a. Find c

b. The mpdf‟s of X and Y

c. Are X and Y independent?

3. Three balls are drawn at random without replacement from a box containing 2 white , 3

red and 4 black balls. If X denote the number of white balls drawn and Y denote the

number of black balls drawn, find the jpmf of (X,Y).

4. Two fair dice are thrown. Let X denote the sum of the numbers and Y the difference of

the numbers shown. Find the joint probability distribution of X and Y.

5. 1000 rounds are fired from a gun at a target. The probability of a hit on each round is

0.7. Use CLT to determine the probability that the number of hits will be between 680

and 720

UNITWISE QUESTION BANK

6. The j.p.d.f of X and Y is

then find the

marginal density function of X.

7. A mean yield for one acre plot is 662 kilos and S.D 32 kilos. Assuming normal

distribution how many acres plots in a batch of 1000 plots would you to have yield

(i)over 700 kilos (ii) below 650 kilos.

8. The jpmf of X and Y is given by P(0,1) =1/3 , P( 1, -1) = 1/3 , and P(1,1) = 1/3. Find

mpmf‟s of X ad Y.

9. Given the Joint probability density function of X, Y f(x,y)= cxy ;0≤x≤1, 0≤y≤1

a. Find c

b. Are X and Y independent ?

c. Find P( X+Y<1).

10. The jpmf of X and Y is given by

. Find mpmf‟s

of X and Y.

Page 18: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 18

ASSIGNMENT

11. Given the Joint probability density function of X, Y, f(x,y)= cxy ;0≤x≤1, 0≤y≤1. Find c

and also find P(0<x<0.5, 0.5<y<1).

12. There are 250 dogs at a dog show who weigh an average of 12 pounds, with a standard

deviation of 8 pounds. If 4 dogs are chosen at random, what is the probability that they

have an average weight of greater than 8 pounds and less than 25 pounds? ( USE CLT)

13. Let X and Y are two random variables then j.p.d.f is

i) Find the c value

ii) Find m.p.d.f of X and Y

iii) Find correlation coefficient value?

14. If the r.v‟s X and Y has jpdf

. Then find the

correlation coefficient of X and Y.

15. The jpmf of X and Y is given by

. Find mpmf‟s of

X and Y.

16. The jpdf of (X,Y) is given by

, otherwise.

a) Find k

b) Find the mpdf‟s of X and Y

17. A fair coin is tossed three times. Let X be a random variable that takes the value 0 if the

first toss is a tail and the value 1 if the first toss is a head and Y be a random variable

that defines the total number of heads in the three tosses. Then

i. Determine the joint, marginal and conditional mass functions of X and Y .

ii. Are and independent?

18. The j.p.m.f. of is given by where k is a constant

a. Find the value of k

b. Find marginal and conditional p.m.fs.

c. Are X and Y independent?

19. The jpdf of (X,Y) is given by

otherwisw, where a, b are positive parameters and k is a constant.

a. find k

b. Find marginal and conditional p.d.f‟s.

c. Are X and Y independent?

20. The jpdf of (X,Y) is given by

.

a. Find k

b. Find the mpdf‟s of X and Y

c. Are X and Y independent?

Page 19: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 19

MODULE IV RANDOM PROCESSES

TUTORIAL

1. Find the PSD function of a stationary process whose ACF is .

2. If X(t) = for all t where Y and Z are independent binary r.v‟s ,each of

which assumes the values -1 and 2 with probabilities 2/3 and 1/3 respectively , prove

that {X(t)} is a WSS process.

3. Calculate the autocorrelation function of the process X(t) = A sin ( where Y is

uniformly distributed in and A and are constants.

4. If X(t) = R sin ( whereR and Y are independent r.v‟s and Y is uniformly

distributed in , prove that R(t1, t2) = ½ E(R2) cos .

5. Let {X(t)} be a stochastic process with no periodic components and ACF is

.Then find the mean.

UNITWISE QUESTION BANK

6. If X(t) and Y(t) are jointly WSS with cross correlation function , show that

2

7. If the PSD function of a white noise process is

where is a positive real

constant, then find the ACF of the process

8. If X(t) is a WSS process with ACF the find the PSD function

9. If X(t) = A sin ( where A and are constants and is uniformly distributed in

,find the autocorrelation of {Y(t)} ,where Y(t) = X2(t).

10. Let {X(t)} be a stochastic process with no periodic components and ACF is R(τ)=

. Then find V(X(t)).

Page 20: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 20

ASSIGNMENT

1. If X(t) = P + Qt ,where P and Q are independent r.v‟s with E(P)= p, E(Q)= q, V(Q) =

, find E(X(t)) ,R(t1, t2) and C(t1, t2) . Is the process {X(t)} stationary?

2. If X(t) =sin ( where Y is uniformly distributed in , prove that {X(t)} is a

WSS process.

3. If X(t) = 5 cos ( and Y(t) = 20 sin ( where ,then prove

that the processes are jointly WSS.

4. If then find power spectral density function ?

5. Let {X(t)} and {Y(t)} be two S.P‟s with X(t) = 2t Y + t2 Z and Y(t) = sint Y ,for all t

where Y and Z are independent r.v‟s taking values -1 and 4 with probabilities 4/5 and

1/5 respectively. Then find RXY(t1, t2) .

6. Given that the PSD of a continuous WSS process X (t) as

,find the ACF

and mean square value of the process.

7. If Y(t) = X(t+a) –X(t-a) , prove that

. Hence prove that

8. If the PSD of a WSS process is given by

Find the ACF of the process.

9. Find the variance of the stationary process {X(t)} whose ACF is given by

MODULE V SPECIAL RANDOM PROCESSES

TUTORIAL

1. If the initial state probability distribution of a Markov chain is P(0)=

and the tpm of

the chain is , find the probability distribution of the chain after 2 steps.

2. The tpm of a Markov chain with three states 0, 1, 2 is

And the initial state distribution of the

chain is P { X0 = i } = 1/3 , i = 0, 1, 2. Find (i) P{ X2 = 2 } and (ii) P{ X3 =1, X2 = 2, X1 =

1, X0 = 2 }.

3. Assume that the weather in a certain locality can be modelled as the homogeneous

markov chain whose transition probability matrix is given below.

Today‟s Weather Tomorrow‟s Weather

Fair Cloudy Rainy

Fair 0.8 0.15 0.05

Cloudy 0.5 0.3 0.2

Rainy 0.6 0.3 0.1

If the initial state distribution is given by p(0) = (0.7, 0.2, 0.1) , find and

. 4. A salesman‟s territory consists of 3 cities A, B and C. He never sells in the same city on

successive days. If he sells in city A, then the next day he sells in B. However, if he sells

Page 21: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 21

either in B or C, then the next day he is twice as likely to sell in city A as in the other

city. How often does he sell in each of the cities in the steady state?

5. A housewife buys 3 kinds of cereals, A,B and C. She never buys the same cereal in

successive weeks. If she buys Cereal A, the next week she buys Cereal B. However if

she buys B or C, the next week she is 3 times as likely to buy A as the other cereal. In

the long run, how often she buys each of the three cereals?

UNITWISE QUESTION BANK

6. The tpm of a Markov chain with three states 0, 1, 2 is

And the initial state distribution of the chain is

.Find (i) (ii) P{ X3 =1, X2 = 2, X1 = 1, X0 = 0 }.

7. A fair dice is tossed repeatedly. If Xn denotes the maximum of the numbers occurring in

the first n tosses , find tpm and also find P2 and P(X2 = 6).

8. Suppose that the probability of a dry day (state 0) following a rainy day (state 1) is 1/3

and that the probability of a rainy day following a dry day is ½. Given that May 1 is a

dry day , find the probability that May 3 is a dry day and the find the probability that

May 5 is a dry day.

9. A student‟s study habits are as follows: if he studies one night, he is 70% sure not to

study the next night. On the other hand, if he does not study one night , he is 60% sure

not to study the next night as well. In the long run how often does he study?

10. A gambler‟s luck follows the pattern. If he wins a game, the probability of his winning the next game is 0.6. However if he loses a game, the probability of his losing the next

game is 0.7. There is an even chance that the gambler wins the first game. What is the

probability that he wins (i) second game,(ii) third game,(iii) in the long run?

ASSIGNMENT

1. Suppose that customers arrive at a bank according to a Poisson process with a mean rate

of 3 per minute; find the probability that during a time interval of 2 min (i) exactly 4

customers arrive and (ii) more than 4 customers arrive.

2. A machine goes out of order, whenever a component fails. The failure of this part

follows a Poisson process with a mean rate of 1 per week. Find the probability that 2

weeks have elapsed since last failure. If there are 5 spare parts of this component in an

inventory and that the next supply is not due in 10 weeks, find the probability that the

machine will not be out of order in the next 10 weeks.

3. A radioactive source emits particles at a rate of 5 per minute in accordance with Poisson

process. Each particle emitted has a probability 0.6 of being recorded. Find the

probability that 10 particles are recorded in 4-min period.

4. On the average, a submarine on patrol sights 6 enemy ships per hour. Assuming that the

number of ships sighted in a given length of time is a Poisson variate, find the

probability of sighting

(i) 6 ships in the next half-an-hour,

(ii) 4 ships in the next 2 h,

(iii) At least 1 ship in the next 15 min and

(iv) At least 2 ships in the next 20 min.

5. Patients arrive randomly and independently at a doctor‟s consulting room from 8 A.M.

at an average rate of one in 5 min. The waiting room can hold 12 persons. What is the

probability that the room will be full when the doctor arrives at 9 A.M.?

Page 22: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 22

6. A radioactive source emits particles at a rate of 6 per minute in accordance with Poisson

process. Each particle emitted has a probability of 1/3 of being recorded. Find the

probability that at least 5 particles are recorded in a 5-min period.

The transition probability matrix of a Markov chain {Xn},n = 1,2,3,…..,having 3 states 1, 2 and

3 is 7. And the initial distribution is P(0) = (0.7, 0.2, 0.1). Find

(i) P { X2 = 3 } and

(ii) P { X3 = 2, X2 = 3, X1 = 3, X0 = 2 }.

8. A man either drives a car or catches a train to go to office each day. He never goes 2

days in a row by train but if he drives one day, then the next day he is just as likely to

drive again as he is to travel by train. Now suppose that on the first day of the week, the

man tossed a fair dice and drove to work if and only if a 6 appeared. Find (i) the

probability that he takes a train on the third day and (ii) the probability that he drives to

work in the long run.

9. There are 2 white marbles in urn A and 3 red marbles in urn B. At each step of the

process, a marble is slected from each urn and the 2 marbles selected are interchanged.

Let the state ai of the system be the number of red marbles in A after i changes. What is

the probability that there are 2 red marbles in A after 3 steps? In the long run, what is the

probability that there are 2 red marbles in urn A?

10. If the TPM of a Markov chain is find the steady-state distribution of the

chain.

MODULE VI NUMERICAL METHODS

ASSIGNMENT

1. Use Newton Raphson method, with 3 as a starting point to find the value of √ correct

to six decimal places.

2. Find the iteration formula for Newton Raphson method for : (a) (b)

3. Find a real root correct to 4 decimal places, of the equation lying in the

interval [3/2 ,

4. Find the polynomial f(x) by using Lagrange‟s formula and hence find f(3) for

X 0 1 2 5

F(x) 2 3 12 147

5. Find the third degree polynomial satisfying the following data

x 1 3 5 7

F(x) 24 120 336 720

UNITWISE QUESTION BANK

6. A third degree polynomial passes through the points (0, -1) ,(1,1) ,(2, 1) and (3, -2).

Using Newton‟s forward interpolation formula, find the polynomial f(x) satisfying the

following data and hence evaluate the value at 1.5.

7. Using Newton‟s forward and backward formula, interpolate f(x) using the following

data.

x 0 1 2 3

F(x) 1 2 1 10

Page 23: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 23

8. For the following data use trapezoidal rule to estimate ∫

x 2.1 2.4 2.7 3.0 3.3 3.6

y 3.2 2.7 2.9 3.5 4.1 5.2

9. Find ∫

using Trapezoidal rule and Simpson‟s 1/3 rule using n = 4.

10. Use Euler‟s method to solve

, in the interval with h =

0.2.

TUTORIAL

1. Given

. Use Runga kutta method to evaluate y(0.4).

2. Use Newton Raphson method ,with 0 as a starting point to find the root of the following

function correct to 5 decimal places.

3. Find the root of the function in the vicinity of correct to 5

decimal places.

4. Find the root of the function correct to 5 decimal places ( .

5. Find the polynomial f(x) by using Lagrange‟s formula for the following data

x -1 1 2

F(x

)

7 5 15

6. Using Newton‟s forward formula, to interpolate f(x) using the given data and hence find

f(5).

x 4 6 8 10

F(x) 1 3 8 10

7. Calculate by Simpson‟s 1/3 method and Trapezoidal method the approximate value of

taking seven equidistant ordinates.

8. Compute y at x =0.6 by Euler‟s method , given

. Assume

h= 0.2

9. Use Runga –kutta method to find y(0,2) , given

taking h=0.1.

10. Find f(2) for the data f(0)=1 ,f(1)=3 and f(3) =55 using Lagrange‟s formula.

4

Page 24: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 24

4

EC 202

SIGNALS & SYSTEMS

Page 25: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 25

4.1.COURSE INFORMATION SHEET

PROGRAMME: ELECTRONICS AND

COMMUNICATION ENGINEERING

DEGREE: BTECH

COURSE: SIGNALS AND SYSTEMS SEMESTER: IV CREDITS: 4

COURSE CODE: EC202

REGULATION: 2016

COURSE TYPE: CORE

COURSE AREA/DOMAIN: SIGNAL

PROCESSING

CONTACT HOURS: 3+1 (Tutorial)

hours/Week.

CORRESPONDING LAB COURSE CODE

(IF ANY): EC333

LAB COURSE NAME: DIGITAL SIGNAL

PROCESSING LAB

SYLLABUS:

UNIT DETAILS HOURS

I Elementary Signals, Classification and Representation of Continuous time and

Discrete time signals, Signal operations

Continuous Time and Discrete Time Systems - Classification, Properties.

Representation of systems: Differential Equation representation of Continuous

Time Systems. Difference Equation Representation of Discrete Systems.

9

II Continuous Time LTI systems and Convolution Integral.

Discrete Time LTI systems and linear convolution.

Stability and causality of LTI systems.

Correlation between signals, orthogonality of signals.

9

III Frequency Domain Representation of Continuous Time Signals- Continuous

Time Fourier Series and its properties.

Convergence, Continuous Time Fourier Transform: Properties.

Laplace Transform, ROC, Inverse transform, properties, unilateral Laplace

Transform

Relation between Fourier and Laplace Transforms.

9

IV Analysis of LTI systems using Laplace and Fourier Transforms. Concept of

transfer function, Frequency response, Magnitude and phase response.

Sampling of continuous time signals, Sampling theorem for lowpass signals,

aliasing.

6

V Z transform, ROC , Inverse transform, properties, unilateral Z transform.

Frequency Domain Representation of Discrete Time Signals, Discrete

Time Fourier Series and its properties.

Discrete Time Fourier Transform (DTFT) and its properties

9

VI

Relation between DTFT and Z-Transform, Analysis of Discrete Time LTI

systems using Z transforms and DTFT, Transfer function, Magnitude and phase

response.

6

Page 26: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 26

TOTAL HOURS 48

TEXT/REFERENCE BOOKS:

T/R BOOK TITLE/AUTHORS/PUBLICATION

1. Alan V. Oppenheim and Alan Willsky, Signals and Systems, PHI, 2/e, 2009

2. Simon Haykin Signals & Systems, John Wiley, 2/e, 2003

3.

Anand Kumar, Signals and Systems, PHI, 3/e, 2013.

4.

Mahmood Nahvi, Signals and System, Mc Graw Hill (India), 2015.

5.

P Ramakrishna Rao, Shankar Prakriya, Signals and System, MC Graw Hill Edn 2013.

6.

B P. Lathi, Priciples of Signal Processing & Linear systems, Oxford University Press.

7.

Gurung, Signals and System , PHI.

8

Rodger E. Ziemer Signals & Systems - Continuous and Discrete, Pearson, 4/e, 2013

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

EC 201 NETWORK THEORY Laplace Transforms, Frequency

Response

III

MA102 DIFFERENTIAL

EQUATIONS

Homogeneous linear ordinary

differential equation, Fourier series,

II

MA101 CALCULUS Single Variable Calculus and Infinite

series

I

COURSE OBJECTIVES:

1 Understanding of Signals and Systems is essential for a proper appreciation and application

of other parts of electrical engineering, such as signal processing, communication systems,

and control systems.

2 The course lays the mathematical foundations for the study of signals and systems,

classification of signals - continuous time and discrete time signals and properties of

systems.

3 Helps the students in dealing with signals in both time and frequency domains and

Page 27: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 27

responses of the systems in both time and frequency domains.

4 This subject, which consolidates and expands student knowledge from lower division

mathematics, constitutes an essential conceptual framework from which to understand a

variety of engineering systems.

5 The subject also deals with introductory treatments on the subject of filtering, sampling,

also Z transforms and Laplace Transforms.

COURSE OUTCOMES:

SNO DESCRIPTION

1

Ability to identify the basic difference between continuous and discrete time signals

& systems.

2 Ability to analyze the continuous time and discrete time signals in Fourier domain.

3 Ability to design suitable filters required for signal processing applications

4 Ability to apply Laplace transform and Z transform in the analysis of continuous time

and discrete time systems

5 Signal and System analysis, design and problem solving ability of students is

improved.

CO-PO-PSO MAPPING:

CO No. Programme Outcomes (POs)

Programme-

specific Outcomes

(PSOs)

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 3 2 2 2 3 2

2 3 3 3 3 2 3 3

3 3 3 3 3 3 1 2 1 3 2 2

4 3 3 3 3 1 3 3 1

5 3 3 2 3 2 1 1 2 3 1

EC010

403 3 3 3 2 2 1 1 3 3 1

JUSTIFICATION FOR CO-PO-PSO CORRELATION:

PO1 PO2 PO3 PO4 PO5 PO7 PO10 PSO1 PSO2 PSO3

Page 28: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 28

C

O

1

Signal

and

Syste

m

classif

icatio

n and

operat

ions,

LTI

Syste

ms,

LTI

System

s,

Differe

ntial

and

differen

ce

equatio

n

represe

ntation

of

systems

LTI

System

s,

Differe

ntial

and

differen

ce

equatio

n

represe

ntation

of

systems

Signal

and

System

classifi

cation

and

operati

ons,

LTI

System

s

Signal

and

system

classifi

cation,

frequen

cy

domain

techniq

ue and

analysi

s, filter

design

Signal

and

System

classifi

cation

and

operati

ons,

LTI

System

s

C

O

2

CTFS

,

CTFT

,

DTFS

,

DTFT

CTFS,

CTFT,

DTFS,

DTFT

CTFS,

CTFT,

DTFS,

DTFT,

filterin

g

CTF

S,

CTF

T,

DTF

S,

DTF

T

CTFS,

CTFT,

DTFS,

DTFT,s

amplin

g and

filterin

g

Fourier

domain

techniq

ues,

samplin

g

Fourier

domain

techniq

ues,

samplin

g

C

O

3

Fourie

r

domai

n

techni

ques,

sampl

ing

and

filteri

ng

Fourier

domain

techniq

ues,

samplin

g

Fourier

domain

techniq

ues,

samplin

g and

filterin

g

Fouri

er

doma

in

techn

iques

,

samp

ling

Butter

worth

and

Chebys

hev

Filter

design

Butte

rwort

h and

Cheb

yshev

Filter

desig

n

Filteri

ng

Butter

worth

and

Chebys

hev

Filter

design

Butter

worth

and

Chebys

hev

Filter

design

Filter

desig

n for

vario

us

appli

catio

ns

C

O

4

Lapla

ce and

Z

Transf

orm

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm

Lapl

ace

and

Z

Tran

sfor

m

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm,

Pole

Zero

concept

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm

Anal

ysis

of CT

and

DT

syste

ms

Page 29: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 29

C

O

5

LTI

Syste

ms,

Fourie

r

domai

n

techni

ques,

Lapla

ce and

Z

Transf

orm

LTI

System

s,

Sampli

ng,

Fourier

domain

techniq

ues,

Laplace

and Z

Transfo

rm

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm,,

Filter

Design

Fouri

er

doma

in

techn

iques

,

Lapl

ace

and

Z

Tran

sfor

m

LTI

System

s,Filter

Design,

Analysi

s and

charact

erizatio

n of

LTI

systems

Signal

and

Syste

m

classif

icatio

n and

operat

ions,

LTI

Syste

ms

and

Analy

sis,

Proble

m

solving

skills,

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm,,

Filter

Design

Analysi

s and

charact

erizatio

n of

LTI

systems

using

Laplace

and Z-

Transfo

rm,,

Filter

Design

Anal

ysis

of CT

and

DT

syste

ms

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

SNO DESCRIPTION PROPOSED

ACTIONS

1 Matlab Simulations AssignmentS, projects

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

TOPICS

1 Discrete Fourier Transform (DFT)

2 Fast Fourier Transform (FFT)

3 Analog and Digital Filter Design

DESIGN AND ANALYSIS TOPICS:

Sl.

No.

DESCRIPTION

1 Design and Analysis of Butterworth, Chebyshev and Elliptic Filters

WEB SOURCE REFERENCES:

1 Signals and Systems NPTEL online IIT Mumbai

2 www.nptel.iitm.ac.in/courses/117104074/

3 www.ece.gatech.edu/users/bonnie/book/worked_problems.html

4 www.ece.jhu.edu/~cooper/courses/214/signalsandsystemsnotes.pdf

5 link.springer.com/journal/498

Page 30: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 30

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

☐ CHALK & TALK ☐ STUD.

ASSIGNMENT

☐ WEB

RESOURCES

☐ LCD/SMART

BOARDS

☐ STUD.

SEMINARS

☐ ADD-ON

COURSES

ASSESSMENT METHODOLOGIES-DIRECT

☐ ASSIGNMENTS ☐ STUD.

SEMINARS

☐ TESTS/MODEL

EXAMS

☐ UNIV.

EXAMINATION

☐ STUD. LAB

PRACTICES

☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

CERTIFICATIONS

☐ ADD-ON

COURSES

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

☐ ASSESSMENT OF COURSE OUTCOMES

(BY FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON

FACULTY (E)

☐ ASSESSMENT OF MINI/MAJOR

PROJECTS BY EXT. EXPERTS

☐ OTHERS

Prepared by Approved

by

Indu S (HOD)

Jos Prakash A V

Naveen N

Page 31: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 31

4 .2 COURSE PLAN

1 Introduction

2 Elementary signals

3 Elementary signals

4 Classification and Representation of Continuous time and Discrete time

signals - 1

5 Classification and Representation of Continuous time and Discrete time

signals - 2

6 Signal operations

7 Signal operations

8 Introduction to systems - Continuous Time and Discrete Time Systems

- Classification, Properties. - 1

9 Continuous Time and Discrete Time Systems - Classification,

Properties. - 2

10 Continuous Time and Discrete Time Systems - Classification,

Properties. - 3

11 Continuous Time and Discrete Time Systems - Classification,

Properties. – 4

12 Continuous Time LTI systems

13 Convolution Integral - 1

14 Convolution Integral - 2

15 Discrete Time LTI systems and linear convolution

16 Convolution Sum

17 Stability and causality of LTI systems - 1

18 Stability and causality of LTI systems - 2

19 Correlation between signals

20 orthogonality of signals

21 Differential Equation representation of Continuous Time Systems

Page 32: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 32

22 Difference Equation Representation of Discrete Systems.

23 Frequency Domain Representation of Continuous Time Signals -

Introduction

24 Continuous Time Fourier Series

25 CTFS - properties 1

26 CTFS - properties 2 , Convergence of CTFS

27 Continuous Time Fourier Transform: -- Introduction

28 Continuous Time Fourier Transform: Properties -1

29 Continuous Time Fourier Transform: Properties -2

30 Laplace Transform and its ROC

31 Inverse Laplace transform

32 properties of Unilateral and Bilateral Laplace Transform

33 Relation between Fourier and Laplace Transforms.

34 Analysis of LTI systems using Laplace and Fourier Transforms

35 Concept of transfer function

36 Frequency response - Magnitude and phase response.

37 Sampling of continuous time signals - Introduction

38 Sampling theorem for lowpass signals

39 Aliasing

40 Z transform, ROC - introduction

41 properties- unilateral and bilateral Z transform 1

42 properties- unilateral and bilateral Z transform 2

43 Inverse Z transform

44 Frequency Domain Representation of Discrete Time Signals -

Introduction

45 Discrete Time Fourier Series and its properties 1

46 Discrete Time Fourier Series and its properties 2

Page 33: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 33

47 Discrete Time Fourier Series and its properties - 3

48 Discrete Time Fourier Transform (DTFT) - Introduction

49 Discrete Time Fourier Transform (DTFT) - properties 1

50 Discrete Time Fourier Transform (DTFT) properties -2

51 Relation between DTFT and Z-Transform

52 Analysis of Discrete Time LTI systems using Z transforms - 1

53 Analysis of Discrete Time LTI systems using Z transforms - 2

54 Analysis of Discrete Time LTI systems using DTFT

55 Transfer function, Magnitude and phase response 1

56 Transfer function, Magnitude and phase response 1

57 Transfer function, Magnitude and phase response 2

Page 34: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 34

4.3 SAMPLE QUESTIONS

UNIT I

REPRESENTATION OF SIGNALS

1. Define Signal.

2. Define system.

3. What are the major classifications of the signal?

4. Define discrete time signals and classify them.

5. Define continuous time signals and classify them.

6. Define discrete time unit step &unit impulse.

7. Define continuous time unit step and unit impulse.

8. Define unit ramp signal.

9. Define periodic signal and non0periodic signal.

10. Define even and odd signal ?

11. Define Energy and power signal.

12. Define unit pulse function.

13. Define continuous time complex exponential signal.

14. What is continuous time real exponential signal.

15. What is continuous time growing exponential signal? 16. State the BIBO criterion for stability.

17. Find whether the signal given by x (n) = 5cos (6 _n) is periodic

18. Write down the exponential form of the Fourier series representation of a Periodic signal?

19. Write down the trigonometric form of the fourier series representation of a periodic signal?

20. Write short notes on dirichlets conditions for fourier series.

21. State Time Shifting property in relation to fourier series.

22. State parseval‟s theorem for continuous time periodic signals.

PART – B

a. (a) For the systems represented by the following functions. Determine whether every system is (1) stable (2) Causal (3) linear (4) Shift invariant (4)

(i) T[x(n)]= ex(n) (ii) T[x(n)]=ax(n)+6

Page 35: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 35

b. Determine whether the following systems are static or Dynamic, Linear or Nonlinear,Shift variant or Invarient, Causal or Non0causal, Stable or unstable. (4)

(i) y(t) = x(t+10) + x2(t) (ii) dy(t)/dt + 10 y(t) = x(t)

c. Explain about the properties of continuous time fourier series. (8)

d. Find the fourier coefficients of the given signal. (4)

x(t) = 1+ sin 2_ot + 2 cos 2_ot + cos (3_ot + _/3)

5. Determine the Fourier series coefficient of exponential representation of x(t)

x(t) = 1, ItI (8)

0, T1< ItI < T/ 2

6. Find the exponential series of the following signal. (8)

7. Find which of the following signal are energy or power signals. (8)

a) x(t)=e03t u(t) b) x(t) = ej(2t+_/4) c) x(n)= cos(_/4n)

8. Explain the properties of Discrete time fourier serier (8)

9. Find the cosine fourier series of an half wave rectified sine function. (8)

10. Explain the classification of signals with examples. (8)

UNIT II ANALYSIS OF CONTINUOUS TIME SIGNALS AND SYSTEMS

PART0A (2 Marks)

1. Define continuous time system.

2. Define Fourier transform pair.

3. Write short notes on dirichlets conditions for fourier transform.

4. Explain how aperiodic signals can be represented by fourier transform.

5. State convolution property in relation to fourier transform.

6. State parseval‟s relation for continuous time fourier transform.

7. What is the use of Laplace transform?

8. What are the types of laplace transform?

9. Define Bilateral and unilateral laplace transform. 10. Define inverse laplace transform.

11. State the linearity property for laplace transform.

12. State the time shifting property for laplace transform.

13. Region of convergence of the laplace transform.

14. What is pole zero plot.

15. State initial value theorem and final value theorem for laplace transform.

16. State Convolution property.

17. Define a causal system.

18. What is meant by linear system?

19. Define time invariant system.

Page 36: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 36

20. Define stable system?

21. Define memory and memoryless system. 22. Define invertible system.

23. What is superposition property?

24. Find the fourier transform of x(t)=cos(_0t)

PART – B

1. Determine the inverse laplace of the following functions. (6)

1) 1/s(s+1) 2) 3s2 +8s+6 (s+2)(s2+2s+1)

2. Explain about the classifications of continuous time system. (8)

3. A system is described by the differential equation. (10) d2y(t)/dt2+3dy(t)/dt+2y(t)=dx(t)/dt if y(0) =2;dy(0)/dt = 1 and x(t)=e0t u(t) Use laplace transform to determine the response of the system to a unit step input applied at t=0.

4. Obtain the transfer function of the system when y(t) = e0t02 e02t+ e03t and x(t)= e00.5t (8) 5. a) Discuss the condition on stability of an LTI system based on Laplace domain representation. (3)

b) Bring the equivalence between Laplace transform and Fourier transform.(5)

6. Explain the properties of laplace transform (8)

7. Find the impulse and step response of the following systems H(s) = 10/s2+6s+10 (6)

8.For the transfer function H(s) = s+10/ s2+3s+2 find the response due to input x(t) = sin2(t)

u(t) (6)

9. Find the fourier transform of triangular pulse (10) x(t) = _(t/m) ={102|t|/m |t| 0 otherwise

10. The input and output of a causal LTI system are related by the differential equation. (10)

d2y(t)/dt2+6dy(t)/dt+8y(t)=2x(t) i) Find the impulse response of the system. ii) What is

the response of this system if x(t) = t e02t u(t) 11. Consider a causal LTI system with

frequency response. (10) H(j_) = 1/ j_ +2 For a particular input x(t) this system is y(t)=

e02t u(t) 0 e03t u(t)

UNIT III SAMPLING THEOREM AND Z TRANSFORMS

PART0A (2 Marks)

1. Why CT signals are represented by samples.

2. What is meant by sampling.

3. State Sampling theorem.

4. What is meant by aliasing.

5. What are the effects aliasing.

6. How the aliasing process is eliminated.

7. Define Nyquist rate.and Nyquist interval.

8. Define sampling of band pass signals.

9. Define Z transform.

Page 37: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 37

10. What are the two types of Z transform?

11. Define unilateral Z transform.

13. What is region of Convergence. 14. What are the Properties of ROC.

15. What is the time shifting property of Z transform.

16. What is the differentiation property in Z domain.

17. State convolution property of Z transform.

18. State the methods to find inverse Z transform.

19. State multiplication property in relation to Z transform.

20. State parseval‟s relation for Z transform.

21. What is the relationship between Z transform and fourier transform.

22. What is meant by step response of the DT system.

PART – B

1.State and prove the sampling theorem. Also explain how reconstruction of original signal is done from sampled signal (16)

2. Find the Z – transform of the signal (8) (i)x(n)= nan u(n) (ii)x(n)= an cos(_0) u(n)

3. Determine the inverse z transform of the following function x(z)=1/(1+z01) (10z01 )2 ROC : |Z>1|

4. Explain the properties of z0transform (8)

5. Find the z0transform of x(z)= 1+2z01 / 10 2z01 + z02 if x(n) is anticausal using long

division method. (8)

6. find the inverse z0transform of x(z)= 1+3z01 / 1+ 3z01 + 2z02 using residue

method(8)

7. Give the relationship between z0transform and fourier transform. (8)

UNIT IV DISCRETE TIME SYSTEMS

PART0A (2 Marks)

1. Define Transfer function of the DT system.

2. Define impulse response of a DT system.

3. State the significance of difference equations.

4. Write the differece equation for Discrete time system.

5. Define frequency response of the DT system.

6. What is the condition for stable system.

7. What are the blocks used for block diagram representation.

8. State the significance of block diagram representation.

9. What are the properties of convolution?

10. State theCommutative properties of convolution?

Page 38: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 38

11. State the Associative properties of convolution

12. State Distributive properties of convolution 13. Define causal system.

14. What is the impulse response of the system y(t)=x(t0t0).

15. What is the condition for causality if H(z) is given.

16. What is the condition for stability if H(z) is given.

17. Check whether the system is causal or not ,the H(z) is given by (z3 + z)/(z+1).

18. Check whether the system is stable or not ,the H(z) is given by (z/z0a).,|a|<1.

19. Determine the transfer function for the sys tem described by the difference equation y(n)0 y(n01) = x(n)0 x(n02).

20. How the discrete time system is represented.

PART – B

1. Give the properties of convolution (6)

2. Determine the step response of the difference equation, y(n)0(1/9)y(n02)=x(n01) with y(01)=1 and y(02)=0 (8)

3. Find the impulse response and step response.

4. Find the output y(n) of a linear time invariant discrete time system specified by the equation. (16)

Y(n)03/2y(n01) +1/2 y(n02) = 2x(n) +3/2 x(n01) when initial conditions are y(01) =0,y(02) = 1 and input x(n)=(1/4)n u(n)

5. Determine the Nyquist sampling rate and Nyquist sampling intervals for

sinc(200_t) + 3sinc2(120_t) (6)

6. Find the frequency response of the following causal system. Y(n)=1/2x(n)+x(n01)+1/2 x(n02) (4)

7. Determine inverse Discrete Time Fourier Transform of X(k)={1,0,1,0} (8)

8. Give the summary of elementary blocks used to represent discrete (4) time systems.

UNIT V SYSTEM WITH FINITE AND INFINITE DURATION

IMPULSE RESPONSE

PART0A (2 Marks)

Page 39: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 39

1. What is meant by FIR system.

2. What is meant by IIR system.

3. What is recursive system?

4. What is Non recursive system?

5. What is the difference between recursive and non recursive system 6. Define realization structure.

7. What are the different types of structure realization.

8. What is natural response?

9. What is zero input Response?

10. What is forced response?

11. What is complete response?

12. Give the direct form I structure.

13. Give the direct form II structure..

14. How the Cascade realization structure obtained.

15. Give the parallel for Realization structure.

16. What is transformed structure representation?

PART – B

1..a) Determine the transposed structure for the system given by difference equation y(n)=(1/2)y(n01)0(1/4)y(n02)+x(n)+x(n01) (16)

b) Realize H(s)=s(s+2)/(s+1)(s+3)(s+4) in cascade form

2. A difference equation of a discrete time system is given below: y(n)03/4 y(n01) +1/8 y(n01) = x(n) +1/2 x(n01)

draw direct form I and direct form II. (6)

3. Realize the following structure in direct form II and direct form I H(s) = s+1/s2 + 3s+5 (10)

4. Determine the recursive and nonrecursive system (16)

5. Determine the parallel form realization of the discrete time system is y(n) 01/4y(n01) 01/8 y(n02) = x(n) +3x(n01)+2x(n02) (10)

Page 40: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 40

5

EC 204

ANALOG INTEGRATED CIRCUITS

Page 41: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 41

6.1 COURSE INFORMATION SHEET

PROGRAMME: Electronics and

Communication Engineering

DEGREE: B.Tech

COURSE: ANALOG INTEGRATED

CIRCUITS

SEMESTER: 4 CREDITS: 4

COURSE CODE: EC204 REGULATION:

2016

COURSE TYPE: CORE

COURSE AREA/DOMAIN: ANALOG

INTEGRATED CIRCUITS

CONTACT HOURS: 4 hours /Week.

CORRESPONDING LAB COURSE CODE

(IF ANY): EC232

LAB COURSE NAME: ANALOG

INTEGRATED CIRCUITS LAB

SYLLABUS:

UNIT DETAILS HOURS

I Differential amplifiers: Differential amplifier configurations using BJT,

Large and small signal operations, Balanced and unbalanced output

differential amplifiers, Input resistance, voltage gain, CMRR, non ideal

characteristics of differential amplifier. Frequency response of differential

amplifiers, Current sources, Active load, Concept of current mirror

circuits, Wilson current mirror circuits, multistage differential amplifiers.

Operational amplifiers: Introduction, Block diagram, Ideal op-amp

parameters, Equivalent Circuit, Voltage Transfer curve, open loop op-

amp configurations, Effect of finite open loop gain, bandwidth and slew

rate on circuit performance

11

II Op-amp with negative feedback: Introduction, feedback configurations,

voltage series feedback, voltage shunt feedback, properties of Practical op-

amp.

Op-amp applications: Inverting and non inverting amplifier, dc and ac

amplifiers, peaking amplifier, summing, scaling and averaging amplifiers,

instrumentation amplifier.

7

III Op-amp applications: Voltage to current converter, current to voltage

converter, integrator, differentiator, precision rectifiers, log and antilog

amplifier, Phase shift and Wien bridge oscillators

6

IV Square, triangular and saw tooth wave generators, Comparators, zero

crossing detector, Schmitt trigger, characteristics and limitations.

Active filters, First and Second order Butterworth filter and its frequency

response for LPF, HPF, BPF, BSF, and Notch filter.

9

V Specialized IC‟s and its applications: Timer IC 555 (monostable & astable

operation), Voltage controlled oscillator, Analog Multiplier

PLL, operating principles, Applications: frequency multiplication/division,

Frequency synthesizer, AM & FM detection , FM modulator/Demodulator

Monolithic Voltage Regulators: Three terminal voltage regulators 78XX and

79XX series, IC723 , low voltage and high voltage regulator, Current

boosting, short circuit and fold back protection.

12

VI Data Converters: D/A converter , specifications , weighted resistor type, R-

2R Ladder type, switches for D/A converters, high speed sample-and-hold

circuits

A/D Converters: Specifications, Flash type, Counter ramp type, Successive

8

Page 42: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 42

Approximation type, Single Slope type, Dual Slope type

TOTAL HOURS 53

TEXT/REFERENCE BOOKS:

T/R BOOK TITLE/AUTHORS/PUBLICATION

1. Salivahanan S. ,V. S. K. Bhaaskaran, Linear Integrated Circuits, Tata McGraw Hill,

2008

2. Franco S., Design with Operational Amplifiers and Analog Integrated Circuits, 3/e,

Tata McGraw Hill, 2008

3. David A. Bell, Operational Amplifiers & Linear ICs, Oxford University Press,

2ndedition, 2010

4. Gayakwad R. A., Op-Amps and Linear Integrated Circuits, Prentice Hall, 4/e, 2010.

5. R.F. Coughlin & Fredrick Driscoll, Operational Amplifiers & Linear Integrated

Circuits, 6th Edition, PHI,2001

6. C.G. Clayton, Operational Amplifiers, Butterworth & Company Publ. Ltd./ Elsevier,

1971

7. Roy D. C. and S. B. Jain, Linear Integrated Circuits, New Age International, 3/e, 2010

8. Botkar K. R., Integrated Circuits, 10/e, Khanna Publishers, 2010

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

NIL NIL NIL NIL

COURSE OBJECTIVES:

1 To equip the students with a sound understanding of fundamental concepts of

operational amplifiers

2 To know the diversity of operations that op amp can perform in a wide range of

applications

3 To introduce a few special functions integrated circuits

4 To impart basic concepts and types of data converters

COURSE OUTCOMES:

SNO DESCRIPTION

1 The students will have a thorough understanding of operational amplifiers

2 Students will be able to design circuits using operational amplifiers for various

applications

CO-PO-PSO MAPPING:

Programme Outcomes (POs) Programme-specific

Outcomes (PSOs)

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 1 2 1 1 2 3 1

2 2 2 2 1 2 5 1

EC01

10 7 8 7 4 6 1 3

Page 43: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 43

JUSTIFICATION FOR CO-PO-PSO CORRELATION:

PO1 PO2 PO3 PO4 PO5 PSO1 PSO2

CO1 Analog

circuits

can be

designed

and

modified

to

provide

solutions

to real-

life

problems

Design &

demonstr

ation of

experime

nts will

help to

identify

the

problems

and lead

to

modificat

ions

Design of

basic

analog

circuits

Team

work

required

for

designing

&

demonstr

ation of

circuits

Designin

g

enhances

engineeri

ng skills

Design &

demonstr

ation of

analog

circuits

involves

circuit

implemen

tation,

testing &

troublesh

ooting

With

prior

knowledg

e of EDA

tools,

students

can use

their

knowledg

e to

simulate,

experime

nt &

develop

newer applicatio

ns

CO2 IC

circuits

can be

used in a

wide-

range of

applicatio

ns like

communi

cation,

instrumen

tation etc.

Design &

analysis

of analog

IC

circuits

A wide

range of

applicatio

n can be

develope

d using

linear

ICs.

Everyday

electronic

s makes

use of ICs

extensivel

y

Group

work is

essential

for all the

activities

so as to

draw

meaningf

ul

inference

s

Design &

analysis

are key to

engineeri

ng

With

prior

knowledg

e of EDA

tools,

students

can use

their

knowledg

e to

simulate,

experime

nt &

develop

newer

applicatio

ns

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

SNO DESCRIPTION PROPOSED

ACTIONS

1 (Not identified) (N. A.)

Proposed Actions: Topics Beyond Syllabus/Assignment/Industry Visit/Guest Lecturer/Nptel Etc

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

1 Scope of Analog Integrated Circuits & Design

2. MOS-based differential amplifier circuits

Page 44: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 44

WEB SOURCE REFERENCES:

1 /www.coursera.org/learn/electronics

2 https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-002-circuits-

and-electronics-spring-2007/

3 http://www.nptel.ac.in/courses/Webcourse-contents/IIT-

ROORKEE/Analog%20circuits/index.htm

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK &

TALK

STUD.

ASSIGNMEN

T

WEB

RESOURCES

☐ LCD/SMART

BOARDS

STUD.

SEMINARS

☐ ADD-ON

COURSES

ASSESSMENT METHODOLOGIES-DIRECT

ASSIGNMENTS

☐ STUD.

SEMINARS

TESTS/MODEL

EXAMS

UNIV.

EXAMINATI

ON

STUD.

LAB

PRACTICE

S

STUD.

VIVA

MINI/MAJOR

PROJECTS

CERTIFICATIONS

☐ ADD-ON

COURSES

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

☐ ASSESSMENT OF COURSE OUTCOMES

(BY FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON

FACULTY

☐ ASSESSMENT OF MINI/MAJOR PROJECTS

BY EXT. EXPERTS

☐ OTHERS

Prepared by Approved by

Ms. Jisa David

Mr. Kiran K A

Mr. Ajai V Babu (HOD)

Page 45: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 45

5.2 COURSE PLAN

Day Module Topic

1 1 Introduction to the course: Analog Integrated Circuits

2 1 Differential Amplifiers: Introduction

3 1 Large signal Operation

4 1 Small signal operation

5 1 Balanced & unbalanced output differential amplifiers

6 1 Input resistance, voltage gain, CMRR

7 1 Non-ideal characteristics of differential amplifiers

8 1 Frequency Response of differential amplifiers

9 1 Current sources

10 1 Active load, Concept of current mirror circuits

11 1 Wilson current mirror circuits

12 1 Multistage differential amplifiers

13 1 Operational amplifiers: Introduction & Block diagram

14 1 Ideal Parameters, Equivalent Circuit

15 1

Voltage transfer curve, Open loop op-amp

configurations

16 1

Effect of finite open loop gain, bandwidth & slew rate on

circuit performance

17 2 Op-amp with negative feedback: Introduction

18 2

Feedback configuration : Voltage series & voltage shunt

feedback

19 2 Properties of practical op-amp

20 2

Inverting & Non-inverting op-amplifier – AC & DC

amplifiers

21 2

Peaking amplifier, Summing, scaling & averaging

amplifiers

22 2 Instrumentation amplifier

23 3

Voltage-to-current converter, current-to-voltage

converter

24 3 Integrator, differentiator

25 3 Precision rectifiers, log & antilog amplifier

26 3 Phase shift oscillator, Wien Bridge oscillator

Page 46: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 46

27 4 Square & Triangular wave oscillators

28 4 Sawtooth wave generators

29 4

Comparators, Zero crossing detector, Schmitt Trigger,

Characteristics & limitations of comparators

30 4 Active filters – First & Second order Butterworth fiters

31 4

Frequency response for LPF, HPF, BPF, BSF and notch

filter

32 5 Specialized ICs & their applications: Timer IC 555

33 5 Timer IC 555: Astable & Monostble multivibrator

34 5 Voltage controlled oscillator

35 5 Analog Multiplier

36 5 PLL – operating principles

37 5 Frequency multiplication/division

38 5 Frequency synthesizer

39 5 AM & FM detection, FM modulator/demodulator

40 5

Monolithic Voltage regulators: Three terminal voltage

regulators

41 5 78XX, 79XX, IC723

42 5 Low voltage & high voltage regulators

43 5 Current boosting

44 5 Short circuit & fold back protection

45 6 Data converters

46 6 D/A Converter: Specifications

47 6 Weighted resistor type, R-2R ladder type

48 6 Switches for D/A converters

49 6 High speed Sample-and-Hold circuits

50 6 A/D Converters: Specifications

51 6 Flash type, Counter ramp type

52 6 Successive approximation type

53 6 Single slope type, dual slope type

Page 47: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 47

6

EC 205

COMPUTER ORGANISATION

Page 48: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 48

6.1 COURSE INFORMATION SHEET

PROGRAMME: Electronics &

Communications Engineering

DEGREE: BTECH

COURSE: Computer Organization SEMESTER: S4 CREDITS: 4

COURSE CODE: EC206

REGULATION: 2015

COURSE TYPE: CORE/ELECTIVE /

BREADTH/ S&H

COURSE AREA/DOMAIN:

ELECTRONICS

CONTACT HOURS: 4 hours/Week.

CORRESPONDING LAB COURSE CODE

(IF ANY):

LAB COURSE NAME:

SYLLABUS:

UNIT DETAILS HOURS

Functional units of a computer, Arithmetic Circuits, Processor architecture, Instructions and

addressing modes, Execution of program, micro architecture design process, design or data

path and control units, I/O accessing techniques, Memory concepts, memory interface, cash

and virtual memory concepts

1

Functional units of a computer: Arithmetic Circuits –Adder- Carry

propagate adder, Ripple carry adder, Basics of carry look ahead and prefix

adder, Subtractor, Comparator, ALU

Shifters and rotators, Multiplication, Division

Number System- Fixed Point & Floating Point

8

2

Architecture – Assembly Language, Instructions, Operands – Registers,

Register set, Memory, Constants.

Machine Language –R-Type, I-Type, J-Type Instructions, Interpreting

Machine Language code

5

3

Addressing Modes – register only, immediate, base, PC-relative, Pseudo –

direct

Steps for Executing a Program – Compilation, Assembling, Linking,

Loading

Pseudo instructions, Exceptions, Signed and Unsigned Instructions, Floating

Point Instructions

9

4 Microarchitecture- design process

Single cycle processor, Single cycle data path, single cycle control

multi cycle processor, multi cycle data path, multi cycle control

7

5

Memory & I/O systems – I/O accessing techniques: programmed, interrupt

driven and DMA, DMA bus arbitration

Memory Arrays – Bit Cells, Organization, Memory Ports Memory types-

DRAM, SRAM, Register Files, ROM

6

6

Memory - Hierarchy, Performance analysis

Cache Memory – direct mapped, multi way set associate cache, Fully

associate cache

Virtual Memory – Address Translation, Page Table, Translation Look aside

7

Page 49: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 49

Buffer, Memory Protection, replacement polices

TOTAL HOURS 42

TEXT/REFERENCE BOOKS:

T/R BOOK TITLE/AUTHORS/PUBLICATION

T David Money Harris, Sarah L Harris, Digital Design and Computer Architecture,

Morgan Kaufmann – Elsevier, 2009

R

William Stallings: “Computer Organisation and Architecture”, Pearson Education

R

John P Hayes: “Computer Architecture and Organisation”, Mc Graw Hill

R

Andrew S Tanenbaum: “Structured Computer Organisation”, Pearson Education

R

Craig Zacker: “PC Hardware: The Complete Reference”, TMH.

R

Carl Hamacher “Computer Organization ”, Fifth Edition, Mc Graw Hill.

R

David A. Patterson and John L. Hennessey, “Computer Organisation and Design”,

Fourth Edition, Morgan Kaufmann.

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

EC 207 Logic circuit design

Student will have knowledge of basic

logic circuits

2

COURSE OBJECTIVES:

1

To impart knowledge in different aspects of processor design

2

To develop understanding about processor architecture.

3

To impart knowledge in programming concepts

4

To develop understanding on I/O accessing techniques and memory structures

Page 50: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 50

COURSE OUTCOMES:

Sl No. DESCRIPTION

1 Illustrate the structure of a computer

2 Categorize different types of memories

3 Explain various techniques in computer design

4 Design Control Unit and ALU for simple applications

5 Perform the performance analysis of computer system

6 Understand and design the architecture of the IO subsystem of a computer

CO MAPPING WITH PO, PSO

CO

No.

Programme Outcomes (POs) Programme-

Specific

Outcomes

(PSOs)

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 3 3 3 1 1 2 1 2 1

2 3 3 3 1 1 1 1 1 2 1

3 3 3 3 1 1 1 1 2 1 1

4 3 3 3 1 1 1 1 1 1

5 3 3 3 1

6 3 3 3 1

EC20

6

3 3 3 1 1 1 1 1 2 1

JUSTIFICATION FOR CO-PO-PSO CORRELATION:

JUSTIFICATION FOR CO-PO MAPPING

MAPPING LEVEL JUSTIFICATION

EC206.1-PO1 3 Processor design involves solving complex engineering problems

EC206.1-PO2 3 Principles of mathematics and engineering sciences are used in

various aspects of processor design

EC206.1-PO3 3 Using the knowledge of processor design, we can design and

develop solutions for complex engineering problems

EC206.1-PO4 1 Processor design knowledge can be used to design and conduct

experiments to provide valid conclusions

EC206.1-PO9 1 Expertise developed, which will enable the student to become a

productive member of a design team

Page 51: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 51

EC206.1-

PO12 2 The student will become aware of the need for lifelong learning

and the continued upgrading of technical knowledge

EC206.2-PO1 3 Processor Architecture involves solving complex engineering

problems

EC206.2-PO2 3 Principles of mathematics and engineering sciences are used in

various aspects of processor Architecture

EC206.2-PO3 3 Knowledge of processor architecture can be used to design and

develop solutions for complex engineering problems

EC206.2-PO4 1 Processor Architecture knowledge can be used to design and

conduct experiments to provide valid conclusions

EC206.2-PO6 1 Knowledge of processor Architecture will help understand issues

and societal problems related to cybercrimes and computer

hacking

EC206.2-PO9 1 Expertise developed, which will enable the student to become a

productive member of a design team

EC206.2-

PO12

1 The student will become aware of the need for lifelong learning

and the continued upgrading of technical knowledge

EC206.3-PO1 3 Processor design involves solving complex engineering problems

EC206.3-PO2 3

Principles of mathematics and engineering sciences are used in

various aspects of processor

EC206.3-PO3 3 Knowledge of processor architecture can be used to design and

develop solutions for complex engineering problems

EC206.3-PO4 1 Processor Architecture knowledge can be used to design and

conduct experiments to provide valid conclusions

EC206.3-PO6 1 Knowledge of processor Architecture will help understand issues

and societal problems related to cybercrimes and computer

hacking

EC206.3-PO9 1 Expertise developed, which will enable the student to become a

productive member of a design team

EC206.3-

PO12

1 The student will become aware of the need for lifelong learning

and the continued upgrading of technical knowledge

EC206.4-PO1 3 Processor design involves solving complex engineering problems

EC206.4-PO2 3 Principles of mathematics and engineering sciences are used in

various aspects of processor Architecture

EC206.4-PO3 3 Knowledge of processor architecture can be used to design and

Page 52: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 52

develop solutions for complex engineering problems

EC206.4-PO4 1 Processor Architecture knowledge can be used to design and

conduct experiments to provide valid conclusions

EC206.4-PO9 1 Expertise developed, which will enable the student to become a

productive member of a design team

EC206.4-

PO12

2 The student will become aware of the need for lifelong learning

and the continued upgrading of technical knowledge

EC206.5-PO1 3 Performance analysis involves solving complex engineering

problems

EC206.5-PO2 3 Performance analysis involves principles of mathematics and

engineering

EC206.5-PO3 3 Performance Analyis can be used to design and develop solutions

for complex engineering problems

EC206.5-PO4 3 Performance analysis skills can be used to design and conduct

experiments to provide valid conclusions

EC206.6-PO1 3 Design and architecture of IO systems involves solving complex

engineering problems

EC206.6-PO2 3 Design and Architecture of IO systems involves principles of

mathematics and engineering

EC206.6-PO3 3 IO Design can be used to design and develop solutions for

complex engineering problems

EC206.6-PO4 3 IO Design knowledge can be used to conduct experiments in IO

performance to provide valid conclusions

JUSTIFICATION FOR CO-PSO MAPPING

MAPPING LEVEL JUSTIFICATION

EC206.1-

PSO1

1

Complete or partial design of computer components may be done

using VLSI tools

EC206.1-

PSO2

2 Students can code, simulate and test functional blocks of

computer s using EDA tools

Page 53: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 53

EC206.1-

PSO3

1

Recognize the importance of continuous learning

EC206.2-

PSO1

1

Complete or partial design of computer components may be done

using VLSI tools

EC206.2-

PSO2

2

Students can code, simulate and test functional blocks of

computer s using EDA tools

EC206.2-

PSO3

1

Recognize the importance of continuous learning

EC206.3-

PSO1

2

Usage and also development of VLSI tools involves

programming

EC206.3-

PSO2

1 Usage and also development of EDA tools involves

programming

EC206.3-

PSO3

1

Recognize the importance of continuous learning

EC206.4-

PSO1

1

IO and memory designs can be used in VLSI and Embedded

systesms

EC206.4-

PSO2

1 IO and Memory designs can simulated and analyzed using EDA

tools

EC206.4-

PSO3

1

Recognize the importance of continuous learning

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

SNO DESCRIPTION PROPOSED

ACTIONS

PO MAPPING

1 Understanding of PC Hardware

Class Seminars 1, 2, 3, 4, 5, 6

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURE/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

S

No:

DESCRIPTION PO MAPPING

1 .

Evolution of computers to today‟s form 1, 2, 3, 4, 5, 6

2 Convergence of different computing devices

Page 54: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 54

DESIGN AND ANALYSIS TOPICS:

Sl. No. DESCRIPTION PO MAPPING

1 ALU Design 1, 2, 3, 4, 5, 9, 10

2 Microarchitecture and Control Unit Design

3 Memory System Design & Analysis

WEB SOURCE REFERENCES:

1. http://nptel.ac.in/courses/106103068/

2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-823-

computer-system-architecture-fall-2005/lecture-notes/

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

☑ CHALK & TALK ☑ STUD.

ASSIGNMENT

☐ WEB

RESOURCES

☑ LCD/SMART

BOARDS

☐ STUD.

SEMINARS

☐ ADD-ON

COURSES

ASSESSMENT METHODOLOGIES-DIRECT

☑ ASSIGNMENTS ☑ STUD.

SEMINARS

☑ TESTS/MODEL

EXAMS

☐ UNIV.

EXAMINATION

☐STUD. LAB

PRACTICES

☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

CERTIFICATIONS

☐ ADD-ON

COURSES

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

☑ ASSESSMENT OF COURSE OUTCOMES

(BY FEEDBACK, ONCE)

☑ STUDENT FEEDBACK ON

FACULTY (TWICE)

☐ ASSESSMENT OF MINI/MAJOR

PROJECTS BY EXT. EXPERTS

☐ OTHERS

Prepared by Approved by

Dr.

Sherly KK

Mr. Bonifus P L Jobin K Antony

(Faculty in Charge) (HoD)

Page 55: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 55

6.2 COURSE PLAN

Day Module Topics

1 1 Introduction, Evolution, Functional units of a computer

2 1 Arithmetic Circuits –Adder- Carry propagate adder, Ripple carry

adder

3 1 Basics of carry look ahead adder

4 1 Prefix adder

5 1 Subtractor, Comparator

6 1 ALU

7 1 Shifters and rotators

8 1 Multiplication

9 1 Division

10 1 Number System- Fixed Point

11 1 Floating Point IEEE single

12 1 Double precision, FP addition

13 2 Architecture – Assembly Language, Instructions, Operands

14 2 Registers, Register set, Memory, Constants

15 2 Machine Language –R-Type, I-Type, J-Type Instructions,

16 2 Interpreting Machine Language code

17 3 Addressing Modes – register only, immediate, base, PC-relative

18 3 Pseudo – direct

19 3

Steps for Executing a Program – Compilation, Assembling, Linking,

Loading

20 3 Pseudoinstuctions, Exceptions, Signed and Unsigned Instructions

21 3 Floating Point Instructions

23 4 Microarchitecture- design process

24 4 Single cycle processor, Single cycle data path, single cycle control

25 4 multi cycle processor, multi cycle data path, multi cycle control

26 5 Memory & I/O systems

27 5 I/O accessing techniques:

28 5 programmed, interrupt driven

Page 56: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 56

29 5 DMA, DMA bus arbitration

30 5 Memory Arrays – Bit Cells, Organization, Memory Ports

31 5 Memory types- DRAM, SRAM

32 5 Register Files, ROM

33 5 Memory – Hierarchy

34 5 Performance analysis

35 5 multi way set associate cache, Fully associate cache

36 5 Virtual Memory – Address Translation, Page Table

37 5 Translation Look aside Buffer,

38 5 Memory Protection, replacement polices

Page 57: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 57

6.3 SAMPLE QUESTIONS

1) Explain the following with neat diagrams

a) Ripple carry adder.

b) Subtractor

c) ALU

d) Comparator

2) a) Explain the R-type instruction format in MIPS with example (8)

b) Decode the given machine code (00AF8020)16 to MIPS assembly code (7)

3) a) Explain how floating point numbers are represented in computer‟s memory? (8)

b) In the following code segment, f, g, h, i, and j are variables. If the five variables f through j

correspond to the five registers $S0 through $S4, what is the compiled MIPS code for this C

statement?

If ( i = = j ) f = g + h; else f = g – h; (7)

4) a) Explain any 4 addressing modes of MIPS with examples (8)

b) What are Exceptions? How they are handled? (7)

5) Explain the datapath for add instruction in MIPS in single clock cycle implementation with

neat diagram. (15)

6) a) Explain the steps for executing a program. (7)

b) With the help of diagram and necessary control signals, explain multicycle implementation

scheme for R- type instruction. (8)

)

7) Draw the structure of memory hierarchy and explain different types of memories. (20)

8) Explain how a virtual address is translated into a physical address in virtual memory. What is

the role of TLB in address translation? (20)

9) a) Explain the various I/O accessing techniques (10)

b) Explain the different mapping techniques in cache (10

10.a). i) What is meant by a carry propagate adder? Give two examples of such adders.

(2 marks)

ii) Compare them in terms of circuit complexity, speed of operation etc…

(4 marks)

iii) Illustrate the difference in performance of an Arithmetic Right Shifter & a Logical

Right Shifter (2 marks)

b) i) Define the terms Architecture of a computer & Micro architecture. (2 marks)

ii) Illustrate the difference between assembly language & Machine language.

(2 marks)

iii) What are the Instruction formats supported by MIPS Instruction Set ? Illustrate

Page 58: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 58

using examples. (4 marks)

12 a) Translate the following R-type instruction into machine code.

i) add $s0, $s1, $s2 (3 marks)

ii) addi $so, $s1, 5 (3 marks)

b). Translate the following machine language code into assembly language.

0x02F34022 (4 marks)

c). Suppose that $s0 initially contains 0x23456789. After the following program is run

on a big-endian system, what value does the „$s0‟ contain? b) Consider the case in a littleendian

system?

sw $s0, 0($0)

lb $s0, 1($0) (4 marks)

13 a). i) Explain how a fixed point number system is different from a floating point number

system? (2 marks)

ii)Using manual methods perform the operation A x B and A / B on the 5-bit

unsigned numbers A = 10101 and B = 00101. (4 marks)

iii) Implement any one of the above operations using Hardware & explain it.

(8 marks)

14a). Briefly explain the steps involved in program execution. (8 Marks)

b) i. What is the difference in operation of a single cycle & Multi cycle processor?(2)

ii. Draw & explain the data path for an lw instruction in a Multi cycle processor.(6)

15. a). List the addressing modes of MIPS processor & explain each with an example(10)

b) Show the MIPS instructions that implement the following pseudo instructions. You may

use the assembler register, $at, but you may not corrupt (overwrite) any other registers.

(a) addi $t0, $2, imm31:0 (2 marks each)

( b) li $t5, imm31:0

16 a) .Explain briefly the control unit of a single cycle processor. (4 marks)

b). Determine the values of the control signals and the portions of the data path that are

used when executing an „R type’ instruction. (10 marks)

17 a. i). Explain briefly the different I/O accessing techniques. (3 marks)

ii). Illustrate the different DMA transfer types & Modes. (5 marks)

iii). What is Bus arbitration. Explain briefly. (2 marks)

b. i). What are the parameters used to measure the performance of a memory system.

Explain. (3 marks)

ii. What are the different cache organizations? Explain w.r.t MIPS Memory system.

(4 marks)

iii). Consider the following case of a system with 2048 cache blocks and 8192 main

memory blocks. Find where in the cache, will the main memory blocks MMB-15 be

placed for the mapping policies of :a) direct mapping, b) fully associative mapping, c)

4-way set associative. (3 marks)

3

18 a). Explain how reading & storing of data are performed in a DRAM cell and in a

SRAM cell. (6 marks)

b). Explain why refreshing is essential in DRAMs & not needed in SRAMs. (4 marks)

c). Illustrate how the bit cells are arranged in a 4 x 3 memory array, & explain how to

Page 59: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 59

read data & store data in such an array. (8 marks)

d) Differentiate between single-ported & Multi-ported Memory. (2 marks)

19. a). Define the term “Virtual Memory”. (2 marks)

b). Describe with suitable diagrams, how a logical address is converted to a physical

address by a memory management unit. (12 marks)

c). What action will the MMU take if it finds that a requested segment is not present

in physical memory? (4 marks)

d). What is the another major advantage of the indirect addressing provided by

20.descriptor tables, besides the ability to address a large amount of virtual memory? (4

Draw the diagram of a 16 bit Carry Lookahead Adder with 4 bit blocks. Write the

equation for the Generate Gi and Propagate Pi signals and show the circuit diagram of

the block. If the two input gate delay is 150 ps and the full adder delay is 300 ps what is

the delay for calculating the sum?

Draw the circuit of an ALU with control signal input Ctrl[2:0] to perform the following

operation on N bit inputs A and B: A + B, A – B, A AND B, A AND BBAR, A OR B,

A OR BBAR, A XOR B.

21. Show the steps to multiply two 4 bit binary numbers A = A0 A1 A2 A3 and B = B0 B1 B2

B3. Draw and explain the circuit for the hardware implementation of the multiplier.

Explain IEEE 754 floating point standard for (a) Single Precision and (b) Double

precision formats. Represent the numbers 6.875 and 9.625 in single precision format

22. Perform Floating Point addition on following two numbers in the IEEE 754 standard and show the result C0D20004 40DC0004

Draw the output table and the circuit diagram for the following 4 bit Shifters (a) Logical

Shift Left and (b) Arithmetic Shift Right . If the input value is 0xA what is the output

value from each of the above shifters?

Explain Big-Endian and Little-Ending formats for byte addressable memories. If word

address 0x0 has the data 0x12345678 what value would get into register $s0 if the

instruction lb $s0, 1($0) is executed in (a) Big-Endian machine and (b) Little-Endian

machine.

Page 60: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 60

Explain the R-Type, I-Type and J-Type Instruction formats. Give an example of each

type of instruction from the MIPS instruction set.

23. What are the five types of addressing modes in MIPS architecture? Describe each mode

with an example instruction to illustrate the usage.

24. What are steps involved in running a High Level Program (HLL) on a CPU ? Explain

what is the purpose, input and output of each step.

25. What are Pseudo instructions ? Show how the MIPS pseudo instructions clear, nop and

li $rs, imm32 are implemented

26. Draw the memory map for the MIPS processor. Explain what are the different segments

and their use.

27. What are exceptions ? Explain the different types. How are they handled in a MIPS CPU

?

28. How does a two pass assembler work ? Explain with a small assembly code sample of

your choice how the symbol table is created and used by the assembler.

29. Draw the data path diagram of a single cycle MIPS processor and explain how the sw

instruction is executed.

30. Calculate the cycle time for a single cycle processor to execute an instruction, with the

following delays in pico-seconds : register clk-to-Q = 30, register setup = 20,

multiplexer = 25, ALU = 250, memory read = 350, register file read = 180, register file

setup = 20

How long would it take to run a program with 100 million instructions on this

processor?

31. Explain how the control unit is used to generate the control signals for a single cycle

processor to execute an add instruction.

32. What are the state elements used to build up the datapath for a single cycle MIPS

processor ? Explain the working and purpose of each element.

Page 61: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 61

7

EC 207

ANALOG COMMUNICATION ENGINEERING

Page 62: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 62

7.1 COURSE INFORMATION SHEET

PROGRAMME: Electronics &

Communication Engineering

DEGREE: BTECH

COURSE: Analog Communication SEMESTER: 4 CREDITS: 3

COURSE CODE: EC208

REGULATION: 2016

COURSE TYPE: CORE

COURSE AREA/DOMAIN: Electronics CONTACT HOURS: 3 hours/Week.

CORRESPONDING LAB COURSE CODE

(IF ANY): EC332

LAB COURSE NAME: Communication

Engineering Lab

SYLLABUS:

UNIT DETAILS HOURS

I Introduction, elements of communication system, time and frequency

domains, Need for modulation.Noise in communication system, shot

noise, thermal noise, white noise, partition noise, flicker noise, burst

noise, signal to noise ratio, noise figure, noise temperature, narrow

band noise, representation in terms of in-phase and quadrature

components, envelope and phase components, sine wave plus narrow

band noise.

7 hrs.

II Amplitude modulation: Sinusoidal AM modulation index,

Average power, Effective voltage and current,

Nonsinusoidal modulation . Amplitude modulator

circuits, Amplitude demodulator circuit, AM transmitters

7hrs.

III AM Receiver, super heterodyne receiver, detector, tuning range, tracking,

sensitivity and gain, Image rejection, double conversion, adjacent channel

rejection, Automatic Gain Control (AGC). Single Sideband

Modulation,Principles, Balanced Modulators, Singly & Doubly Balanced

Modulators, SSB Generation, Filter Method, Phasing Method & Third

Method, SSB Reception, Modified SSB Systems , Pilot Carrier SSB &

ISB, Companded SSB.

9 hrs

IV Angle modulation: Frequency modulation, Sinusoidal FM, Frequency

spectrum, modulation index ,average power, Non-sinusoidal modulation,

deviation ratio, comparison of AM and FM .Phase modulation,

Equivalence between PM and FM, Sinusoidal Phase Modulation, Digital

Phase Modulation. Angle modulator Circuits : Varactor Diode

Modulators, Transistors Modulators, FM Transmitters: Direct & Indirect

Methods.

8 hrs.

V FM receiver, slope detector, balanced slope detector, Foster-Seeley

discriminator, Ratio Detector, Quadrature detector, PLL demodulator,

Automatic Frequency Control, Amplitude limiters, Pre-emphasis and De-

7 hrs.

Page 63: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 63

emphasis, Effect of noise in analog communication Systems- AM

Systems, DSBSC AM, SSB AM, Angle modulation, Threshold Effect in

Angle modulation.

V1 Telephone systems, standard telephone set, basic call procedures and

tones, DTMF, cordless telephones.

4 hrs.

TOTAL HOURS 42 hrs.

TEXT/REFERENCE BOOKS:

T/R BOOK TITLE/AUTHORS/PUBLICATION

1 Simon Haykin, Communication Systems, Wiley 4/e, 2006.

2 Tomasi, Electronic Communications System, Pearson, 5/e,2011.

3 Dennis Roody and John Coolen, Electronic Communication, Pearson, 4/e, 2011.

4 Tomasi,Advanced Electronic Communications Systems, Pearson, 6/e, 2012.

5 Taub ,Schilling, Saha,Principles of communication system,McGraw Hill,2013.

6 George Kennedy, ElectronicCommunication Systems, McGrawHill, 4/e, 2008.

7 Blake, Electronic Communication system, Cengage, 2/e , 2012.

.

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

EC205

EC205 Electronic circuits

Students should know analysis and

design of various analog circuits

S3

COURSE OBJECTIVES:

1 Introduce the basic concepts and types of modulation schemes.

2 To study different types of radio transmitters and receivers

3

To study the effects of noise in analog communication systems

COURSE OUTCOMES:

SNO DESCRIPTION

1 Students will be able to understand and apply the need for modulation

Page 64: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 64

and modulation techniques in a communication system

2 Students will be able to understand effect of noise in communication

system

3 Students will have sound knowledge and able to understand the radio

transmitters and receivers

4. Students will have sound knowledge of the working of a communication

system like the telephone system

CO-PO-PSO MAPPING:

CO No. Programme Outcomes (POs)

Programme-

specific

Outcomes (PSOs)

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 3 2 1 3 2

2 2 3

2 3 3 2

3 2

3 3 2 3

3

3

1

4 3 2 3

2

EC208

PO1 PO2 PO3 PO4 PO5 PO6 PO9 PO12 PSO1 PSO2 PSO3

CO1

Analog

modulation-

mathematical

background

Design of

Analog

modulaltors

Design of

analog

modulators

Simulate

circuits

using

MATLAB

Understanding

Radio

communication

Analog

communication

system design

System

simulationusing

programming

tools

CO2

Mathematical

background of

noise in

systems

Calculation of

transmitting

power of a

signal

Design of a

receiver in

communication

system

non-ideal

system design

CO3

Mathematical

background for

radio

communication

Design of

radio system

Design of radio

system

Understanding

of radio

systems

Page 65: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 65

CO4

Understanding

voice

communication

Understanding

of basic

DTMF and

cordless

systems

Basics of

telephony

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION

REQUIREMENTS:

SNO DESCRIPTION PROPOSED

ACTIONS

PO

MAPPING

1. Two –way mobile communication services Tutorials 1,3,6,7

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

SNO DESCRIPTION PO

MAPPING

1 Electronic space division switching 1,2,3

DESIGN AND ANALYSIS TOPICS:

Sl.

No.

DESCRIPTION PO MAPPING

1 Designing a Square Law Detector 2,3

2 Designing an Automatic Gain control Circuit 2,3

WEB SOURCE REFERENCES:

1. http://nptel.ac.in/courses/117102059/25

2. elearning.vtu.ac.in/10EC53.html

3. http://delptronics.com/ringmodulator.php

4 http://local.eleceng.uct.ac.za/courses/EEE3086F/notes/510-AM_VSB_2up.pdf

5 http://www.rfwireless-world.com/Tutorials/Telephone-system-tutorial.html

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

☐ CHALK & TALK ☐ STUD. ☐ WEB

Page 66: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 66

ASSIGNMENT RESOURCES

☐ LCD/SMART

BOARDS

☐ STUD.

SEMINARS

☐ ADD-ON

COURSES

ASSESSMENT METHODOLOGIES-DIRECT

☐ ASSIGNMENTS ☐ STUD.

SEMINARS

☐ TESTS/MODEL

EXAMS

☐ UNIV.

EXAMINATION

☐ STUD. LAB

PRACTICES

☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

CERTIFICATIONS

☐ ADD-ON

COURSES

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

☐ ASSESSMENT OF COURSE OUTCOMES

(BY FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON

FACULTY (TWICE)

☐ ASSESSMENT OF MINI/MAJOR

PROJECTS BY EXT. EXPERTS

☐ OTHERS

Prepared by Approved by

Dr.Deepti Das Krishna

Ms.Preethi Bhaskaran

HOD

Page 67: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 67

7.2 COURSE PLAN

Lecture Date Modules

1 Introduction to the course

Module -1

2 Elements of communication systems

3 Need for Modulation

4

Noise in communication systems - Thermal

Noise

5

Shot Noise, Partition Noise, Flicker Noise,

Burst Noise

6 Signal to Noise Ratio, Noise Factor

7 Noise Temperature, Problems

8

Review of Fourier Series and Fourier

Transform

Module - 2

9 Amplitude Modulation - Sinusoidal AM

10 Modulation index, Average power

11 Effective voltage and current

12 Non Sinusoidal modulation

13 Amplitude Modulator Circuits

14 Amplitude Demodulator Circuits

15 AM Transmitters

16 AM Transmitters

17 Noise in AM systems

18 Single Sideband Modulation: Principles

Module - 3

19

Balanced Modulators , Singly Balanced

Modulator

20 Doubly Balanced Modulators

21 SSB Generation - Filter Method

22 Phasign Method, Third Method

23 SSB Reception

24 Modified SSB systems

25 Pilot Carrier SSB & ISB

26 Companded SSB

27 Angle Modulation: Frequency Modulation

Module - 4

28 Sinusoidal FM, Modulation Index

29 Average power, Non sinusoidal modulation

30 Deviation ratio

31 Comparison of AM ad FM

32

AM and FM receivers: Super Heterodyne

Receivers

33 Tuning range, Sensitivity and gain

34 Image Rejection, Double Conversion

35 Adjacent Channel Selectivity

Page 68: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 68

36 Automatic Gain Control

37

Phase Modulation: Equivalence between PM

and FM

Module - 5

38 Sinusoidal Phase Modulation

39 Digital Phase Modulation

40

Angle Modulator Circuits: Varactor diode

modulators

41 Transistor Modulators

42 FM Transmitters: Direct Method

43 Indirect Method

44 Angle Modulation Detectors: Slope Detector

Module - 6

45 Balanced Slope Detector

46 Foster Seeley Discriminator, PLL Demodulator

47 Automatic Frequency Control (AFC)

48 Amplitude Limiters

49 Noise in FM systems

50 Pre-emphasis and De-emphasis

51 Telephone systems, Standard Telephone set

52 Basic call procedures and tones, DTMF

53 Cordless Telephones

Page 69: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 69

7.3 SAMPLE QUESTIONS

1. Define modulation. Why is modulation required?

2. Define is modulation index

3. Describe the DSB-SC wave modulation with spectrum?

4. Describe the detection of AM wave using a)square law detector b)envelope detector

5. Compare Square law detector with envelope detector?

6. Explain the detection of DSB-SC wave using a) synchronous Why frequency

translation is required?

7. Explain the generation of DSB-SC wave using a) balanced modulator b) ring

modulator

8. What is envelope distortion?

9. List the various types of modulations?

10. What are the Advantages of SSB systems?

11. Compare different AM systems?

12. List Application of different AM systems?

13. What is Hilbert Transform?

14. Draw the spectrum of SSB modulated signal?

15. Draw the spectrum of VSB modulated signal?

16. What are the methods for SSB generation?

17. What are the methods for SSB generation?

18. List Application of SSB?

19. Write the expression for SSB and VSB Waves.

20. What is Angle modulation? What are different types of Angle modulation?

21. Define PM & FM? What is frequency deviation & phase deviation?

22. Compare AM and FM?

23. What are Advantages & Applications of FM?

24. Explain the Phasor diagram of FM signals?

25. Plot FM wave taking modulating wave m(t) as a. Sine wave b. Square wave

26. Define is deviation ratio?

27. What is wideband FM & Narrowband FM?

28. State Carson‟s Rule?

29. Derive the equations for FM & PM waves?

30. Explain how noise affects performance of analog modulation systems?

31. Define figure of merit?

32. Discuss threshold effect

33. Explain threshold extension

34. Explain pre-emphasis &de-emphasis

35. Define Average noise figure.

36. Define Average Noise Temperature

37. List out various noise sources.

38. Define White noise and Shot noise.

Page 70: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 70

39. Write SNR expressions for FM and AM.

40. Define Sensitivity and Selectivity.

41. List the Classification of receivers.

42. Explain Super heterodyne working principle.

43. Define image frequency. Remember vii 5 Define Image frequency rejection ratio.

44. Compare Continuous wave and pulse modulation technique.

45. State Sampling Theorem.

46. Write Merits and Demerits of PAM.

47. Compare PAM,PPM,PWM.

48. List out the applications of pulse modulation techniques

49. Explain AM with necessary expressions, waveforms and spectrums,

50. The output power of an AM transmitter is 1KW when sinusoidally modulated to a

depth of 100%. Calculate the power in each side band when the modulation depth is

reduced to 50%.

51. Discuss the main objectives of a communication system design? What are the primary

resources of any communication system.

52. The RC load for a diode envelope detector consists of a 1000 pF capacitor in parallel

with a 10-K resistor. Calculate the maximum modulation depth that can be handled

for sinusoidal modulation at a frequency of 10 KHz if diagonal peak clipping is to be

avoided.

53. Sketch the one cycle of AM wave and calculate the modulation index of it in terms of

Vmax and Vmin voltages.

54. A modulating signal consists of a symmetrical triangular wave having zero dc

component and peak to peak voltage of 12V. It is used to amplitude modulate a carrier

of APPLY i peak voltage 10V.

55. Calculate the modulation index and the ratio of the side lengths L1/L2 of the

corresponding trapezoidal pattern.

56. Plot the one cycle of AM wave and calculate the modulation index of it in terms of

Vmax and Vmin voltages b) The rms antenna current of AM transmitter is 10A when

un -modulated and 12 A when sinusoidally modulated. Calculate the modulation

index.

57. Explain the collector modulation method for generating AM wave with a neat circuit

diagram and waveforms. b) An AM amplifier provides an output of 106 W at 100%

modulation. The internal loss is 20 W (i).What is un -modulated carrier power? (ii).

What is the side band power?

58. Write AM equation. Define modulation index, and percentage modulation. b) Define

under -modulation and over - modulation. Explain why over modulation is

undesirable.

59. Explain operation of square law detector with circuit diagram and waveforms. b) An

AM transmitter has un -modulated carrier power of 10 KW. It can be modulated by

sinusoidal modulating voltage to a maximum depth of 40%, without overloading. If

the maximum modulation index is reduced to 30%. What is the extent up to which the

unmodulated carrier power can be increased to avoid over loading.

Page 71: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 71

60. Sketch the one cycle of AM wave and calculate the modulation index of it in terms of

Vmax and Vmin voltages.

61. Define communication. Explain with block diagram the basic communication

system.Write about modern communication system. b) A carrier wave of frequency

10 MHz and peak value of 10 V is amplitude modulated by a 5 KHz sine wave of

amplitude 6 V. Determine the modulation index and draw the one sided spectrum of

modulated wave.

62. Explain about the quadrature null effect of coherent detect . b) In DSB -SC,

suppression of carrier so as to save transmitter power results in receiver complexity -

Justify this statement

63. Describe the time domain band -pass representation of SSB with necessary sketches.

b) Find the percentage of power saved in SSB when compared with AM system.

64. Why VSB system is widely used for TV broadcasting - Explain? b) An AM

transmitter of 1KW power is fully modulated. Calculate the power transmitted if it is

transmitted as SSB.

65. Describe the single tone modulation of SSB. Assume both modulating and carrier

signals are sinusoids. Write SSB equation and plot all the waveforms and spectrums.

66. Explain the Third method of generating SSB modulated waves. b) Explain the

coherent detection of SSB signals.

67. Explain about Diagonal Clipping in a diode detector. How to avoid it? b)A

45Volts(rms) sinusoidal carrier is amplitude modulated by a 30Volts(rms) sinusoidal

base band signal. Find the Modulation index of the resulting signal.

68. Calculate the filter requirement to convert DSB signal to SSB Signal, given that the

two side bands are separated by 200HZ. The suppressed carrier is 29MHZ.

69. Explain the envelope detection of VSB wave plus carrier. b) Calculate the percentage

power saving when the carrier and one of the sidebands are suppressed in an AM

wave modulated to a depth of i. 100 % ii. 50 %

70. An angle modulated signal has the form v(t) = 100 cos(2πfct+4 sin 2000 πt) when fc

=10 MHz i. Determine average transmitted power. ii. Determine peak phase

deviation. iii. Determine the peak frequency deviation iv. Is this an FM or a PM

signal? Explain.

71. Explain about FM generation using transistor reactance modulator. b) Explain

balanced ratio detector for detecting FM signal.

72. Give the procedure to determine the effective bandwidth of an signal FM b) Which

method of FM signal generation is the preferred choice, when the stability of the

carrier frequency is of major concern? Discuss about the method in detail.

73. Compute the bandwidth requirement for the transmission of FM signal having a

frequency deviation 75 KHz and an audio bandwidth of 10KHz. b) An FM radio link

has a frequency deviation of 30 kHz. The modulating frequency is 3 kHz. Calculate

the bandwidth needed for the link. What will be the bandwidth if the deviation is

reduced to 15 kHz?

74. Explain the operation of limiter circuit in fm demodulation. b) An FM radio link has a

frequency deviation of 30 kHz. The modulating frequency is 3KHz. Calculate the

bandwidth needed. What will be the bandwidth if the deviation is reduced to 15 kHz?

Page 72: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 72

75. . Determine the amplitude spectrum of the filter output for FM wave with modulation

index β = 1 is transmitted through an ideal band pass filter with mid band frequency

fc and bandwidth is 5fm, where fc is the carrier frequency and fm is the frequency of

the sinusoidal modulating wave.

76. Explain the working of zero crossing detector b) Compare frequency modulation with

amplitude modulation.

77. Explain the noise performance of SSB - SC receiver and prove its S/N Ratio is unity.

78. Derive the expression for the S/N ratio of AM system. b) Compare noise performance

of PM and FM system

79. Explain the noise performance of DSB -SC scheme with the help of block diagram

80. . Prove that the figure of merit of AM system for single tone modulation with 100%

modulation is 1/3.

81. Derive the expression for figure of merit of AM system for large value of modulation

index(m>1).

Page 73: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 73

8

EC 232

ANALOG INTEGRATED CIRCUIT LAB

Page 74: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 74

8.1 COURSE INFORMATION SHEET

PROGRAMME: Electronics and Communication

Engineering

DEGREE: B.Tech

COURSE: ANALOG INTEGRATED CIRCUITS

LAB

SEMESTER: 4 CREDITS: 1

COURSE CODE: EC232 REGULATION: 2016 COURSE TYPE: CORE

COURSE AREA/DOMAIN: ANALOG

INTEGRATED CIRCUITS

CONTACT HOURS: 3 hours /Week.

CORRESPONDING LAB COURSE CODE (IF

ANY): N.A

LAB COURSE NAME: N.A

SYLLABUS:

UNIT DETAILS HOURS

1. Familiarization of Operational amplifiers - Inverting and Non inverting amplifiers,

frequency response, Adder, Integrator, comparators

3

2. Measurement of Op-Amp parameters.

3

3. Difference Amplifier and Instrumentation amplifier

3

4. Schmitt trigger circuit using Op –Amps

3

5. Astable and Monostable multivibrator using Op -Amps

3

6. Timer IC NE555

3

7. Triangular and square wave generators using Op- Amps

3

8. Wien bridge oscillator using Op-Amp - without & with amplitude stabilization

3

9. RC Phase shift Oscillator

3

10. Precision rectifiers using Op-Amp

3

11. Active second order filters using Op-Amp (LPF, HPF, BPF and BSF).

3

12. Notch filters to eliminate the 50Hz power line frequency

3

13. IC voltage regulators

3

14. A/D converters- counter ramp and flash type.

3

15. D/A Converters- ladder circuit

3

16. Study of PLL IC: free running frequency lock range capture range

3

TOTAL HOURS N.A

TEXT/REFERENCE BOOKS:

T/R BOOK TITLE/AUTHORS/PUBLICATION

1. Franco S., Design with Operational Amplifiers and Analog Integrated Circuits, 3/e, Tata McGraw Hill, 2008

2. David A. Bell, Operational Amplifiers & Linear ICs, Oxford University Press, 2ndedition, 2010

3. R.F. Coughlin & Fredrick Driscoll, Operational Amplifiers & Linear Integrated Circuits, 6th Edition, PHI,2001

4. C.G. Clayton, Operational Amplifiers, Butterworth & Company Publ. Ltd./ Elsevier, 1971.

5. Electronics Circuit Analysis and Design/ Neeman D.A/ Tata McGraw Hill

6. Microelectronic Circuits/Sedra A S and Smith K C/Oxford University Press

Page 75: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 75

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

Analog Integrated Circuits

Knowledge of analog ICs 4

COURSE OBJECTIVES:

1 To acquire skills in designing and testing analog integrated circuits

2 To expose the students to a variety of practical circuits using various analog ICs

COURSE OUTCOMES:

SNO DESCRIPTION

1 Student should be able to design and demonstrate functioning of various analog circuits

2 Student should be able to analyze and design various applications of analog circuits

CO-PO-PSO MAPPING:

Programme Outcomes (POs) Programme-specific

Outcomes (PSOs)

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 2 2 2 1 2 2 1

2 3 2 3 1 2 3 1

EC0110 5 4 5 2 4 5 2

JUSTIFICATION FOR CO-PO-PSO CORRELATION:

PO1 PO2 PO3 PO4 PO5 PSO1 PSO2

CO1 Analog circuits can be

designed and modified to

provide

solutions to real-l ife

problems

Design & demonstration

of experiments will help to

identify the problems and

lead to modifications

Design of basic analog circuits

Team work required for

designing & demonstration

of circuits

Designing enhances

engineering skil ls

Design & demonstration

of analog circuits involves circuit

implementation, testing & troubleshooting

With prior knowledge of

EDA tools, students can use their

knowledge to simulate, experiment & develop newer

applications

CO2 IC circuits can be used in a

wide-range of

applications l ike

communication,

instrumentation etc.

Design & analysis of analog IC

circuits

A wide range of application

can be

developed using linear

ICs. Everyday electronics

makes use of ICs extensively

Group work is essential for

all the

activities so as to draw

meaningful inferences

Design & analysis are

key to

engineering

With prior knowledge of

EDA tools,

students can use their

knowledge to simulate,

experiment & develop newer applications

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION

REQUIREMENTS:

SNO DESCRIPTION PROPOSED

ACTIONS

Page 76: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 76

1 (Not identified) (N. A.)

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

1 Design of VCO using IC 566

2. Verification of Sampling Theorem

2. Hobby circuits to practice

WEB SOURCE REFERENCES:

1 /www.coursera.org/learn/electronics

2 https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-002-circuits-and-electronics-

spring-2007/

3 http://www.nptel.ac.in/courses/Webcourse-contents/IIT-ROORKEE/Analog%20circuits/index.htm

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK STUD. ASSIGNMENT ☐ WEB RESOURCES

☐ LCD/SMART BOARDS ☐ STUD. SEMINARS ☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL EXAMS ☐ UNIV. EXAMINATION

☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS

☐ ADD-ON COURSES ☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE) ☐ STUDENT FEEDBACK ON FACULTY

☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS ☐ OTHERS

Prepared by Approved by

Ms. Sabna N

Dr. Jos Prakash

Mr. Ajai V Babu (HOD)

Page 77: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 77

8.2 COURSE PLAN

Measurement of op-amp parameters

Familiarization of Operational amplifiers

Difference Amplifier and Instrumentation amplifier

Schmitt trigger circuit using Op –Amps

Astable and Monostable multivibrator using Op –Amps

Triangular, sawtooth and square wave generators using Op-

Amps

Wien bridge oscillator using Op-Amp

RC Phase shift Oscillator

Active second order filters using Op-Amp

Notch filters

Timer IC NE555

IC voltage regulators

Study of PLL IC

D/A Converters

A/D converters

Page 78: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 78

8.3 SAMPLE QUESTIONS

1. Obtain the following transfer characteristics.

2. Obtain the following transfer characteristics

Page 79: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 79

3. Generate the waveform.

4. Generate a pulse waveform of frequency 1 KHz and 50% duty cycle.

5. Design and setup a filter with roll off rate = 60 dB/decade.

6. Design and setup a filter with roll off rate = -40 dB/decade.

Page 80: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 80

7. Design and setup a filter with roll off rate = 40 dB/decade, which blocks all the signals of

frequency less than 2 KHz and greater than 6 KHz.

8. Realize the expression, y=5x + dx/dt + 4 ; x=sin (2000πt).

9. Realize the expression, y= - (5x + ⌡x dx + 4) ; x=2sin (2000πt).

10. Generate the waveform,

Page 81: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 81

11. Generate the waveform,

12. Generate the waveform,

Page 82: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 82

13. Generate the waveform,

14. Generate the waveform

15. Generate the waveform

Page 83: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 83

16. Generate the waveform,

Page 84: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 84

17. Generate the waveform,

Page 85: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 85

18. Obtain the following transfer characteristics

19. Generate the waveform

Page 86: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 86

20. Generate the waveform

Page 87: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 87

1. Generate the waveform,

2. Generate the waveform

Page 88: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 88

3.Generate the waveform

Page 89: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 89

4.Generate the waveform

5. Generate the waveform

Page 90: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 90

6.Generate the waveform

7. Generate the waveform

Page 91: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 91

8. A bulb at the railway station will be switched ON at 9am by the Station Master. It should be

switched OFF at 9.12am automatically. Design and setup a circuit to operate the bulb.

9. Design and setup a logic circuit to glow an LED four times at every minutes.

10. Design and setup a logic circuit to glow an LED three times at every alternate minutes.

Page 92: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 92

9

EC 230

LOGIC CIRCUIT DESIGN LAB

Page 93: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 93

9.1 COURSE INFORMATION SHEET

PROGRAMME: Electronics and Communication

Engineering

DEGREE: B.Tech

COURSE: ANALOG INTEGRATED CIRCUITS

LAB

SEMESTER: 4 CREDITS: 1

COURSE CODE: EC232 REGULATION: 2016 COURSE TYPE: CORE

COURSE AREA/DOMAIN: ANALOG

INTEGRATED CIRCUITS

CONTACT HOURS: 3 hours /Week.

CORRESPONDING LAB COURSE CODE (IF

ANY): N.A

LAB COURSE NAME: N.A

SYLLABUS:

UNIT DETAILS HOURS

17. Familiarization of Operational amplifiers - Inverting and Non inverting amplifiers, frequency response, Adder, Integrator, comparators

3

18. Measurement of Op-Amp parameters.

3

19. Difference Amplifier and Instrumentation amplifier

3

20. Schmitt trigger circuit using Op –Amps

3

21. Astable and Monostable multivibrator using Op -Amps

3

22. Timer IC NE555

3

23. Triangular and square wave generators using Op- Amps

3

24. Wien bridge oscillator using Op-Amp - without & with amplitude stabilization

3

25. RC Phase shift Oscillator

3

26. Precision rectifiers using Op-Amp

3

27. Active second order filters using Op-Amp (LPF, HPF, BPF and BSF).

3

28. Notch filters to eliminate the 50Hz power line frequency

3

29. IC voltage regulators

3

30. A/D converters- counter ramp and flash type.

3

31. D/A Converters- ladder circuit

3

32. Study of PLL IC: free running frequency lock range capture range

3

TOTAL HOURS N.A

TEXT/REFERENCE BOOKS:

T/R BOOK TITLE/AUTHORS/PUBLICATION

1. Franco S., Design with Operational Amplifiers and Analog Integrated Circuits, 3/e, Tata McGraw

Hill, 2008

2. David A. Bell, Operational Amplifiers & Linear ICs, Oxford University Press, 2ndedition, 2010

3. R.F. Coughlin & Fredrick Driscoll, Operational Amplifiers & Linear Integrated Circuits, 6th Edition, PHI,2001

4. C.G. Clayton, Operational Amplifiers, Butterworth & Company Publ. Ltd./ Elsevier, 1971.

5. Electronics Circuit Analysis and Design/ Neeman D.A/ Tata McGraw Hill

6. Microelectronic Circuits/Sedra A S and Smith K C/Oxford University Press

Page 94: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 94

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

Analog Integrated Circuits

Knowledge of analog ICs 4

COURSE OBJECTIVES:

1 To acquire skills in designing and testing analog integrated circuits

2 To expose the students to a variety of practical circuits using various analog ICs

COURSE OUTCOMES:

SNO DESCRIPTION

1 Student should be able to design and demonstrate functioning of various analog circuits

2 Student should be able to analyze and design various applications of analog circuits

CO-PO-PSO MAPPING:

Programme Outcomes (POs) Programme-specific

Outcomes (PSOs)

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

1 2 2 2 1 2 2 1

2 3 2 3 1 2 3 1

EC0110 5 4 5 2 4 5 2

JUSTIFICATION FOR CO-PO-PSO CORRELATION:

PO1 PO2 PO3 PO4 PO5 PSO1 PSO2

CO1 Analog circuits can be

designed and modified to

provide

solutions to real-l ife

problems

Design & demonstration

of experiments will help to

identify the problems and

lead to modifications

Design of basic analog circuits

Team work required for

designing & demonstration

of circuits

Designing enhances

engineering skil ls

Design & demonstration

of analog circuits involves circuit

implementation, testing & troubleshooting

With prior knowledge of

EDA tools, students can use their

knowledge to simulate, experiment & develop newer

applications

CO2 IC circuits can be used in a

wide-range of

applications l ike

communication,

instrumentation etc.

Design & analysis of analog IC

circuits

A wide range of application

can be

developed using linear

ICs. Everyday electronics

makes use of ICs extensively

Group work is essential for

all the

activities so as to draw

meaningful inferences

Design & analysis are

key to

engineering

With prior knowledge of

EDA tools,

students can use their

knowledge to simulate,

experiment & develop newer applications

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION

REQUIREMENTS:

SNO DESCRIPTION PROPOSED

ACTIONS

Page 95: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 95

1 (Not identified) (N. A.)

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

1 Design of VCO using IC 566

2. Verification of Sampling Theorem

2. Hobby circuits to practice

WEB SOURCE REFERENCES:

1 /www.coursera.org/learn/electronics

2 https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-002-circuits-and-electronics-

spring-2007/

3 http://www.nptel.ac.in/courses/Webcourse-contents/IIT-ROORKEE/Analog%20circuits/index.htm

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK STUD. ASSIGNMENT ☐ WEB RESOURCES

☐ LCD/SMART BOARDS ☐ STUD. SEMINARS ☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL EXAMS ☐ UNIV. EXAMINATION

☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS

☐ ADD-ON COURSES ☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE) ☐ STUDENT FEEDBACK ON FACULTY

☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS ☐ OTHERS

Prepared by Approved by

Ms. Sabna N

Dr. Jos Prakash

Mr. Ajai V Babu (HOD)

Page 96: COURSE HAND-OUT B.TECH. - SEMESTER IV … Hand-out-KTU.pdf · V Sundarapandian , Probability, Statistics and Queuing theory, Third Edition, PHI Learning ... AND QUEUING THEORY CREDITS:4

Semester IV, Course Hand-Out

Department of EC, RSET 96

9.2 COURSE PLAN

Day Topic

1

REALIZATION OF FUNCTIONS

USING BASIC & UNIVERSAL

GATES

2

To design and realize half adder and

full adder using basic gates and

universal gates.

3

To design and realize half subtractor

and full subtractor using basic gates

and universal gates.

4

4 BIT ADDER/SUBTRACTOR AND

BCD ADDER USING 7483 IC

5 2 BIT COMPARATOR

6

To setup and design a 4 bit gray to

binary and binary to gray code

converter.

7

REALIZATION OF FLIP-FLOPS

USING NAND GATES

8

To set up a four bit binary ripple

counter and to study its working as an

up and down counter.

9

4 BIT SYNCHRONOUS UP/DOWN

COUNTER ,RING&JOHNSON

counter

10

Multiplexers & Demultiplexer's using

gates and ICs (74150 and 74154)

11

combinational circuits using MUX &

DEMUX

12 Lab Exam