Preparatory Guidebook For Comprehensive Examination: N JWN

Preparatory Guidebook for Comprehensive Examination
QUESTION BANK
DSP
The Z-Transform can be used to solve:

A. Difference equations
B. Mathematical tools
C. DFT
D. FFT
One sided Z-transform contains information about the signal x (n) for negative values of time:
A. True
B. False
The Poles of a Z-Transform X (z) are the values of Z for which X (z) = 0. (infinity)
A. True
B. False
The zero of a Z-Transform X (z) is the values of Z for which X (z) = .
A. True
B. False
Unit sample response h (n) is the response to:

A.  (n)
B. b U (n)
C. a nU (n)
D. e jwnU (n)
Sampling in frequency domain can be done using:

A. DFT
B. Z-Transform
C. Laplace Transform
D. none of the above
FFT can be used to solve the DFT at a much higher speed.

A. True
B. False
To compute DFT requires:

A. N/2 additions
B. First order differential equation
C. N2 multiplications and additions
D. Time domain
To compute FFT requires:

A. N/2log2N computations
B. First order differential equation
C. N2 multiplications and additions
D. Time domain
Linear filtering, correlation and spectrum analysis are all Applications of:
A. FFT
B. X (ω)
C. H (ω)
D. DTFT
x (n-k) represents:
A. Time reversal by k
B. Scaling by k
C. Time delay by a factor of k
x (k) is a sampled version of X(Z).

A. True
B. False
FFT is a technique to solve DTFT efficiently.

A. True
B. False
Digital signal processing is achieved by using analogue components such as:

Resistors, Capacitors, Inductors.
A. True
B. False
DSP processors cannot perform tasks in real-time.

A. True
B. False
The Sum of Products (SOP) is the key element in most DSP algorithms.
A. True
B. False
The distribution of Energy in the signal is called the spectral density of the waveform.
A. True
B. False
In DSP, to measure the similarity between two different signals _______ can be used.
A. Auto Correlation
B. Cross correlation
C. Convolution
The primary application of DFT is to approximate the Fourier Transform of Signals.

A. True
B. False
The Z-Transform is used to define transfer functions:

A. True
B. False
Given the sequence x (n), its Z-Transform is:


A. X (z)= 
n  
x(n) .z-n

B. X (z)= 
n  
x (z) .z-n

C. X (z) = 
n  
x (w) .z-n
x (-n)  X(z-1) is:

A. Time reversal property
B. Scaling Property
C. Time shifting
A major practical consideration when computing the DFT is its speed.)

A. True
B. False
N 1
X (k) =  x (n) .e-j2  kn/N
is an expression to find DFT. The letter ‘N’ represents:
n 0
A. Total number of samples
B. Order
C. Period
D. domain
X (k) is a sampled version of X (  ).

A. True
B. False
FFT is a technique to solve DFT efficiently.

A. True
B. False
Radix-2 algorithms are the most widely used FFT algorithm.

A. True
B. False
When the number of data points N in the DFT is a power of 4, we can always use a radix-4
algorithm for the computation. However, it is more efficient computationally to employ a radix-2
FFT algorithm.
A. True
B. False
FFT algorithm can also be used to compute the IDFT. Use ifft!
A. True
B. False
Application of FFT includes linear filtering, correlation and spectrum analysis.
A. True
B. False
FFT algorithms are used for computing the DFT when the size N is a power of 2 and when it is a
power of 4.
A. True
B. False
Analogue signal processing is achieved by using analogue components such as:

Resistors, Capacitors and Inductors.
A. True
B. False
Efficient Sum of Products (SOP) calculation requires hardware multiplier and adder.
A. True
B. False
Sum of Product computations in DSPs are called MAC (Multiply and Accumulate) operation.
A. True
B. False
Answer: A
DSP processors are optimized to perform multiplication, division and addition operations.
A. True
B. False
The process of converting a signal from one rate to another is called “sample rate conversion.
A. True
B. False
The basic operations employed in sampling rate alteration process are called “Up-sampling” and
“down-sampling”
A. True
B. False
Unit Step Response mean y (n) when input is U (n), is S(t)

A. True
B. False
Response means output y (n) when input is x (n)

A. True
B. False
The N-point DFT of a finite length sequence x[n], defined for is given by 0  n  N  1
N 1
.
X [ k ]   x[ n]e j 2kn / N
n 0
A. True
B. False
A periodic signal having finite power is called ESD.

A. True
B. False

Preparatory Guidebook For Comprehensive Examination: N JWN

Uploaded by

Preparatory Guidebook For Comprehensive Examination: N JWN

Uploaded by

Preparatory Guidebook for Comprehensive Examination

The Z-Transform can be used to solve:

Unit sample response h (n) is the response to:

Sampling in frequency domain can be done using:

FFT can be used to solve the DFT at a much higher speed.

To compute DFT requires:

To compute FFT requires:

x (k) is a sampled version of X(Z).

FFT is a technique to solve DTFT efficiently.

Digital signal processing is achieved by using analogue components such as:

DSP processors cannot perform tasks in real-time.

The primary application of DFT is to approximate the Fourier Transform of Signals.

The Z-Transform is used to define transfer functions:

Given the sequence x (n), its Z-Transform is:

x (-n)  X(z-1) is:

A major practical consideration when computing the DFT is its speed.)

X (k) is a sampled version of X (  ).

FFT is a technique to solve DFT efficiently.

Radix-2 algorithms are the most widely used FFT algorithm.

Analogue signal processing is achieved by using analogue components such as:

Unit Step Response mean y (n) when input is U (n), is S(t)

Response means output y (n) when input is x (n)

A periodic signal having finite power is called ESD.

You might also like