EE 8591 DIGITAL SIGNAL PROCESSING

MCQ
1. The system described by the aequation y(n)=ay(n-1)+b x(n) is a recursive system.
a) True
b) False
View Answer
Answer: a
Explanation: Since the present output depends on the value of the previous output, the system is called a Recursive
system.

2. To implement the linear time invariant recursive system described by the difference equation
y(n)=−∑Nk=1aky(n−k)+∑Mk=0bkx(n−k) in Direct form-I, how many number of delay elements and multipliers
are required respectively?
a) M+N+1, M+N
b) M+N-1, M+N
c) M+N, M+N+1
d) None of the mentioned
View Answer
Answer: c
Explanation: From the given equation, there are M+N delays, so it requires M+N number of delay elements and it has to
perform M+N+1 multiplications, so it require that many number of multipliers.

3. Which of the following linear time invariant system is a purely recursive system?
a) y(n) = −∑Nk=1aky(n−k)+∑Mk=0bkx(n−k)
b) y(n) = ∑Nk=1aky(n−k)+∑Mk=0bkx(n−k)
c) y(n) = −∑Nk=1aky(n−k)−∑Mk=0bkx(n−k)
d) y(n) = −∑Nk=1aky(n−k)+b0x(n)
View Answer
Answer: d
Explanation: Since the output of the system depend only on the past values of output and the present value of the input,
the system is called as “purely recursive” system.

4. Which of the following is the difference equation of a special case of FIR system?
a) y(n) = ∑Mk=0bkx(n−k)
b) y(n) = a0y(n)−∑Nk=1aky(n−k)
c) y(n) = −∑Nk=1aky(n−k)
d) None of the mentioned
View Answer
Answer: a
Explanation: If the coefficients of the past values of the output in the difference equation of the system, then the system
is said to be FIR system.

5. What is the system does the following direct form structure represents?

a) FIR system
b) Purely recursive system
c) General second order system
d) None of the mentioned
View Answer
Answer: b
Explanation: Since the output of the system depends only on the present value of the input and the past values of the
output, the system is a purely recursive system.

6. What is the output of the system represented by the following direct form?

a) y(n)=-a1y(n-1)-a2y(n-2)- b0x(n)-b1x(n-1)-b2x(n-2)
b) y(n)=-a1y(n-1)-a2y(n-2)+b0x(n)
c) y(n)=-a1y(n-1)-a2y(n-2)+ b0x(n)+b1x(n-1)+b2x(n-2)
d) y(n)=a1y(n-1)+a2y(n-2)+ b0x(n)+b1x(n-1)+b2x(n-2)
View Answer
Answer: c
Explanation: The equation of the difference equation of any system is defined as
y(n)=−∑Nk=1aky(n−k)+∑Mk=0bkx(n−k)
In the given diagram, N=M=2
So, substitute the values of the N and M in the above equation.
We get, y(n)=-a1y(n-1)-a2y(n-2)+b0x(n)+b1x(n-1)+b2x(n-2)

7. The system represented by the following direct form structure is:

a) General second order system

b) Purely recursive system
c) Partial recursive system
d) FIR system
View Answer
Answer: d
Explanation: The output of the system according to the direct form given is
y(n)= b0x(n)+b1x(n-1)+b2x(n-2)
Since the output of the system is purely dependent on the present and past values of the input, the system is called as
FIR system.

8. An FIR system is also called as “recursive system”.

a) True
b) False
View Answer
Answer: b
Explanation: For a system to be recursive, the output of the system must be dependent only on the past values of the
output. For an FIR system the output of the system must be depending only on the present and past values of the input.
So, FIR system is not an recursive system.

9. What is the form of the FIR system to compute the moving average of the signal x(n)?
a) y(n)=1M+1∑Mk=0x(n−k)
b) y(n)=1M+1∑Mk=0x(n+k)
c) y(n)=1M+1∑∞k=0x(n−k)
d) None of the mentioned
View Answer
Answer: a
Explanation: A normal FIR non-recursive system with the impulse response h(n)= 1M+1 is the system which is used to
compute the moving average of a signal x(n).

10. Which of the following is a recursive form of a non-recursive system described by the equation
y(n)=1M+1∑Mk=0x(n−k)?
a) y(n)=y(n-1)+1M+1[x(n)+x(n-1-M)]
b) y(n)=y(n-1)+1M+1[x(n)+x(n-1+M)]
c) y(n)=y(n-1)+1M+1[x(n)-x(n-1+M)]
d) y(n)=y(n-1)+1M+1[x(n)-x(n-1-M)]
View Answer
Answer: d
Explanation: The given system equation is y(n)= 1M+1∑Mk=0x(n−k)
It can be expressed as follows
y(n)=1M+1∑Mk=0x(n−1−k)+1M+1[x(n)−x(n−1−M)]
=y(n−1)+1M+1[x(n)−x(n−1−M)]

11. The system described by the equation y(n)=ay(n+1)+b x(n) is a recursive system.
a) True
b) False
View Answer
Answer: b
Explanation: Since the present output depends on the value of the future output, the system is not called a Recursive
system.
Discrete Time Signals

1. If x(n) is a discrete-time signal, then the value of x(n) at non integer value of ‘n’ is?
a) Zero
b) Positive
c) Negative
d) Not defined
View Answer
Answer: d
Explanation: For a discrete time signal, the value of x(n) exists only at integral values of n. So, for a non- integer value
of ‘n’ the value of x(n) does not exist.

2. The discrete time function defined as u(n)=n for n≥0;u(n)=0 for n<0 is an _____________
a) Unit sample signal
b) Unit step signal
c) Unit ramp signal
d) None of the mentioned
View Answer
Answer: c
Explanation: When we plot the graph for the given function, we get a straight line passing through origin with a unit
positive slope. So, the function is called a unit ramp signal.

3. The phase function of a discrete time signal x(n)=a n, where a=r.ejθ is?

a) tan(nθ)
b) nθ
c) tan-1(nθ)
d) none of the mentioned
View Answer
Answer: b
Explanation: Given x(n)=an=(r.ejθ)n = rn.ejnθ
=>x(n)=rn.(cosnθ+jsinnθ)
Phase function is tan-1(cosnθ/sinnθ)=tan-1(tan nθ)=nθ.

4. The signal given by the equation ∑∞n=−∞|x(n)|2 is known as __________

a) Energy signal
b) Power signal
c) Work done signal
d) None of the mentioned
View Answer
Answer: a
Explanation: We have used the magnitude-squared values of x(n), so that our definition applies to complex-valued as
well as real-valued signals. If the energy of the signal is finite i.e., 0<E<∞ then the given signal is known as Energy
signal.

5. x(n)*δ(n-k)=?
a) x(n)
b) x(k)
c) x(k)*δ(n-k)
d) x(k)*δ(k)
View Answer
Answer: c
Explanation: The given signal is defined only when n=k by the definition of delta function. So, x(n)*δ(n-k)= x(k)*δ(n-k).

6. A real valued signal x(n) is called as anti-symmetric if ___________

a) x(n)=x(-n)
b) x(n)=-x(-n)
c) x(n)=-x(n)
d) none of the mentioned
View Answer
Answer: b
Explanation: According to the definition of anti-symmetric signal, the signal x(n) should be symmetric over origin. So, for
the signal x(n) to be symmetric, it should satisfy the condition x(n)=-x(-n).

7. The odd part of a signal x(t) is?

a) x(t)+x(-t)
b) x(t)-x(-t)
c) (1/2)*(x(t)+x(-t))
d) (1/2)*(x(t)-x(-t))
View Answer
Answer: d
Explanation: Let x(t)=xe(t)+xo(t)
=>x(-t)=xe(-t)-xo(-t)
By subtracting the above two equations, we get
xo(t)=(1/2)*(x(t)-x(-t)).

8. Time scaling operation is also known as ___________

a) Down-sampling
b) Up-sampling
c) Sampling
d) None of the mentioned
View Answer
Answer: a
Explanation: If the signal x(n) was originally obtained by sampling a signal xa(t), then x(n)=xa(nT). Now, y(n)=x(2n)
(say)=xa(2nT). Hence the time scaling operation is equivalent to changing the sampling rate from 1/T to 1/2T, that is to
decrease the rate by a factor of 2. So, time scaling is also called as down-sampling.

9. What is the condition for a signal x(n)=Brn where r=eαT to be called as an decaying exponential signal?
a) 0<r<∞
b) 0<r<1
c) r>1
d) r<0
View Answer
Answer: b
Explanation: When the value of ‘r’ lies between 0 and 1 then the value of x(n) goes on decreasing exponentially with
increase in value of ‘n’. So, the signal is called as decaying exponential signal.

10. The function given by the equation x(n)=1, for n=0; x(n)=0, for n≠0 is a _____________
a) Step function
b) Ramp function
c) Triangular function
d) Impulse function
View Answer
Answer: d
Explanation: According to the definition of the impulse function, it is defined only at n=0 and is not defined elsewhere
which is as per the signal given.

Discrete Time Systems

1. The output signal when a signal x(n)=(0,1,2,3) is processed through an ‘Identical’ system is?
a) (3,2,1,0)
b) (1,2,3,0)
c) (0,1,2,3)
d) None of the mentioned
View Answer
Answer: c
Explanation: An identical system is a system whose output is same as the input, that is it does not perform any
operation on the input and transmits it.

2. If a signal x(n) is passed through a system to get an output signal of y(n)=x(n+1), then the signal is said to be
____________
a) Delayed
b) Advanced
c) No operation
d) None of the mentioned
View Answer
Answer: d
Explanation: For example, the value of the output at the time n=0 is y(0)=x(1), that is the system is advanced by one
unit.

3. If the output of the system is y(n)=∑nk=−∞x(y) with an input of x(n) then the system will work as ___________
a) Accumulator
b) Adder
c) Subtractor
d) Multiplier
View Answer
Answer: a
Explanation: From the equation given, y(n)=x(n)+x(n-1)+x(n-2)+…. .This system calculates the running sum of all the
past input values till the present time. So, it acts as an accumulator.

4. What is the output y(n) when a signal x(n)=n*u(n)is passed through a accumulator system under the conditions that it
is initially relaxed?
a) n2+n+12
b) n(n+1)2
c) n2+n+22
d) None of the mentioned
View Answer
Answer: b
Explanation: Given that the system is initially relaxed, that is y(-1)=0
According to the equation of the accumulator,
y(n)=∑nk=−∞x(n)
=∑−1k=−∞x(n)+∑nk=0x(n)
=y(−1)+∑nk=0n∗u(n)
=0+∑nk=0n(since u(n)=1 in 0 to n)
=n(n+1)2

5. The block denoted as follows is known as __________

a) Delay block
b) Advance block
c) Multiplier block
d) Adder block
View Answer
Answer: a
Explanation: If the function to this block is x(n) then the output from the block will be x(n-1). So, the block is called as
delay block or delay element.

6. The output signal when a signal x(n)=(0,1,2,3) is processed through an ‘Delay’ system is?
a) (3,2,1,0)
b) (1,2,3,0)
c) (0,1,2,3)
d) None of the mentioned
View Answer
Answer: b
Explanation: An delay system is a system whose output is same as the input, but after a delay.

7. The system described by the input-output equation y(n)=nx(n)+bx 3(n) is a __________

a) Static system
b) Dynamic system
c) Identical system
d) None of the mentioned
View Answer
Answer: a
Explanation: Since the output of the system y(n) depends only on the present value of the input x(n) but not on the past
or the future values of the input, the system is called as static or memory-less system.

8. Whether the system described by the input-output equations y(n)=x(n)-x(n-1) a Time-variant system.
a) True
b) False
View Answer
Answer: b
Explanation: If the input is delayed by k units then the output will be y(n,k)=x(n-k)-x(n-k-1)
If the output is delayed by k units then y(n-k)=x(n-k)-x((n-k)-1)
=>y(n,k)=y(n-k). Hence the system is time-invariant.

9. The system described by the input-output equations y(n)=x 2(n) is a Non-linear system.
a) True
b) False
View Answer
Answer: a
Explanation: Given equation is y(n)=x2(n)
Let y1(n)=x12(n) and y2(n)=x22(n)
y3(n)=y1(n)+y2(n)= x12(n)+ x22(n)≠(x1(n)+x2(n))2
So the system is non-linear.

10. If the output of the system of the system at any ‘n’ depends only the present or the past values of the inputs then the
system is said to be __________
a) Linear
b) Non-Linear
c) Causal
d) Non-causal
View Answer
Answer: c
Explanation: A system is said to be causal if the output of the system is defined as the function shown below
y(n)=F[x(n),x(n-1),x(n-2),…] So, according to the conditions given in the question, the system is a causal system.

11. The system described by the input-output equations y(n)=x(-n) is a causal system.
a) True
b) False
View Answer
Answer: b
Explanation: For n=-1, y(-1)=x(1)
That is, the output of the system at n=-1 is depending on the future value of the input at n=1. So the system is a non-
causal system.

12. If a system do not have a bounded output for bounded input, then the system is said to be __________
a) Causal
b) Non-causal
c) Stable
d) Non-stable
View Answer
Answer: d
Explanation: An arbitrary relaxed system is said to be BIBO stable if it has a bounded output for every value in the
bounded input. So, the system given in the question is a Non-stable system.

Classification of Signals
1. Which of the following is done to convert a continuous time signal into discrete time signal?
a) Modulating
b) Sampling
c) Differentiating
d) Integrating
View Answer
Answer: b
Explanation: A discrete time signal can be obtained from a continuous time signal by replacing t by nT, where T is the
reciprocal of the sampling rate or time interval between the adjacent values. This procedure is known as sampling.

2. The deflection voltage of an oscilloscope is a ‘deterministic’ signal.

a) True
b) False
View Answer
Answer: a
Explanation: The behavior of the signal is known and can be represented by a saw tooth wave form. So, the signal is
deterministic.

3. The even part of a signal x(t) is?

a) x(t)+x(-t)
b) x(t)-x(-t)
c) (1/2)*(x(t)+x(-t))
d) (1/2)*(x(t)-x(-t))
View Answer
Answer: c
Explanation: Let x(t)=xe(t)+xo(t)
=>x(-t)=xe(-t)-xo(-t)
By adding the above two equations, we get
xe(t)=(1/2)*(x(t)+x(-t)).

4. Which of the following is the odd component of the signal x(t)=e(jt)?

a) cost
b) j*sint
c) j*cost
d) sint
View Answer
Answer: b
Explanation: Let x(t)=e(jt)
Now, xo(t)=(1/2)*(x(t)-x(-t))
=(1/2)*(e(jt) – e(-jt))
=(1/2)*(cost+jsint-cost+jsint)
=(1/2)*(2jsint)
=j*sint.

5. For a continuous time signal x(t) to be periodic with a period T, then x(t+mT) should be equal to ___________
a) x(-t)
b) x(mT)
c) x(mt)
d) x(t)
View Answer
Answer: d
Explanation: If a signal x(t) is said to be periodic with period T, then x(t+mT)=x(t) for all t and any integer m.

6. Let x1(t) and x2(t) be periodic signals with fundamental periods T1 and T2 respectively. Which of the following must be
a rational number for x(t)=x1(t)+x2(t) to be periodic?
a) T1+T2
b) T1-T2
c) T1/T2
d) T1*T2
View Answer
Answer: c
Explanation: Let T be the period of the signal x(t)
=>x(t+T)=x1(t+mT1)+x2(t+nT2)
Thus, we must have
mT1=nT2=T
=>(T1/T2)=(k/m)= a rational number.

7. Let x1(t) and x2(t) be periodic signals with fundamental periods T1 and T2 respectively. Then the fundamental period of
x(t)=x1(t)+x2(t) is?
a) LCM of T1 and T2
b) HCF of T1and T2
c) Product of T1 and T2
d) Ratio of T1 to T2
View Answer
Answer: a
Explanation: For the sum of x1(t) and x2(t) to be periodic the ratio of their periods should be a rational number, then the
fundamental period is the LCM of T1 and T2.

8. All energy signals will have an average power of ___________

a) Infinite
b) Zero
c) Positive
d) Cannot be calculated
View Answer
Answer: b
Explanation: For any energy signal, the average power should be equal to 0 i.e., P=0.

9. x(t) or x(n) is defined to be an energy signal, if and only if the total energy content of the signal is a ___________
a) Finite quantity
b) Infinite
c) Zero
d) None of the mentioned
View Answer
Answer: a
Explanation: The energy signal should have a total energy value that lies between 0 and infinity.

10. What is the period of cos2t+sin3t?

a) pi
b) 2*pi
c) 3*pi
d) 4*pi
View Answer
Answer: b
Explanation: Period of cos2t=(2*pi)/2=pi
Period of sin3t=(2*pi)/3
LCM of pi and (2*pi)/3 is 2*pi.
Signals, Systems and Signal Processing
1. Which of the following is common independent variable for speech signal, EEG and ECG?
a) Time
b) Spatial coordinates
c) Pressure
d) None of the mentioned
View Answer
Answer: a
Explanation: Speech, EEG and ECG signals are the examples of information-bearing signals that evolve as functions of
a single independent variable, namely, time.

2. Which of the following conditions made digital signal processing more advantageous over analog signal processing?
a) Flexibility
b) Accuracy
c) Storage
d) All of the mentioned
View Answer
Answer: d
Explanation: Digital programmable system allows flexibility in reconfiguring the DSP operations by just changing the
program, as the digital signal is in the form of 1 and 0’s it is more accurate and it can be stored in magnetic tapes.

3. Which property does y(t)=x(1-t) exhibit?

a) Time scaling
b) Time shifting
c) Reflecting
d) Time shifting and reflecting
View Answer
Answer: d
Explanation: First the signal x(t) is shifted by 1 to get x(1+t) and it is reflected to get x(1-t). So, it exhibits both time
shifting and reflecting properties.

4. If x(n)=(0,1,2,3,3,0,0,0) then x(2n) is?

a) (0,2,4,6,6,0,0,0)
b) (0,1,2,3,3,0,0,0)
c) (0,2,3,0,0,0,0,0)
d) None of the mentioned
View Answer
Answer: c
Explanation: Substitute n=0,1,2… in x(2n) and obtain the values from the given x(n).

5. If x(n)=(0,0,1,2,3,4,0,0) then x(n-2) is?

a) (0,0,2,4,6,8,0,0)
b) (0,0,1,2,3,4,0,0)
c) (1,2,3,4,0,0,0,0)
d) (0,0,0,0,1,2,3,4)
View Answer
Answer: d
Explanation: The signal x(n) is shifted right by 2.

6. If x(n)=(0,0,1,1,1,1,1,0) then x(3n+1) is?

a) (0,1,0,0,0,0,0,0)
b) (0,0,1,1,1,1,0,0)
c) (1,1,0,0,0,0,0,0)
d) None of the mentioned
View Answer
Answer: a
Explanation: First shift the given signal left by 1 and then time scale the obtained signal by 3.

7. If a signal x(t) is processed through a system to obtain the signal (x(t) 2), then the system is said to be ____________
a) Linear
b) Non-linear
c) Exponential
d) None of the mentioned
View Answer
Answer: b
Explanation: Let the input signal be ‘t’. Then the output signal after passing through the system is y=t 2 which is the
equation of a parabola. So, the system is non-linear.

8. What are the important block(s) required to process an input analog signal to get an output analog signal?
a) A/D converter
b) Digital signal processor
c) D/A converter
d) All of the mentioned
View Answer
Answer: d
Explanation: The input analog signal is converted into digital using A/D converter and passed through DSP and then
converted back to analog using a D/A converter.

9. Which of the following block is not required in digital processing of a RADAR signal?
a) A/D converter
b) D/A converter
c) DSP
d) All of the mentioned
View Answer
Answer: b
Explanation: In the digital processing of the radar signal, the information extracted from the radar signal, such as the
position of the aircraft and its speed, may simply be printed on a paper. So, there is no need of an D/A converter in this
case.

10. Which of the following wave is known as “amplitude modulated wave” of x(t)?
a) C.x(t) (where C is a constant)
b) x(t)+y(t)
c) x(t).y(t)
d) dx(t)/dt
View Answer
Answer: c
Explanation: The multiplicative operation is often encountered in analog communication, where an audio frequency
signal is multiplied by a high frequency sinusoid known as carrier. The resulting signal is known as “amplitude
modulated wave”.

11. What is the physical device that performs an operation on the signal?
a) Signal source
b) System
c) Medium
d) None of the mentioned
View Answer
Answer: b
Explanation: A system is a physical device which performs the operation on the signal and modifies the input signal

A2D and D2A Converters

1. . Which of the following should be done in order to convert a continuous-time signal to a discrete-time signal?
a) Sampling
b) Differentiating
c) Integrating
d) None of the mentioned
View Answer
Answer: a
Explanation: The process of converting a continuous-time signal into a discrete-time signal by taking samples of
continuous time signal at discrete time instants is known as ‘sampling’.

2. The process of converting discrete-time continuous valued signal into discrete-time discrete valued (digital) signal is
known as ____________
a) Sampling
b) Quantization
c) Coding
d) None of the mentioned
View Answer
Answer: b
Explanation: In this process, the value of each signal sample is represented by a value selected from a finite set of
possible values. Hence this process is known as ‘quantization’

3. The difference between the unquantized x(n) and quantized xq(n) is known as ___________
a) Quantization coefficient
b) Quantization ratio
c) Quantization factor
d) Quantization error
View Answer
Answer: d
Explanation: Quantization error is the difference in the signal obtained after sampling i.e., x(n) and the signal obtained
after quantization i.e., xq(n) at any instant of time.
4. Which of the following is a digital-to-analog conversion process?
a) Staircase approximation
b) Linear interpolation
c) Quadratic interpolation
d) All of the mentioned
View Answer
Answer: d
Explanation: The process of joining in terms of steps is known as staircase approximation, connecting two samples by a
straight line is known as Linear interpolation, connecting three samples by fitting a quadratic curve is called as
Quadratic interpolation.

5. The relation between analog frequency ‘F’ and digital frequency ‘f’ is?
a) F=f*T(where T is sampling period)
b) f=F*T
c) No relation
d) None of the mentioned
View Answer
Answer: b
Explanation: Consider an analog signal of frequency ‘F’, which when sampled periodically at a rate Fs=1/T samples per
second yields a frequency of f=F/Fs=>f=F*T.

6. What is output signal when a signal x(t)=cos(2*pi*40*t) is sampled with a sampling frequency of 20Hz?
a) cos(pi*n)
b) cos(2*pi*n)
c) cos(4*pi*n)
d) cos(8*pi*n)
View Answer
Answer: c
Explanation: From the question F=40Hz, Fs=20Hz
=>f=F/Fs
=>f=40/20
=>f=2Hz
=>x(n)=cos(4*pi*n).

7. If ‘F’ is the frequency of the analog signal, then what is the minimum sampling rate required to avoid aliasing?
a) F
b) 2F
c) 3F
d) 4F
View Answer
Answer: a
Explanation: According to Nyquist rate, to avoid aliasing the sampling frequency should be equal to twice of the analog
frequency.

8. What is the nyquist rate of the signal x(t)=3cos(50*pi*t)+10sin(300*pi*t)-cos(100*pi*t)?

a) 50Hz
b) 100Hz
c) 200Hz
d) 300Hz
View Answer
Answer: d
Explanation: The frequencies present in the given signal are F1=25Hz, F2=150Hz, F3=50Hz
Thus Fmax=150Hz and from the sampling theorem,
nyquist rate=2*Fmax
Therefore, Fs=2*150=300Hz.

9. What is the discrete-time signal obtained after sampling the analog signal x(t)=cos(2000*pi*t)+sin(5000*pi*t) at a
sampling rate of 5000 samples/sec?
a) cos(2.5*pi*n)+sin(pi*n)
b) cos(0.4*pi*n)+sin(pi*n)
c) cos(2000*pi*n)+sin(5000*pi*n)
d) none of the mentioned
View Answer
Answer: b
Explanation: From the given analog signal, F1=1000Hz F2=2500Hz and Fs=5000Hz
=>f1=F1/Fs and f2=F2/Fs
=>f1=0.2 and f2=0.5
=>x(n)=cos(0.4*pi*n)+sin(pi*n).

10. If the sampling rate Fs satisfies the sampling theorem, then the relation between quantization errors of analog
signal(eq(t)) and discrete-time signal(eq(n)) is?
a) eq(t)=eq(n)
b) eq(t)<eq(n)
c) eq(t)>eq(n)
d) not related
View Answer
Answer: a
Explanation: If it obeys sampling theorem, then the only error in A/D conversion is quantization error. So, the error is
same for both analog and discrete-time signal.

11. The quality of output signal from A/D converter is measured in terms of ___________
a) Quantization error
b) Quantization to signal noise ratio
c) Signal to quantization noise ratio
d) Conversion constant
View Answer
Answer: c
Explanation: The quality is measured by taking the ratio of noises of input signal and the quantized signal i.e., SQNR
and is measured in terms of dB.

12. Which bit coder is required to code a signal with 16 levels?

a) 8 bit
b) 4 bit
c) 2 bit
d) 1 bit
View Answer
Answer: b
Explanation: To code a signal with L number of levels, we require a coder with (log L/log 2) number of bits. So,
log16/log2=4 bit coder is required.

Z Transform
1. The Z-Transform X(z) of a discrete time signal x(n) is defined as ____________
a) ∑∞n=−∞x(n)zn
b) ∑∞n=−∞x(n)z−n
c) ∑∞n=0x(n)zn
d) None of the mentioned
View Answer
Answer: b
Explanation: The z-transform of a real discrete time sequence x(n) is defined as a power of ‘z’ which is equal to
X(z)=∑∞n=−∞x(n)z−n, where ‘z’ is a complex variable.

2. What is the set of all values of z for which X(z) attains a finite value?
a) Radius of convergence
b) Radius of divergence
c) Feasible solution
d) None of the mentioned
View Answer
Answer: a
Explanation: Since X(z) is a infinite power series, it is defined only at few values of z. The set of all values of z where
X(z) converges to a finite value is called as Radius of Convergence(ROC).

3. What is the z-transform of the following finite duration signal?

a) 2 + 4z + 5z2 + 7z3 + z4
b) 2 + 4z + 5z2 + 7z3 + z5
c) 2 + 4z-1 + 5z-2 + 7z-3 + z-5
d) 2z2 + 4z + 5 +7z-1 + z-3
View Answer
Answer: d
Explanation: We know that, for a given signal x(n) the z-transform is defined as X(z)= ∑∞n=−∞x(n)z−n
Substitute the values of n from -2 to 3 and the corresponding signal values in the above formula
We get, X(z) = 2z2 + 4z + 5 + 7z-1 + z-3.

4. What is the ROC of the signal x(n)=δ(n-k), k>0?

a) z=0
b) z=∞
c) Entire z-plane, except at z=0
d) Entire z-plane, except at z=∞
View Answer
Answer: c
Explanation: We know that, the z-transform of a signal x(n) is X(z)= ∑∞n=−∞x(n)z−n
Given x(n)=δ(n-k)=1 at n=k
=> X(z)=z-k
From the above equation, X(z) is defined at all values of z except at z=0 for k>0.
So ROC is defined as Entire z-plane, except at z=0.

5. What is the z-transform of the signal x(n)=(0.5) nu(n)?

a) 11−0.5z−1;ROC|z|>0.5
b) 11−0.5z−1;ROC|z|<0.5
c) 11+0.5z−1;ROC|z|>0.5
d) 11+0.5z−1;ROC|z|<0.5
View Answer
Answer: a
Explanation: For a given signal x(n), its z-transform X(z)= ∑∞n=−∞x(n)z−n
Given x(n)=(0.5)nu(n)=(0.5)n for n≥0
So, X(z)=∑∞n=00.5nz−n=∑∞n=0(0.5z−1)n
This is an infinite GP whose sum is given as
X(z)=11−0.5z−1 under the condition that |0.5z-1|<1
=> X(z)=11−0.5z−1 and ROC is |z|>0.5.

6. Which of the following series has an ROC as mentioned below?

a) α-nu(n)
b) αnu(n)
c) α-nu(-n)
d) αnu(n)
View Answer
Answer: b
Explanation:
Let x(n)= αnu(n)
The z-transform of the signal x(n) is given as
X(z)=X(z)=∑∞n=0αnz−n=∑∞n=0αz−1n
=> X(z)=11−αz−1 and ROC is |z|>α which is as given in the question.

7. What is the z-transform of the signal x(n) = -αnu(-n-1)?

a) 11−αz−1;ROC |z|<|α|
b) −11+αz−1;ROC |z|<|α|
c) −11−αz−1;ROC |z|>|α|
d) −11−αz−1;ROC |z|<|α|
View Answer
Answer: d
Explanation: Given x(n)= -αnu(-n-1)=0 for n≥0
=-αn for n≤-1
From the definition of z-transform, we have
X(z)=∑−1n=−∞(−αn)z−n=−∑−1n=−∞(α−1z)−n=−11−αz−1 and |α-1z|<1 => |z|<|α|.
8. What is the ROC of the z-transform of the signal x(n)= anu(n)+bnu(-n-1)?
a) |a|<|z|<|b|
b) |a|>|z|>|b|
c) |a|>|z|<|b|
d) |a|<|z|>|b|
View Answer
Answer: a
Explanation: We know that,
ROC of z-transform of anu(n) is |z|>|a|.
ROC of z-transform of bnu(-n-1) is |z|<|b|.
By combining both the ROC’s we get the ROC of z-transform of the signal x(n) as |a|<|z|<|b|.

9. What is the ROC of z-transform of finite duration anti-causal sequence?

a) z=0
b) z=∞
c) Entire z-plane, except at z=0
d) Entire z-plane, except at z=∞
View Answer
Answer: d
Explanation: Let us an example of anti causal sequence whose z-transform will be in the form X(z)=1+z+z 2 which has a
finite value at all values of ‘z’ except at z=∞. So, ROC of an anti-causal sequence is entire z-plane except at z=∞.

10. What is the ROC of z-transform of an two sided infinite sequence?

a) |z|>r1
b) |z|<r1
c) r2<|z|<r1
d) None of the mentioned
View Answer
Answer: c
Explanation: Let us plot the graph of z-transform of any two sided sequence which looks as follows.

From the above graph, we can state that the ROC of a two sided sequence will be of the form r 2 < |z| < r1.

11. The z-transform of a sequence x(n) which is given as X(z)= ∑∞n=−∞x(n)z−n is known as _____________
a) Uni-lateral Z-transform
b) Bi-lateral Z-transform
c) Tri-lateral Z-transform
d) None of the mentioned
View Answer
Answer: b
Explanation: The entire timing sequence is divided into two parts n=0 to ∞ and n=-∞ to 0.
Since the z-transform of the signal given in the questions contains both the parts, it is called as Bi-lateral z-transform.

12. What is the ROC of the system function H(z) if the discrete time LTI system is BIBO stable?
a) Entire z-plane, except at z=0
b) Entire z-plane, except at z=∞
c) Contain unit circle
d) None of the mentioned
View Answer
Answer: c
Explanation: A discrete time LTI is BIBO stable, if and only if its impulse response h(n) is absolutely summable. That is,
∑∞n=−∞|h(n)|<∞
We know that, H(z)= ∑∞n=−∞h(n)z−n
Let z=ejω so that |z|=|ejω|=1
Then, |H(ejω)|=|H(ω)|=| ∑∞n=−∞h(n) e-jωn|≤∑∞n=−∞|h(n) e-jωn|
=∑∞n=−∞|h(n)|<∞
Hence, we see that if the system is stable, then H(z) converges for z=ejω. That is, for a stable discrete time LTI system,
ROC of H(z) must contain the unit circle |z|=1.

13. The ROC of z-transform of any signal cannot contain poles.

a) True
b) False
View Answer
Answer: a
Explanation: Since the value of z-transform tends to infinity, the ROC of the z-transform does not contain poles.

14. Is the discrete time LTI system with impulse response h(n)=a n(n) (|a| < 1) BIBO stable?
a) True
b) False
View Answer
Answer: a
Explanation: Given h(n)=an(n) (|a|<1)
The z-transform of h(n) is H(z)=zz−a, ROC is |z|>|a|
If |a|<1, then the ROC contains the unit circle. So, the system is BIBO stable.

15. What is the ROC of a causal infinite length sequence?

a) |z|<r1
b) |z|>r1
c) r2<|z|<r1
d) None of the mentioned
View Answer
Answer: b
Explanation: The ROC of causal infinite sequence is of form |z|>r 1 where r1 is largest magnitude of poles.

Properties of Z Transform – 1
1. Which of the following justifies the linearity property of z-transform?[x(n)↔X(z)].
a) x(n)+y(n) ↔ X(z)Y(z)
b) x(n)+y(n) ↔ X(z)+Y(z)
c) x(n)y(n) ↔ X(z)+Y(z)
d) x(n)y(n) ↔ X(z)Y(z)
View Answer
Answer: b
Explanation: According to the linearity property of z-transform, if X(z) and Y(z) are the z-transforms of x(n) and y(n)
respectively then, the z-transform of x(n)+y(n) is X(z)+Y(z).

2. What is the z-transform of the signal x(n)=[3(2 n)-4(3n)]u(n)?

a) 31−2z−1−41−3z−1
b) 31−2z−1−41+3z−1
c) 31−2z−41−3z
d) None of the mentioned
View Answer
Answer: a
Explanation: Let us divide the given x(n) into x1(n)=3(2n)u(n) and x2(n)= 4(3n)u(n)
and x(n)=x1(n)-x2(n)
From the definition of z-transform X1(z)=31−2z−1 and X2(z)=41−3z−1
So, from the linearity property of z-transform
X(z)=X1(z)-X2(z)
=> X(z)=31−2z−1−41−3z−1.

3. What is the z-transform of the signal x(n)=sin(jω 0n)u(n)?

a) z−1sinω01+2z−1cosω0+z−2
b) z−1sinω01−2z−1cosω0−z−2
c) z−1cosω01−2z−1cosω0+z−2
d) z−1sinω01−2z−1cosω0+z−2
View Answer
Answer: d
Explanation: By Euler’s identity, the given signal x(n) can be written as
x(n) = sin(jω0n)u(n)=12j[ejω0nu(n)−e−jω0nu(n)]
Thus X(z)=12j[11−ejω0z−1−11−e−jω0z−1]
On simplification, we obtain
=> z−1sinω01−2z−1cosω0+z−2.

4. According to Time shifting property of z-transform, if X(z) is the z-transform of x(n) then what is the z-transform of x(n-
k)?
a) zkX(z)
b) z-kX(z)
c) X(z-k)
d) X(z+k)
View Answer
Answer: b
Explanation: According to the definition of Z-transform
X(z)=∑∞n=−∞x(n)z−n
=>Z{x(n-k)}=X1(z)=∑∞n=−∞x(n−k)z−n
Let n-k=l
=> X1(z)=∑∞l=−∞x(l)z−l−k=z−k.∑∞l=−∞x(l)z−l=z−kX(z)

5. What is the z-transform of the signal defined as x(n)=u(n)-u(n-N)?

a) 1+zN1+z−1
b) 1−zN1+z−1
c) 1+z−N1+z−1
d) 1−z−N1−z−1
View Answer
Answer: d
Explanation:
We know that Zu(n)=11−z−1
And by the time shifting property, we have Z{x(n-k)}=z -k.Z{x(n)}
=>Z{u(n-N)}=z−N.11−z−1
=>Z{u(n)-u(n-N)}=1−z−N1−z−1.

6. If X(z) is the z-transform of the signal x(n) then what is the z-transform of a nx(n)?
a) X(az)
b) X(az-1)
c) X(a-1z)
d) None of the mentioned
View Answer
Answer: c
Explanation: We know that from the definition of z-transform
Z{anx(n)}=∑∞n=−∞anx(n)z−n=∑∞n=−∞x(n)(a−1z)−n=X(a−1z).

7. If the ROC of X(z) is r1<|z|<r2, then what is the ROC of X(a-1z)?

a) |a|r1<|z|<|a|r2
b) |a|r1>|z|>|a|r2
c) |a|r1<|z|>|a|r2
d) |a|r1>|z|<|a|r2
View Answer
Answer: a
Explanation: Given ROC of X(z) is r1<|z|<r2
Then ROC of X(a-1z) will be given by r1<|a-1z |<r2=|a|r1<|z|<|a|r2

8. What is the z-transform of the signal x(n)=a n(sinω0n)u(n)?

a)az−1sinω01+2az−1cosω0+a2z−2
b)az−1sinω01−2az−1cosω0−a2z−2
c)(az)−1cosω01−2az−1cosω0+a2z−2
d)az−1sinω01−2az−1cosω0+a2z−2
View Answer
Answer: d
Explanation:
we know that by the linearity property of z-transform of sin(ω 0n)u(n) is X(z)=z−1sinω01−2z−1cosω0+z−2
Now by the scaling in the z-domain property, we have z-transform of an (sin(ω 0n))u(n) as
X(az)=az−1sinω01−2az−1cosω0+a2z−2

9. If X(z) is the z-transform of the signal x(n), then what is the z-transform of the signal x(-n)?
a) X(-z)
b) X(z-1)
c) X-1(z)
d) None of the mentioned
View Answer
Answer: b
Explanation: From the definition of z-transform, we have
Z{x(-n)}=∑∞n=−∞x(−n)z−n=∑∞n=−∞x(−n)(z−1)−(−n)=X(z−1)

10. X(z) is the z-transform of the signal x(n), then what is the z-transform of the signal nx(n)?
a) −zdX(z)dz
b) zdX(z)dz
c) −z−1dX(z)dz
d) z−1dX(z)dz
View Answer
Answer: a
Explanation:
From the definition of z-transform, we have
X(z)=∑∞n=−∞x(n)z−n
On differentiating both sides, we have
dX(z)dz=∑∞n=−∞(−n)x(n)z−n−1=−z−1∑∞n=−∞nx(n)z−n=−z−1Z{nx(n)}
Therefore, we get −zdX(z)dz = Z{nx(n)}.

11. What is the z-transform of the signal x(n)=na nu(n)?

a) (az)−1(1−(az)−1)2
b) az−1(1−(az)−1)2
c) az−1(1−az−1)2
d) az−1(1+az−1)2
View Answer
Answer: c
Explanation:
We know that Z{anu(n)}=11−az−1=X(z) (say)
Now the z-transform of nanu(n)=−zdX(z)dz=az−1(1−az−1)2

Sampling Rate Conversion by a Rational Factor I/D

1. Sampling rate conversion by the rational factor I/D is accomplished by what connection of interpolator and decimator?
a) Parallel
b) Cascade
c) Convolution
d) None of the mentioned
View Answer
Answer: b
Explanation: A sampling rate conversion by the rational factor I/D is accomplished by cascading an interpolator with a
decimator.

2. Which of the following has to be performed in sampling rate conversion by rational factor?
a) Interpolation
b) Decimation
c) Either interpolation or decimation
d) None of the mentioned
View Answer
Answer: a
Explanation: We emphasize that the importance of performing the interpolation first and decimation second, is to
preserve the desired spectral characteristics of x(n).
3. Which of the following operation is performed by the blocks given the figure below?

a) Sampling rate conversion by a factor I

b) Sampling rate conversion by a factor D
c) Sampling rate conversion by a factor D/I
d) Sampling rate conversion by a factor I/D
View Answer
Answer: d
Explanation: In the diagram given, a interpolator is in cascade with a decimator which together performs the action of
sampling rate conversion by a factor I/D.

4. The Nth root of unity WN is given as _____________

a) ej2πN
b) e-j2πN
c) e-j2π/N
d) ej2π/N
View Answer
Answer: c
Explanation: We know that the Discrete Fourier transform of a signal x(n) is given as
X(k)=∑N−1n=0x(n)e−j2πkn/N=∑N−1n=0x(n)WknN
Thus we get Nth rot of unity WN= e-j2π/N

5. Which of the following is true regarding the number of computations requires to compute an N-point DFT?
a) N2 complex multiplications and N(N-1) complex additions
b) N2 complex additions and N(N-1) complex multiplications
c) N2 complex multiplications and N(N+1) complex additions
d) N2 complex additions and N(N+1) complex multiplications
View Answer
Answer: a
Explanation: The formula for calculating N point DFT is given as
X(k)=∑N−1n=0x(n)e−j2πkn/N
From the formula given at every step of computing we are performing N complex multiplications and N-1 complex
additions. So, in a total to perform N-point DFT we perform N 2 complex multiplications and N(N-1) complex additions.

6. Which of the following is true?

a) W∗N=1NWN−1
b) WN−1=1NWN∗
c) WN−1=WN∗
d) None of the mentioned
View Answer
Answer: b
Explanation: If XN represents the N point DFT of the sequence xN in the matrix form, then we know that X N = WN.xN
By pre-multiplying both sides by WN-1, we get
xN=WN-1.XN
But we know that the inverse DFT of XN is defined as
xN=1/N*XN
Thus by comparing the above two equations we get
WN-1=1/N WN*

7. What is the DFT of the four point sequence x(n)={0,1,2,3}?

a) {6,-2+2j-2,-2-2j}
b) {6,-2-2j,2,-2+2j}
c) {6,-2+2j,-2,-2-2j}
d) {6,-2-2j,-2,-2+2j}
View Answer
Answer: c
Explanation: The first step is to determine the matrix W4. By exploiting the periodicity property of W4 and the symmetry
property
Wk+N/2N=−WNk
The matrix W4 may be expressed as
W4=⎡⎣⎢⎢⎢⎢W04W04W04W44W04W04W24W64W04W24W04W64W14W34W34W94⎤⎦⎥⎥⎥⎥=⎡⎣⎢⎢⎢⎢W04W04W04W04W0
4W04W24W24W04W24W04W24W14W34W34W14⎤⎦⎥⎥⎥⎥
=⎡⎣⎢⎢⎢11111−j−1j1−11−11j−1−j⎤⎦⎥⎥⎥
Then X4=W4.x4=⎡⎣⎢⎢⎢6−2+2j−2−2−2j⎤⎦⎥⎥⎥

8. If X(k) is the N point DFT of a sequence whose Fourier series coefficients is given by c k, then which of the following is
true?
a) X(k)=Nck
b) X(k)=ck/N
c) X(k)=N/ck
d) None of the mentioned
View Answer
Answer: a
Explanation: The Fourier series coefficients are given by the expression
ck=1N∑N−1n=0x(n)e−j2πkn/N=1NX(k)=>X(k)=Nck

9. What is the DFT of the four point sequence x(n)={0,1,2,3}?

a) {6,-2+2j-2,-2-2j}
b) {6,-2-2j,2,-2+2j}
c) {6,-2-2j,-2,-2+2j}
d) {6,-2+2j,-2,-2-2j}
View Answer
Answer: d
Explanation: Given x(n)={0,1,2,3}
We know that the 4-point DFT of the above given sequence is given by the expression
X(k)=∑N−1n=0x(n)e−j2πkn/N
In this case N=4
=>X(0)=6, X(1)=-2+2j, X(2)=-2, X(3)=-2-2j.

10. If W4100=Wx200, then what is the value of x?

a) 2
b) 4
c) 8
d) 16
View Answer
Answer: c
Explanation: We know that according to the periodicity and symmetry property,
100/4=200/x=>x=8.

Inversion of Z Transform
1. Which of the following method is used to find the inverse z-transform of a signal?
a) Counter integration
b) Expansion into a series of terms
c) Partial fraction expansion
d) All of the mentioned
View Answer
Answer: d
Explanation: All the methods mentioned above can be used to calculate the inverse z-transform of the given signal.

2. What is the inverse z-transform of X(z)=11−1.5z−1+0.5z−2 if ROC is |z|>1?

a) {1,3/2,7/4,15/8,31/16,….}
b) {1,2/3,4/7,8/15,16/31,….}
c) {1/2,3/4,7/8,15/16,31/32,….}
d) None of the mentioned
View Answer
Answer: a
Explanation: Since the ROC is the exterior circle, we expect x(n) to be a causal signal. Thus we seek a power series
expansion in negative powers of ‘z’. By dividing the numerator of X(z) by its denominator, we obtain the power series
X(z)=11−1.5z−1+0.5z−2=1+32z−1+74z−2+158z−3+3116z−4+…
So, we obtain x(n)= {1,3/2,7/4,15/8,31/16,….}.

3. What is the inverse z-transform of X(z)=11−1.5z−1+0.5z−2 if ROC is |z| < 0.5?

a) {….62,30,14,6,2}
b) {…..62,30,14,6,2,0,0}
c) {0,0,2,6,14,30,62…..}
d) {2,6,14,30,62…..}
View Answer
Answer: b
Explanation: In this case the ROC is the interior of a circle. Consequently, the signal x(n) is anti causal. To obtain a
power series expansion in positive powers of z, we perform the long division in the following way:

Thus X(z)=11−1.5z−1+0.5z−2=2z2+6z3+14z4+30z5+62z6+… In this case x(n)=0 for n≥0.Thus we obtain x(n)=

{…..62,30,14,6,2,0,0}

4. What is the inverse z-transform of X(z)=log(1+az -1) |z|>|a|?

a) x(n)=(-1)n+1 a−nn, n≥1; x(n)=0, n≤0
b) x(n)=(-1)n-1 a−nn, n≥1; x(n)=0, n≤0
c) x(n)=(-1)n+1 a−nn, n≥1; x(n)=0, n≤0
d) None of the mentioned
View Answer
Answer: c
Explanation: Using the power series expansion for log(1+x), with |x|<1, we have
X(z)=∑∞n=1(−1)n+1anz−nn
Thus
x(n)=(-1)n+1 ann, n≥1
=0, n≤0.

5. What is the proper fraction and polynomial form of the improper rational transform
X(z)=1+3z−1+116z−2+13z−31+56z−1+16z−2?
a) 1+2z-1+16z−11+56z−1+16z−2
b) 1-2z-1+16z−11+56z−1+16z−2
c) 1+2z-1+13z−11+56z−1+16z−2
d) 1+2z-1–16z−11+56z−1+16z−2
View Answer
Answer: a
Explanation: First, we note that we should reduce the numerator so that the terms z -2 and z-3 are eliminated. Thus we
should carry out the long division with these two polynomials written in the reverse order. We stop the division when the
order of the remainder becomes z-1. Then we obtain
X(z)=1+2z-1+16z−11+56z−1+16z−2.

6. What is the partial fraction expansion of the proper function X(z)= 11−1.5z−1+0.5z−2?
a) 2zz−1−zz+0.5
b) 2zz−1+zz−0.5
c) 2zz−1+zz+0.5
d) 2zz−1−zz−0.5
View Answer
Answer: d
Explanation: First we eliminate the negative powers of z by multiplying both numerator and denominator by z 2.
Thus we obtain X(z)=z2z2−1.5z+0.5
The poles of X(z) are p1=1 and p2=0.5. Consequently, the expansion will be
X(z)z=z(z−1)(z−0.5)=2(z−1)–1(z−0.5)
(obtained by applying partial fractions)
=>X(z)=2z(z−1)−z(z−0.5).

7. What is the partial fraction expansion of X(z)= 1+z−11−z−1+0.5z−2?

a) z(0.5−1.5j)z−0.5−0.5j–z(0.5+1.5j)z−0.5+0.5j
b) z(0.5−1.5j)z−0.5−0.5j+z(0.5+1.5j)z−0.5+0.5j
c) z(0.5+1.5j)z−0.5−0.5j–z(0.5−1.5j)z−0.5+0.5j
d) z(0.5+1.5j)z−0.5−0.5j+z(0.5−1.5j)z−0.5+0.5j
View Answer
Answer: b
Explanation: To eliminate the negative powers of z, we multiply both numerator and denominator by z 2. Thus,
X(z)=z(z+1)z−2−z+0.5
The poles of X(z) are complex conjugates p1=0.5+0.5j and p2=0.5-0.5j
Consequently the expansion will be
X(z)= z(0.5−1.5j)z−0.5−0.5j+z(0.5+1.5j)z−0.5+0.5j.

8. What is the partial fraction expansion of X(z)= 1(1+z−1)(1−z−1)2?

a) z4(z+1)+3z4(z−1)+z2(z+1)2
b) z4(z+1)+3z4(z−1)–z2(z+1)2
c) z4(z+1)+3z4(z−1)+z2(z−1)2
d) z4(z+1)+z4(z−1)+z2(z+1)2
View Answer
Answer: c
Explanation: First we express X(z) in terms of positive powers of z, in the form X(z)= z3(z+1)(z−1)2
X(z) has a simple pole at z=-1 and a double pole at z=1. In such a case the approximate partial fraction expansion is
X(z)z=z2(z+1)(z−1)2=Az+1+Bz−1+C(z−1)2
On simplifying, we get the values of A, B and C as 1/4, 3/4 and 1/2 respectively.
Therefore, we get z4(z+1)+3z4(z−1)+z2(z−1)2.

9. What is the inverse z-transform of X(z)=11−1.5z−1+0.5z−2 if ROC is |z|>1?

a) (2-0.5n)u(n)
b) (2+0.5n)u(n)
c) (2n-0.5n)u(n)
d) None of the mentioned
View Answer
Answer: a
Explanation: The partial fraction expansion for the given X(z) is
X(z)=2zz−1−zz−0.5
In case when ROC is |z|>1, the signal x(n) is causal and both the terms in the above equation are causal terms. Thus,
when we apply inverse z-transform to the above equation, we get
x(n)=2(1)nu(n)-(0.5)nu(n)=(2-0.5n)u(n).

10. What is the inverse z-transform of X(z)=11−1.5z−1+0.5z−2 if ROC is |z|<0.5?

a) [-2-0.5n]u(n)
b) [-2+0.5n]u(n)
c) [-2+0.5n]u(-n-1)
d) [-2-0.5n]u(-n-1)
View Answer
Answer: c
Explanation: The partial fraction expansion for the given X(z) is
X(z)=2zz−1−zz−0.5
In case when ROC is |z|<0.5, the signal is anti causal. Thus both the terms in the above equation are anti causal terms.
So, if we apply inverse z-transform to the above equation we get
x(n)= [-2+0.5n]u(-n-1).

11. What is the inverse z-transform of X(z)=11−1.5z−1+0.5z−2 if ROC is 0.5<|z|<1?

a) -2u(-n-1)+(0.5)nu(n)
b) -2u(-n-1)-(0.5)nu(n)
c) -2u(-n-1)+(0.5)nu(-n-1)
d) 2u(n)+(0.5)nu(-n-1)
View Answer
Answer: b
Explanation: The partial fraction expansion of the given X(z) is
X(z)=2zz−1−zz−0.5
In this case ROC is 0.5<|z|<1 is a ring, which implies that the signal is two sided. Thus one of the signal corresponds to
a causal signal and the other corresponds to an anti causal signal. Obviously, the ROC given is the overlapping of the
regions |z|>0.5 and |z|<1. Hence the pole p2=0.5 provides the causal part and the pole p1=1 provides the anti causal
part. SO, if we apply the inverse z-transform we get
x(n)= -2u(-n-1)-(0.5)nu(n).

12. What is the causal signal x(n) having the z-transform X(z)= 1(1+z−1)(1−z−1)2?
a) [1/4(-1)n+3/4-n/2]u(n)
b) [1/4(-1)n+3/4-n/2]u(-n-1)
c) [1/4+3/4(-1)n-n/2]u(n)
d) [1/4(-1)n+3/4+n/2]u(n)
View Answer
Answer: d
Explanation: The partial fraction expansion of X(z) is X(z)=z4(z+1)+3z4(z−1)+z2(z−1)2
When we apply the inverse z-transform for the above equation, we get
x(n)=[1/4(-1)n+3/4+n/2]u(n)

One Sided Z Transform

1. The z-transform of a signal x(n) whose definition is given by X(z)=∑∞n=0x(n)z−n is known as _____________
a) Unilateral z-transform
b) Bilateral z-transform
c) Rational z-transform
d) None of the mentioned
View Answer
Answer: a
Explanation: The z-transform of the x(n) whose definition exists in the range n=-∞ to +∞ is known as bilateral or two
sided z-transform. But in the given question the value of n=0 to +∞. So, such a z-transform is known as Unilateral or one
sided z-transform.

2. For what kind of signals one sided z-transform is unique?

a) All signals
b) Anti-causal signal
c) Causal signal
d) None of the mentioned
View Answer
Answer: c
Explanation: One sided z-transform is unique only for causal signals, because only these signals are zero for n<0.

3. What is the one sided z-transform X+(z) of the signal x(n)={1,2,5,7,0,1}?

a) z2+2z+5+7z-1+z-3
b) 5+7z+z3
c) z-2+2z-1+5+7z+z3
d) 5+7z-1+z-3
View Answer
Answer: d
Explanation: Since the one sided z-transform is valid only for n>=0, the z-transform of the given signal will be X +(z)=
5+7z-1+z-3.

4. What is the one sided z-transform of x(n)=δ(n-k)?

a) z-k
b) zk
c) 0
d) 1
View Answer
Answer: a
Explanation: Since the signal x(n)= δ(n-k) is a causal signal i.e., it is defined for n>0 and x(n)=1 at z=k
So, from the definition of one sided z-transform X+(z)=z-k.

5. What is the one sided z-transform of x(n)=δ(n+k)?

a) z-k
b) 0
c) zk
d) 1
View Answer
Answer: b
Explanation: Since the signal x(n)=δ(n+k) is an anti causal signal i.e., it is defined for n<0 and x(n)=1 at z=-k. Since the
one sided z-transform is defined only for causal signal, in this case X +(z)=0.

6. If X+(z) is the one sided z-transform of x(n), then what is the one sided z-transform of x(n-k)?
a) z-k X+(z)
b) zk X+(z-1)
c) z-k [X+(z)+∑kn=1x(−n)zn]; k>0
d) z-k [X+(z)+∑kn=0x(−n)zn]; k>0
View Answer
Answer: c
Explanation: From the definition of one sided z-transform we have,
Z+{x(n-k)}=z−k[∑−1l=−kx(l)z−l+∑∞l=0x(l)z−l]
=z−k[∑−kl=−1x(l)z−l+X+(z)]
By changing the index from l to n= -l, we obtain
Z+{x(n-k)}=z−k[X+(z)+∑kn=1x(−n)zn] ;k>0

7. If x(n)=an, then what is one sided z-transform of x(n-2)?

a) z−21−az−1+a−1z−1+a−2
b) z−21−az−1–a−1z−1+a−2
c) z−21−az−1+a−1z−1–a−2
d) z−21+az−1+a−1z−1+a−2
View Answer
Answer: a
Explanation:
Given x(n)=an=>X+(z)=11−az−1
We will apply the shifting property for k=2. Indeed we have
Z+{x(n-2)}=z-2[X+(z)+x(-1)z+x(-2)z2]
=z-2 X+(z)+x(-1)z-1+x(-2)
Since x(-1)=a-1 and x(-2)=a-2, we obtain
X1+(z)=z−21−az−1 + a-1z-1 + a-2

8. If x(n)=an, then what is one sided z-transform of x(n+2)?

a) z−21−az−1 + a-1z-1 + a-2
b) z−21−az−1 – a-1z-1 + a-2
c) z21−az−1 + a z + z2
d) z21+az−1 – z2 – az
View Answer
Answer: d
Explanation: We will apply the time advance theorem with the value of k=2.We obtain,
Z+{x(n+2)}=z2 X+(z)-x(0)z2-x(1)z
=>X1+(z)=z21+az−1 – z2 – az.

9. If X+(z) is the one sided z-transform of the signal x(n), then limn→∞x(n)=limz→1(z−1)X+(z) is called Final value
theorem.
a) True
b) False
View Answer
Answer: a
Explanation: In the above theorem, we are calculating the value of x(n) at infinity, so it is called as final value theorem.

10. The impulse response of a relaxed LTI system is h(n)=a nu(n), |a|<1. What is the value of the step response of the
system as n→∞?
a) 11+a
b) 11−a
c) a1+a
d) a1−a
View Answer
Answer: b
Explanation: The step response of the system is y(n)=x(n)*h(n) where x(n)=u(n)
On applying z-transform on both sides, we get
Y(z)=11−az−111−z−1=z2(z−1)(z−a) ROC |z|>|a|
Now
(z-1)Y(z)=z2(z−a) ROC |z|>|a|
Since |a|<1 the ROC of (z-1)Y(z) includes the unit circle. Consequently by applying the final value theorem
limn→∞y(n)=limz→1z2z−a=11−a
11. What is the step response of the system y(n)=ay(n-1)+x(n) -1<a<1, when the initial condition is y(-1)=1?
a) 11−a(1+an+2)u(n)
b) 11+a(1+an+2)u(n)
c) 11−a(1-an+2)u(n)
d) 11+a(1-an+2)u(n)
View Answer
Answer: c
Explanation: By taking the one sided z-transform of the given equation, we obtain
Y+(Z)=a[z-1Y+(z)+y(-1)]+X+(z)
Upon substitution for y(-1) and X+(z) and solving for Y+(z), we obtain the result
Y+(z)=a1−az−1+1(1−az−1)(1−z−1)
By performing the partial fraction expansion and inverse transforming the result, we have
y(n)=1(1−a)(1−an+2)u(n).
Frequency Domain Sampling DFT
1. If x(n) is a finite duration sequence of length L, then the discrete Fourier transform X(k) of x(n) is given as
____________
a) ∑N−1n=0x(n)e−j2πkn/N(L<N)(k=0,1,2…N-1)
b) ∑N−1n=0x(n)ej2πkn/N(L<N)(k=0,1,2…N-1)
c) ∑N−1n=0x(n)ej2πkn/N(L>N)(k=0,1,2…N-1)
d) ∑N−1n=0x(n)e−j2πkn/N(L>N)(k=0,1,2…N-1)
View Answer
Answer: a
Explanation: If x(n) is a finite duration sequence of length L, then the Fourier transform of x(n) is given as
X(ω)=∑L−1n=0x(n)e−jωn
If we sample X(ω) at equally spaced frequencies ω=2πk/N, k=0,1,2…N-1 where N>L, the resultant samples are
X(k)=∑N−1n=0x(n)e−j2πkn/N

2. If X(k) discrete Fourier transform of x(n), then the inverse discrete Fourier transform of X(k) is?
a) 1N∑N−1k=0X(k)e−j2πkn/N
b) ∑N−1k=0X(k)e−j2πkn/N
c) ∑N−1k=0X(k)ej2πkn/N
d) 1N∑N−1k=0X(k)ej2πkn/N
View Answer
Answer: d
Explanation: If X(k) discrete Fourier transform of x(n), then the inverse discrete Fourier transform of X(k) is given as
x(n)=1N∑N−1k=0X(k)ej2πkn/N

3. A finite duration sequence of length L is given as x(n)=1 for 0≤n≤L-1 = 0 otherwise, then what is the N point DFT of
this sequence for N=L?
a) X(k) = L for k=0, 1, 2….L-1
b)

X(k) = L for k=0

=0 for k=1,2....L-1

c)

X(k) = L for k=0

=1 for k=1,2....L-1

d) None of the mentioned

View Answer
Answer: b
Explanation: The Fourier transform of this sequence is
X(ω)=∑L−1n=0x(n)e−jωn=∑L−1n=0e−jωn
The discrete Fourier transform is given as X(k)=∑N−1n=0e−j2πkn/N
If N=L, then X(k)= L for k=0
=0 for k=1,2….L-1

4. The Nth rot of unity WN is given as ______________

a) ej2πN
b) e-j2πN
c) e-j2π/N
d) ej2π/N
View Answer
Answer: c
Explanation: We know that the Discrete Fourier transform of a signal x(n) is given as
X(k)=∑N−1n=0x(n)e−j2πkn/N=∑N−1n=0x(n)WknN
Thus we get Nth rot of unity WN=e-j2π/N
5. Which of the following is true regarding the number of computations requires to compute an N-point DFT?
a) N2 complex multiplications and N(N-1) complex additions
b) N2 complex additions and N(N-1) complex multiplications
c) N2 complex multiplications and N(N+1) complex additions
d) N2 complex additions and N(N+1) complex multiplications
View Answer
Answer: a
Explanation: The formula for calculating N point DFT is given as
X(k)=∑N−1n=0x(n)e−j2πkn/N
From the formula given at every step of computing we are performing N complex multiplications and N-1 complex
additions. So, in a total to perform N-point DFT we perform N 2 complex multiplications and N(N-1) complex additions.

6. Which of the following is true?

a) WN*=1NW−1N
b) WN-1=1NWN∗
c) WN-1=WN*
d) None of the mentioned
View Answer
Answer: b
Explanation: If XN represents the N point DFT of the sequence xN in the matrix form, then we know that
XN=WN.xN
By pre-multiplying both sides by WN-1, we get
xN=WN-1.XN
But we know that the inverse DFT of XN is defined as
xN=1NWN∗XN
Thus by comparing the above two equations we get
WN-1 = 1NWN∗

7. What is the DFT of the four point sequence x(n)={0,1,2,3}?

a) {6,-2+2j-2,-2-2j}
b) {6,-2-2j,2,-2+2j}
c) {6,-2+2j,-2,-2-2j}
d) {6,-2-2j,-2,-2+2j}
View Answer
Answer: c
Explanation: The first step is to determine the matrix W4. By exploiting the periodicity property of W4 and the symmetry
property
WNk+N/2=-WNk
The matrix W4 may be expressed as
W4=⎡⎣⎢⎢⎢⎢W04W04W04W44W04W04W24W64W04W24W04W64W14W34W34W94⎤⎦⎥⎥⎥⎥=⎡⎣⎢⎢⎢⎢W04W04W04W04W0
4W04W24W24W04W24W04W24W14W34W34W14⎤⎦⎥⎥⎥⎥

=⎡⎣⎢⎢⎢11111−j−1j1−11−11j−1−j⎤⎦⎥⎥⎥
Then X4=W4.x4=⎡⎣⎢⎢⎢6−2+2j−2−2−2j⎤⎦⎥⎥⎥

8. If X(k) is the N point DFT of a sequence whose Fourier series coefficients is given by c k, then which of the following is
true?
a) X(k)=Nck
b) X(k)=ck/N
c) X(k)=N/ck
d) None of the mentioned
View Answer
Answer: a
Explanation: The Fourier series coefficients are given by the expression
ck=1N∑N−1n=0x(n)e−j2πkn/N=1NX(k) => X(k)= Nck

9. What is the DFT of the four point sequence x(n)={0,1,2,3}?

a) {6,-2+2j-2,-2-2j}
b) {6,-2-2j,2,-2+2j}
c) {6,-2-2j,-2,-2+2j}
d) {6,-2+2j,-2,-2-2j}
View Answer
Answer: d
Explanation: Given x(n)={0,1,2,3}
We know that the 4-point DFT of the above given sequence is given by the expression
X(k)=∑N−1n=0x(n)e−j2πkn/N
In this case N=4
=>X(0)=6,X(1)=-2+2j,X(2)=-2,X(3)=-2-2j.

10. If W4100=Wx200, then what is the value of x?

a) 2
b) 4
c) 8
d) 16
View Answer
Answer: c
Explanation: We know that according to the periodicity and symmetry property,
100/4=200/x=>x=8.

Properties of DFT
1. If x(n) and X(k) are an N-point DFT pair, then x(n+N)=x(n).
a) True
b) False
View Answer
Answer: a
Explanation: We know that the expression for an DFT is given as
X(k)=∑N−1n=0x(n)e−j2πkn/N
Now take x(n)=x(n+N)=>X1(k)=∑N−1n=0x(n+N)e−j2πkn/N
Let n+N=l=>X1(k)=∑0l=Nx(l)e−j2πkl/N=X(k)
Therefore, we got x(n)=x(n+N)

2. If x(n) and X(k) are an N-point DFT pair, then X(k+N)=?

a) X(-k)
b) -X(k)
c) X(k)
d) None of the mentioned
View Answer
Answer: c
Explanation: We know that
x(n)=1N∑N−1k=0x(k)ej2πkn/N
Let X(k)=X(k+N)
=>x1(n)=1N∑N−1k=0X(k+N)ej2πkn/N=x(n)
Therefore, we have X(k)=X(k+N)

3. If X1(k) and X2(k) are the N-point DFTs of X1(n) and x2(n) respectively, then what is the N-point DFT of x(n)=ax1(n)
+bx2(n)?
a) X1(ak)+X2(bk)
b) aX1(k)+bX2(k)
c) eakX1(k)+ebkX2(k)
d) None of the mentioned
View Answer
Answer: b
Explanation: We know that, the DFT of a signal x(n) is given by the expression
X(k)=∑N−1n=0x(n)e−j2πkn/N
Given x(n)=ax1(n)+bx2(n)
=>X(k)= ∑N−1n=0(ax1(n)+bx2(n))e−j2πkn/N
=a∑N−1n=0x1(n)e−j2πkn/N+b∑N−1n=0x2(n)e−j2πkn/N
=>X(k)=aX1(k)+bX2(k).

4. If x(n) is a complex valued sequence given by x(n)=xR(n)+jxI(n), then what is the DFT of xR(n)?
a) ∑Nn=0xR(n)cos2πknN+xI(n)sin2πknN
b) ∑Nn=0xR(n)cos2πknN−xI(n)sin2πknN
c) ∑N−1n=0xR(n)cos2πknN−xI(n)sin2πknN
d) ∑N−1n=0xR(n)cos2πknN+xI(n)sin2πknN
View Answer
Answer: d
Explanation: Given x(n)=xR(n)+jxI(n)=>xR(n)=1/2(x(n)+x*(n))
Substitute the above equation in the DFT expression
Thus we get, XR(k)=∑N−1n=0xR(n)cos2πknN+xI(n)sin2πknN
5. If x(n) is a real sequence and X(k) is its N-point DFT, then which of the following is true?
a) X(N-k)=X(-k)
b) X(N-k)=X*(k)
c) X(-k)=X*(k)
d) All of the mentioned
View Answer
Answer: d
Explanation: We know that
X(k)=∑N−1n=0x(n)e−j2πkn/N
Now X(N-k)=∑N−1n=0x(n)e−j2π(N−k)n/N=X*(k)=X(-k)
Therefore,
X(N-k)=X*(k)=X(-k)

6. If x(n) is real and even, then what is the DFT of x(n)?

a) ∑N−1n=0x(n)sin2πknN
b) ∑N−1n=0x(n)cos2πknN
c) -j∑N−1n=0x(n)sin2πknN
d) None of the mentioned
View Answer
Answer: b
Explanation: Given x(n) is real and even, that is x(n)=x(N-n)
We know that XI(k)=0. Hence the DFT reduces to
X(k)=∑N−1n=0x(n)cos2πknN ;0 ≤ k ≤ N-1

7. If x(n) is real and odd, then what is the IDFT of the given sequence?
a) j1N∑N−1k=0x(k)sin2πknN
b) 1N∑N−1k=0x(k)cos2πknN
c) −j1N∑N−1k=0x(k)sin2πknN
d) None of the mentioned
View Answer
Answer: a
Explanation: If x(n) is real and odd, that is x(n)=-x(N-n), then XR(k)=0. Hence X(k) is purely imaginary and odd. Since
XR(k) reduces to zero, the IDFT reduces to
x(n)=j1N∑N−1k=0x(k)sin2πknN

8. If X1(n), x2(n) and x3(m) are three sequences each of length N whose DFTs are given as X 1(k), X2(k) and X3(k)
respectively and X3(k)=X1(k).X2(k), then what is the expression for x3(m)?
a) ∑N−1n=0x1(n)x2(m+n)
b) ∑N−1n=0x1(n)x2(m−n)
c) ∑N−1n=0x1(n)x2(m−n)N
d) ∑N−1n=0x1(n)x2(m+n)N
View Answer
Answer: c
Explanation: If X1(n), x2(n) and x3(m) are three sequences each of length N whose DFTs are given as X1(k), x2(k) and
X3(k) respectively and X3(k)=X1(k).X2(k), then according to the multiplication property of DFT we have x3(m) is the circular
convolution of X1(n) and x2(n).
That is x3(m) = ∑N−1n=0x1(n)x2(m−n)N.

9. What is the circular convolution of the sequences X1(n)={2,1,2,1} and x2(n)={1,2,3,4}?

a) {14,14,16,16}
b) {16,16,14,14}
c) {2,3,6,4}
d) {14,16,14,16}
View Answer
Answer: d
Explanation: We know that the circular convolution of two sequences is given by the expression
x(m)= ∑N−1n=0x1(n)x2(m−n)N
For m=0, x2((-n))4={1,4,3,2}
For m=1, x2((1-n))4={2,1,4,3}
For m=2, x2((2-n))4={3,2,1,4}
For m=3, x2((3-n))4={4,3,2,1}
Now we get x(m)={14,16,14,16}.

10. What is the circular convolution of the sequences X1(n)={2,1,2,1} and x2(n)={1,2,3,4}, find using the DFT and IDFT
concepts?
a) {16,16,14,14}
b) {14,16,14,16}
c) {14,14,16,16}
d) None of the mentioned
View Answer
Answer: b
Explanation: Given X1(n)={2,1,2,1}=>X1(k)=[6,0,2,0]
Given x2(n)={1,2,3,4}=>X2(k)=[10,-2+j2,-2,-2-j2]
when we multiply both DFTs we obtain the product
X(k)=X1(k).X2(k)=[60,0,-4,0]
By applying the IDFT to the above sequence, we get
x(n)={14,16,14,16}.

11. If X(k) is the N-point DFT of a sequence x(n), then circular time shift property is that N-point DFT of x((n-l)) N is X(k)e-
j2πkl/N
.
a) True
b) False
View Answer
Answer: a
Explanation: According to the circular time shift property of a sequence, If X(k) is the N-point DFT of a sequence x(n),
then the N-pint DFT of x((n-l))N is X(k)e-j2πkl/N.

12. If X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)?
a) X(N-k)
b) X*(k)
c) X*(N-k)
d) None of the mentioned
View Answer
Answer: c
Explanation: According to the complex conjugate property of DFT, we have if X(k) is the N-point DFT of a sequence
x(n), then what is the DFT of x*(n) is X*(N-k).

Linear Filtering Methods Based on DFT

1. By means of the DFT and IDFT, determine the response of the FIR filter with impulse response h(n)={1,2,3} to the
input sequence x(n)={1,2,2,1}?
a) {1,4,11,9,8,3}
b) {1,4,9,11,8,3}
c) {1,4,9,11,3,8}
d) {1,4,9,3,8,11}
View Answer
Answer: b
Explanation: The input sequence has a length N=4 and impulse response has a length M=3. So, the response must
have a length of 6(4+3-1).
We know that, Y(k)=X(k).H(k)
Thus we obtain Y(k)={36,-14.07-j17.48,j4,0.07+j0.515,0,0.07-j0.515,-j4,-14.07+j17.48}
By applying IDFT to the above sequence, we get y(n)={1,4,9,11,8,3,0,0}
Thus the output of the system is {1,4,9,11,8,3}.

2. What is the sequence y(n) that results from the use of four point DFTs if the impulse response is h(n)={1,2,3} and the
input sequence x(n)={1,2,2,1}?
a) {9,9,7,11}
b) {1,4,9,11,8,3}
c) {7,9,7,11}
d) {9,7,9,11}
View Answer
Answer: d
Explanation: The four point DFT of h(n) is H(k)=1+2e-jkπ/2+3 e-jkπ (k=0,1,2,3)
Hence H(0)=6, H(1)=-2-j2, H(3)=2, H(4)=-2+j2
The four point DFT of x(n) is X(k)= 1+2e-jkπ/2+2 e-jkπ+3e-3jkπ/2(k=0,1,2,3)
Hence X(0)=6, X(1)=-1-j, X(2)=0, X(3)=-1+j
The product of these two four point DFTs is
Ŷ(0)=36, Ŷ(1)=j4, Ŷ(2)=0, Ŷ(3)=-j4
The four point IDFT yields ŷ(n)={9,7,9,11}
We can verify as follows
We know that from the previous question y(n)={1,4,9,11,8,3}
ŷ(0)=y(0)+y(4)=9
ŷ(1)=y(1)+y(5)=7
ŷ(2)=y(2)=9
ŷ(3)=y(3)=11.
3. Overlap add and Overlap save are the two methods for linear FIR filtering a long sequence on a block-by-block basis
using DFT.
a) True
b) False
View Answer
Answer: a
Explanation: In these two methods, the input sequence is segmented into blocks and each block is processed via DFT
and IDFT to produce a block of output data. The output blocks are fitted together to form an overall output sequence
which is identical to the sequence obtained if the long block had been processed via time domain convolution. So,
Overlap add and Overlap save are the two methods for linear FIR filtering a long sequence on a block-by-block basis
using DFT.

4. In Overlap save method of long sequence filtering, what is the length of the input sequence block?
a) L+M+1
b) L+M
c) L+M-1
d) None of the mentioned
View Answer
Answer: c
Explanation: In this method, each data block consists of the last M-1 data points of the previous data block followed by L
new data points to form a data sequence of length N=L+M-1.

5. In Overlap save method of long sequence filtering, how many zeros are appended to the impulse response of the FIR
filter?
a) L+M
b) L
c) L+1
d) L-1
View Answer
Answer: d
Explanation: The impulse of the FIR filter is increased in length by appending L-1 zeros and an N-point DFT of the
sequence is computed once and stored.

6. The first M-1 values of the output sequence in every step of Overlap save method of filtering of long sequence are
discarded.
a) True
b) False
View Answer
Answer: a
Explanation: Since the data record of length N, the first M-1 points of ym(n) are corrupted by aliasing and must be
discarded. The last L points of ym(n) are exactly as same as the result from linear convolution.

7. In Overlap add method, what is the length of the input data block?
a) L-1
b) L
c) L+1
d) None of the mentioned
View Answer
Answer: b
Explanation: In this method the size of the input data block is L points and the size of the DFTs and IDFT is N=L+M-1.

8. Which of the following is true in case of Overlap add method?

a) M zeros are appended at last of each data block
b) M zeros are appended at first of each data block
c) M-1 zeros are appended at last of each data block
d) M-1 zeros are appended at first of each data block
View Answer
Answer: c
Explanation: In Overlap add method, to each data block we append M-1 zeros at last and compute N point DFT, so that
the length of the input sequence is L+M-1=N.
9. In which of the following methods, the input sequence is considered as shown in the below diagram?

a) Overlap save method

b) Overlap add method
c) Overlap add & save method
d) None of the mentioned
View Answer
Answer: a
Explanation: From the figure given, we can notice that each data block consists of the last M-1 data points of the
previous data block followed by L new data points to form a data sequence of length N+L+M-1 which is same as in the
case of Overlap save method.

10. In which of the following methods, the output sequence is considered as shown in the below diagram?

a) Overlap save method

b) Overlap add method
c) Overlap add & save method
d) None of the mentioned
View Answer
Answer: b
Explanation: From the figure given, it is clear that the last M-1 points of the first sequence and the first M-1 points of the
next sequence are added and nothing is discarded because there is no aliasing in the input sequence. This is same as
in the case of Overlap add method.

11. What is the value of x(n)*h(n), 0≤n≤11 for the sequences x(n)={1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} and h(n)={1,1,1} if we
perform using overlap add fast convolution technique?
a) {1,3,3,1,1,3,5,2,2,2,3,6}
b) {1,2,0,-3,4,2,-1,1,-2,3,2,1,-3}
c) {1,2,0,3,4,2,1,1,2,3,2,1,3}
d) {1,3,3,-1,1,3,5,2,-2,2,3,6}
View Answer
Answer: d
Explanation: Since M=3, we chose the transform length for DFT and IDFT computations as L=2 M=23=8.
Since L=M+N-1, we get N=6.
According to Overlap add method, we get
x1‘(n)={1,2,0,-3,4,2,0,0} and h'(n)={1,1,1,0,0,0,0,0}
y1(n)=x1‘(n)*N h'(n) (circular convolution)={1,3,3,-1,1,3,6,2}
x2‘(n)={-1,1,-2,3,2,1,0,0} and h'(n)={1,1,1,0,0,0,0,0}
y2(n) = x2‘(n)*N h'(n)={-1,0,-2,2,3,6,3,1}
Thus we get, y(n) = {1,3,3,-1,1,3,5,2,-2,2,3,6}.

12. What is the value of x(n)*h(n), 0≤n≤11 for the sequences x(n)={1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} and h(n)={1,1,1} if we
perform using overlap save fast convolution technique?
a) {1,3,3,-1,1,3,5,2,-2,2,3,6}
b) {1,2,0,-3,4,2,-1,1,-2,3,2,1,-3}
c) {1,2,0,3,4,2,1,1,2,3,2,1,3}
d) {1,3,3,1,1,3,5,2,2,2,3,6}
View Answer
Answer: a
Explanation: Since M=3, we chose the transform length for DFT and IDFT computations as L=2 M=23=8.
Since L=M+N-1, we get N=6.
According to Overlap save technique, we get
x1‘(n)={0,0,1,2,0,-3,4,2} and h'(n)={1,1,1,0,0,0,0,0}
=>y1(n)={1,3,3,-1,1,3}
x2‘(n)={4,2,-1,1,-2,3,2,1} and h'(n)={1,1,1,0,0,0,0,0}
=>y2(n)={5,2,-2,2,3,6}
=>y(n)= {1,3,3,-1,1,3,5,2,-2,2,3,6}.

Frequency Analysis of Signals Using DFT

1. If the signal to be analyzed is an analog signal, we would pass it through an anti-aliasing filter with B as the
bandwidth of the filtered signal and then the signal is sampled at a rate __________
a) Fs ≤ 2B
b) Fs ≤ B
c) Fs ≥ 2B
d) Fs = 2B
View Answer
Answer: c
Explanation: The filtered signal is sampled at a rate of Fs≥ 2B, where B is the bandwidth of the filtered signal to prevent
aliasing.

2. What is the highest frequency that is contained in the sampled signal?

a) 2Fs
b) Fs/2
c) Fs
d) None of the mentioned
View Answer
Answer: b
Explanation: We know that, after passing the signal through anti-aliasing filter, the filtered signal is sampled at a rate of
Fs≥ 2B=>B≤ Fs/2.Thus the maximum frequency of the sampled signal is Fs/2.

3. The finite observation interval for the signal places a limit on the frequency resolution.
a) True
b) False
View Answer
Answer: a
Explanation: After sampling the signal, we limit the duration of the signal to the time interval T 0=LT, where L is the
number of samples and T is the sample interval. So, it limits our ability to distinguish two frequency components that are
separated by less than 1/T0=1/LT in frequency. So, the finite observation interval for the signal places a limit on the
frequency resolution.

4. If {x(n)} is the signal to be analyzed, limiting the duration of the sequence to L samples, in the interval 0≤ n≤ L-1, is
equivalent to multiplying {x(n)} by?
a) Kaiser window
b) Hamming window
c) Hanning window
d) Rectangular window
View Answer
Answer: d
Explanation: The equation of the rectangular window w(n) is given as
w(n)=1, 0≤ n≤ L-1
=0, otherwise
Thus, we can limit the duration of the signal x(n) to L samples by multiplying it with a rectangular window of length L.

5. What is the Fourier transform of rectangular window of length L?

a) sin(ωL2)sin(ω2)ejω(L+1)/2
b) sin(ωL2)sin(ω2)ejω(L−1)/2
c) sin(ωL2)sin(ω2)e−jω(L−1)/2
d) None of the mentioned
View Answer
Answer: c
Explanation: We know that the equation for the rectangular window w(n) is given as
w(n)=1, 0≤ n≤ L-1
=0, otherwise
We know that the Fourier transform of a signal x(n) is given as
X(ω)=∑∞n=−∞x(n)e−jωn
=>W(ω)=∑L−1n=0e−jωn=sin(ωL2)sin(ω2)e−jω(L−1)/2

6. If x(n)=cosω0n and W(ω) is the Fourier transform of the rectangular signal w(n), then what is the Fourier transform of
the signal x(n).w(n)?
a) 1/2[W(ω-ω0)- W(ω+ω0)]
b) 1/2[W(ω-ω0)+ W(ω+ω0)]
c) [W(ω-ω0)+ W(ω+ω0)]
d) [W(ω-ω0)- W(ω+ω0)]
View Answer
Answer: b
Explanation: According to the exponential properties of Fourier transform, we get
Fourier transform of x(n).w(n)= 1/2[W(ω-ω0)+ W(ω+ω0)]

7. The characteristic of windowing the signal called “Leakage” is the power that is leaked out into the entire frequency
range.
a) True
b) False
View Answer
Answer: a
Explanation: We note that the windowed spectrum X^(w) is not localized to a single frequency, but instead it is spread
out over the whole frequency range. Thus the power of the original signal sequence x(n) that was concentrated at a
single frequency has been spread by the window into the entire frequency range. We say that the power has been
leaked out into the entire frequency range and this phenomenon is called as “Leakage”.

8. Which of the following is the advantage of Hanning window over rectangular window?
a) More side lobes
b) Less side lobes
c) More width of main lobe
d) None of the mentioned
View Answer
Answer: b
Explanation: The Hanning window has less side lobes and the leakage is less in this windowing technique.

9. Which of the following is the disadvantage of Hanning window over rectangular window?
a) More side lobes
b) Less side lobes
c) More width of main lobe
d) None of the mentioned
View Answer
Answer: c
Explanation: In the magnitude response of the signal windowed using Hanning window, the width of the main lobe is
more which is the disadvantage of this technique over rectangular windowing technique.

10. The condition with less number of samples L should be avoided.

a) True
b) False
View Answer
Answer: a
Explanation: When the number of samples L is small, the window spectrum masks the signal spectrum and,
consequently, the DFT of the data reflects the spectral characteristics of the window function. So, this situation should
be avoided

Efficient Computation of DFT FFT Algorithms – 1

1. Which of the following is true regarding the number of computations required to compute an N-point DFT?
a) N2 complex multiplications and N(N-1) complex additions
b) N2 complex additions and N(N-1) complex multiplications
c) N2 complex multiplications and N(N+1) complex additions
d) N2 complex additions and N(N+1) complex multiplications
View Answer
Answer: a
Explanation: The formula for calculating N point DFT is given as
X(k)=∑N−1n=0x(n)e−j2πkn/N
From the formula given at every step of computing we are performing N complex multiplications and N-1 complex
additions. So, in a total to perform N-point DFT we perform N 2 complex multiplications and N(N-1) complex additions.

2. Which of the following is true regarding the number of computations required to compute DFT at any one value of ‘k’?
a) 4N-2 real multiplications and 4N real additions
b) 4N real multiplications and 4N-4 real additions
c) 4N-2 real multiplications and 4N+2 real additions
d) 4N real multiplications and 4N-2 real additions
View Answer
Answer: d
Explanation: The formula for calculating N point DFT is given as
X(k)=∑N−1n=0x(n)e−j2πkn/N
From the formula given at every step of computing we are performing N complex multiplications and N-1 complex
additions. So, it requires 4N real multiplications and 4N-2 real additions for any value of ‘k’ to compute DFT of the
sequence.

3. WNk+N/2=?
a) WNk
b) -WNk
c) WN-k
d) None of the mentioned
View Answer
Answer: b
Explanation: According to the symmetry property, we get WNk+N/2=-WNk.

4. What is the real part of the N point DFT XR(k) of a complex valued sequence x(n)?
a) ∑N−1n=0[xR(n)cos2πknN–xI(n)sin2πknN]
b) ∑N−1n=0[xR(n)sin2πknN+xI(n)cos2πknN]
c) ∑N−1n=0[xR(n)cos2πknN+xI(n)sin2πknN]
d) None of the mentioned
View Answer
Answer: c
Explanation: For a complex valued sequence x(n) of N points, the DFT may be expressed as
XR(k)=∑N−1n=0[xR(n)cos2πknN+xI(n)sin2πknN]

5. The computation of XR(k) for a complex valued x(n) of N points requires _____________
a) 2N2 evaluations of trigonometric functions
b) 4N2 real multiplications
c) 4N(N-1) real additions
d) All of the mentioned
View Answer
Answer: d
Explanation: The expression for XR(k) is given as
XR(k)=∑N−1n=0[xR(n)cos2πknN+xI(n)sin2πknN]
So, from the equation we can tell that the computation of XR(k) requires 2N2 evaluations of trigonometric functions,
4N2 real multiplications and 4N(N-1) real additions.

6. Divide-and-conquer approach is based on the decomposition of an N-point DFT into successively smaller DFTs. This
basic approach leads to FFT algorithms.
a) True
b) False
View Answer
Answer: a
Explanation: The development of computationally efficient algorithms for the DFT is made possible if we adopt a divide-
and-conquer approach. This approach is based on the decomposition of an N-point DFT into successively smaller
DFTs. This basic approach leads to a family of computationally efficient algorithms known collectively as FFT
algorithms.

7. If the arrangement is of the form in which the first row consists of the first M elements of x(n), the second row consists
of the next M elements of x(n), and so on, then which of the following mapping represents the above arrangement?
a) n=l+mL
b) n=Ml+m
c) n=ML+l
d) none of the mentioned
View Answer
Answer: b
Explanation: If we consider the mapping n=Ml+m, then it leads to an arrangement in which the first row consists of the
first M elements of x(n), the second row consists of the next M elements of x(n), and so on.

8. If N=LM, then what is the value of WNmqL?

a) WMmq
b) WLmq
c) WNmq
d) None of the mentioned
View Answer
Answer: a
Explanation: We know that if N=LM, then WNmqL = WN/Lmq = W
M
mq
.

9. How many complex multiplications are performed in computing the N-point DFT of a sequence using divide-and-
conquer method if N=LM?
a) N(L+M+2)
b) N(L+M-2)
c) N(L+M-1)
d) N(L+M+1)
View Answer
Answer: d
Explanation: The expression for N point DFT is given as
X(p,q)=∑L−1l=0{WlqN[∑M−1m=0x(l,m)WmqM]}WlpL
The first step involves L DFTs, each of M points. Hence this step requires LM 2 complex multiplications, second require
LM and finally third requires ML2. So, Total complex multiplications = N(L+M+1).

10. How many complex additions are performed in computing the N-point DFT of a sequence using divide-and-conquer
method if N=LM?
a) N(L+M+2)
b) N(L+M-2)
c) N(L+M-1)
d) N(L+M+1)
View Answer
Answer: b
Explanation: The expression for N point DFT is given as
X(p,q)=∑L−1l=0{WlqN[∑M−1m=0x(l,m)WmqM]}WlpL
The first step involves L DFTs, each of M points. Hence this step requires LM(M-1) complex additions, second step do
not require any additions and finally third step requires ML(L-1) complex additions. So, Total number of complex
additions=N(L+M-2).

11. Which is the correct order of the following steps to be done in one of the algorithm of divide and conquer method?
i) Store the signal column wise
ii) Compute the M-point DFT of each row
iii) Multiply the resulting array by the phase factors WNlq.
iv) Compute the L-point DFT of each column.
v) Read the result array row wise.
a) i-ii-iv-iii-v
b) i-iii-ii-iv-v
c) i-ii-iii-iv-v
d) i-iv-iii-ii-v
View Answer
Answer: c
Explanation: According to one of the algorithm describing the divide and conquer method, if we store the signal in
column wise, then compute the M-point DFT of each row and multiply the resulting array by the phase factors W Nlq and
then compute the L-point DFT of each column and read the result row wise.

12. If we store the signal row wise then the result must be read column wise.
a) True
b) False
View Answer
Answer: a
Explanation: According to the second algorithm of divide and conquer approach, if the input signal is stored in row wise,
then the result must be read column wise.

13. If we store the signal row wise and compute the L point DFT at each column, the resulting array must be multiplied
by which of the following factors?
a) WNlq
b) WNpq
c) WNlq
d) WNpm
View Answer
Answer: d
Explanation: According to the second algorithm of divide and conquer approach, if the input signal is stored in row wise,
then we calculate the L point DFT of each column and we multiply the resulting array by the factor W Npm.

Efficient Computation of DFT FFT Algorithms – 2

1. If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even
numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimation-in-time algorithm.
a) True
b) False
View Answer
Answer: a
Explanation: Let us consider the computation of the N=2v point DFT by the divide and conquer approach. We select
M=N/2 and L=2. This selection results in a split of N point data sequence into two N/2 point data sequences f 1(n) and
f2(n) corresponding to the even numbered and odd numbered samples of x(n), respectively, that is
f1(n)=x(2n)
f2(n)=x(2n+1), n=0,1,2…N/2-1
Thus f1(n) and f2(n) are obtained by decimating x(n) by a factor of 2, and hence the resulting FFT algorithm is called a
decimation-in-time algorithm.

2. If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even
numbered and odd numbered samples of x(n) and F1(k) and F2(k) are the N/2 point DFTs of f1(k) and f2(k) respectively,
then what is the N/2 point DFT X(k) of x(n)?
a) F1(k)+F2(k)
b) F1(k)-WNk F2(k)
c) F1(k)+WNk F2(k)
d) None of the mentioned
View Answer
Answer: c
Explanation: From the question, it is given that
f1(n)=x(2n)
f2(n)=x(2n+1), n=0,1,2…N/2-1
X(k)=∑N−1n=0x(n)WknN, k=0,1,2..N-1
=∑nevenx(n)WknN+∑noddx(n)WknN
=∑(N2)−1m=0x(2m)W2kmN+∑(N2)−1m=0x(2m+1)Wk(2m+1)N
=∑(N2)−1m=0f1(m)WkmN/2+WkN∑(N/2)−1m=0f2(m)Wkm(N2)
X(k)=F1(k)+ WNk F2(k).

3. If X(k) is the N/2 point DFT of the sequence x(n), then what is the value of X(k+N/2)?
a) F1(k)+F2(k)
b) F1(k)-WNk F2(k)
c) F1(k)+WNk F2(k)
d) None of the mentioned
View Answer
Answer: b
Explanation: We know that, X(k) = F1(k)+WNk F2(k)
We know that F1(k) and F2(k) are periodic, with period N/2, we have F1(k+N/2) = F1(k) and F2(k+N/2)= F2(k). In addition,
the factor WNk+N/2 = -WNk.
Thus we get, X(k+N/2)= F1(k)- WNk F2(k).

4. How many complex multiplications are required to compute X(k)?

a) N(N+1)
b) N(N-1)/2
c) N2/2
d) N(N+1)/2
View Answer
Answer: d
Explanation: We observe that the direct computation of F1(k) requires (N/2)2 complex multiplications. The same applies
to the computation of F2(k). Furthermore, there are N/2 additional complex multiplications required to compute W Nk.
Hence it requires N(N+1)/2 complex multiplications to compute X(k).

5. The total number of complex multiplications required to compute N point DFT by radix-2 FFT is?
a) (N/2)log2N
b) Nlog2N
c) (N/2)logN
d) None of the mentioned
View Answer
Answer: a
Explanation: The decimation of the data sequence should be repeated again and again until the resulting sequences
are reduced to one point sequences. For N=2v, this decimation can be performed v=log2N times. Thus the total number
of complex multiplications is reduced to (N/2)log 2N.

6. The total number of complex additions required to compute N point DFT by radix-2 FFT is?
a) (N/2)log2N
b) Nlog2N
c) (N/2)logN
d) None of the mentioned
View Answer
Answer: b
Explanation: The decimation of the data sequence should be repeated again and again until the resulting sequences
are reduced to one point sequences. For N=2v, this decimation can be performed v=log2N times. Thus the total number
of complex additions is reduced to Nlog2N.

7. The following butterfly diagram is used in the computation of __________

a) Decimation-in-time FFT
b) Decimation-in-frequency FFT
c) All of the mentioned
d) None of the mentioned
View Answer
Answer: a
Explanation: The above given diagram is the basic butterfly computation in the decimation-in-time FFT algorithm.

8. For a decimation-in-time FFT algorithm, which of the following is true?

a) Both input and output are in order
b) Both input and output are shuffled
c) Input is shuffled and output is in order
d) Input is in order and output is shuffled
View Answer
Answer: c
Explanation: In decimation-in-time FFT algorithm, the input is taken in bit reversal order and the output is obtained in the
order.
9. The following butterfly diagram is used in the computation of __________

a) Decimation-in-time FFT
b) Decimation-in-frequency FFT
c) All of the mentioned
d) None of the mentioned
View Answer
Answer: b
Explanation: The above given diagram is the basic butterfly computation in the decimation-in-frequency FFT algorithm.

10. For a decimation-in-time FFT algorithm, which of the following is true?

a) Both input and output are in order
b) Both input and output are shuffled
c) Input is shuffled and output is in order
d) Input is in order and output is shuffled
View Answer
Answer: d
Explanation: In decimation-in-frequency FFT algorithm, the input is taken in order and the output is obtained in the bit
reversal order.

Applications of FFT Algorithms

1. FFT algorithm is designed to perform complex operations.
a) True
b) False
View Answer
Answer: a
Explanation: The FFT algorithm is designed to perform complex multiplications and additions, even though the input
data may be real valued. The basic reason for this is that the phase factors are complex and hence, after the first stage
of the algorithm, all variables are basically complex valued.

2. If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as
x(n)=x1(n)+jx2(n), 0≤n≤N-1, then what is the value of x1(n)?
a) x(n)−x∗(n)2
b) x(n)+x∗(n)2
c) x(n)−x∗(n)2j
d) x(n)+x∗(n)2j
View Answer
Answer: b
Explanation: Given x(n)=x1(n)+jx2(n)
=>x*(n)= x1(n)-jx2(n)
Upon adding the above two equations, we get x1(n)=x(n)+x∗(n)2.
3. If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as
x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the value of x2(n)?
a) x(n)−x∗(n)2
b) x(n)+x∗(n)2
c) x(n)+x∗(n)2j
d) x(n)−x∗(n)2j
View Answer
Answer: d
Explanation: Given x(n)=x1(n)+jx2(n)
=>x*(n) = x1(n)-jx2(n)
Upon subtracting the above two equations, we get x2(n)=x(n)−x∗(n)2j.

4. If X(k) is the DFT of x(n) which is defined as x(n)=x 1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of x1(n)?
a) 12[X∗(k)+X∗(N−k)]
b) 12[X∗(k)−X∗(N−k)]
c) 12j[X∗(k)−X∗(N−k)]
d) 12j[X∗(k)+X∗(N−k)]
View Answer
Answer: a
Explanation: We know that if x(n)=x1(n)+jx2(n) then x1(n)=x(n)+x∗(n)2
On applying DFT on both sides of the above equation, we get
X1(k)=12DFT[x(n)]+DFT[x∗(n)]
We know that if X(k) is the DFT of x(n), the DFT[x*(n)]=X*(N-k)
=>X1(k)=12[X∗(k)+X∗(N−k)].

5. If X(k) is the DFT of x(n) which is defined as x(n)=x 1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of x1(n)?
a) 12[X∗(k)+X∗(N−k)]
b) 12[X∗(k)−X∗(N−k)]
c) 12j[X∗(k)−X∗(N−k)]
d) 12j[X∗(k)+X∗(N−k)]
View Answer
Answer: c
Explanation: We know that if x(n)=x1(n)+jx2(n) then x2(n)=x(n)−x∗(n)2j.
On applying DFT on both sides of the above equation, we get
X2(k)=12jDFT[x(n)]−DFT[x∗(n)]
We know that if X(k) is the DFT of x(n), the DFT[x*(n)]=X*(N-k)
=>X2(k)=12j[X∗(k)−X∗(N−k)].

6. If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k),
k=0,1,2…N-1?
a) X1(k)-W2kNX2(k)
b) X1(k)+W2kNX2(k)
c) X1(k)+W2kX2(k)
d) X1(k)-W2kX2(k)
View Answer
Answer: b
Explanation: Given g(n) is a real valued 2N point sequence. The 2N point sequence is divided into two N point
sequences x1(n) and x2(n)
Let x(n)=x1(n)+jx2(n)
=> X1(k)=12[X∗(k)+X∗(N−k)] and X2(k)=12j[X∗(k)−X∗(N−k)]
We know that g(n)=x1(n)+x2(n)
=>G(k)=X1(k)+W2kNX2(k), k=0,1,2…N-1.

7. If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k),
k=N,N-1,…2N-1?
a) X1(k)-W2kX2(k)
b) X1(k)+W2kNX2(k)
c) X1(k)+W2kX2(k)
d) X1(k)-W2kNX2(k)
View Answer
Answer: d
Explanation: Given g(n) is a real valued 2N point sequence. The 2N point sequence is divided into two N point
sequences x1(n) and x2(n)
Let x(n)=x1(n)+jx2(n)
=> X1(k)=12[X∗(k)+X∗(N−k)] and X2(k)=12j[X∗(k)−X∗(N−k)]
We know that g(n)=x1(n)+x2(n)
=>G(k)=X1(k)-W2kNX2(k), k=N,N-1,…2N-1.

8. Decimation-in frequency FFT algorithm is used to compute H(k).

a) True
b) False
View Answer
Answer: a
Explanation: The N-point DFT of h(n), which is padded by L-1 zeros, is denoted as H(k). This computation is performed
once via the FFT and resulting N complex numbers are stored. To be specific we assume that the decimation-in
frequency FFT algorithm is used to compute H(k). This yields H(k) in the bit-reversed order, which is the way it is stored
in the memory.

9. How many complex multiplications are need to be performed for each FFT algorithm?
a) (N/2)logN
b) Nlog2N
c) (N/2)log2N
d) None of the mentioned
View Answer
Answer: c
Explanation: The decimation of the data sequence should be repeated again and again until the resulting sequences
are reduced to one point sequences. For N=2v, this decimation can be performed v=log2N times. Thus the total number
of complex multiplications is reduced to (N/2)log 2N.

10. How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?
a) (N/2)logN
b) 2Nlog2N
c) (N/2)log2N
d) Nlog2N
View Answer
Answer: b
Explanation: The number of additions to be performed in FFT are Nlog 2N. But in linear filtering of a sequence, we
calculate DFT which requires Nlog2N complex additions and IDFT requires Nlog2N complex additions. So, the total
number of complex additions to be performed in linear filtering of a sequence using FFT algorithm is 2Nlog 2N.

11. How many complex multiplication are required per output data point?
a) [(N/2)logN]/L
b) [Nlog22N]/L
c) [(N/2)log2N]/L
d) None of the mentioned
View Answer
Answer: b
Explanation: In the overlap add method, the N-point data block consists of L new data points and additional M-1 zeros
and the number of complex multiplications required in FFT algorithm are (N/2)log 2N. So, the number of complex
multiplications per output data point is [Nlog22N]/L.