Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Discrete Time Signal Processing > Term Test > Flashcards

Term Test Flashcards

1
Q

DFT is applied to

a) Infinite sequences
b) Finite discrete sequences
c) Continuous infinite signals
d) Continuous finite sequences

A

Finite discrete sequences

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The circular convolution of two sequences in the time domain is equivalent to

a) Multiplication of DFTs of two sequences
b) Summation of DFTs of two sequences
c) Difference of DFTs of two sequences
d) Square of multiplication of DFTs of two sequences

A

Multiplication of DFTs of two sequences

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is value of twiddle factor______________

a) ej2πN
b) e-j2πN
c) e-j2π/N
d) ej2π/N

A

e^-j2π/N

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Which of the following is true regarding the number of computations required to compute an N-point DFT?

a) N2complex multiplications and N(N-1) complex additions
b) N2complex additions and N(N-1) complex multiplications
c) N2complex multiplications and N(N+1) complex additions
d) N2complex additions and N(N+1) complex multiplications

A

N2 complex multiplications and N(N-1) complex additions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

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

a) 2
b) 4
c) 8
d) 16

A

8

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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

A

Input is shuffled and output is in order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

For a decimation-in-frequency 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

A

Input is in order and output is shuffled

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

FFT algorithm is designed to perform complex operations.

a) True
b) False

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

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) aX1(k)-bX2(k)

A

aX1(k)+bX2(k)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

In Overlap add method, what is the length of the input data block?

a) L-1
b) L
c) L+1
d) 1/L

A

L

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

DIT algorithm divides the sequence into

a. Positive and negative values
b. Even and odd samples
c. Upper higher and lower spectrum
d. Small and large samples

A

Even and odd samples

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

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}

A

{6, -2+2j, -2, -2-2j}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

The twiddle factor satisfies

a) wkN= wkN/2
b) wk+N/2 N= wkN
c) wk+N N= -wkN
d) wk+N/2 N= -wk N

A

wk+N/2 N= -wk N

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Find the IDFT of the given sequence X (k) = {2, 2-3j, 2+3j, -2}

a) [1, -0.75-j, 1+1.5j, 0.75+1.75j]
b) [1, 0.75+j, 1-1.5j, -0.75-1.75j]
c) [1, 0.75+j, 1+1.5j, -0.75-1.75j]
d) [1, -0.75+j, 1+1.5j, -0.75-1.75j]

A

Dk

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

15) 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

A

M-1 zeros are appended at last of each data block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The IIR filter designing involves

a) Designing of an analog filter in analog domain and transforming into digital domain
b) Designing of digital filter in analog domain and transforming into digital domain
c) Designing of analog filter in digital domain and transforming into analog domain
d) Designing of digital filter in digital domain and transforming into analog domain

A

Designing of digital filter in analog domain and transforming into digital domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

For a system function H(s) to be stable

a) zeros lie in left half of the s plane
b) The zeros lie in right half of the s plane
c) The poles lie in left half of the s plane
d) The poles lie in right half of the s plane

A

The poles lie in left half of the s plane

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

What is the duration of the unit sample response of a digital filter?

a) Finite
b) Infinite
c) Impulse (very small)
d) Zero

A

Infinite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

The transformation technique in which there is one to one mapping from s domain to z-domain is

a) Approximation of derivatives
b) Impulse invariance method
c) Bilinear transformation method
d) Backward difference for the derivative

A

Bilinear transformation method

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

When σ=0, then what is the condition on ‘r’?

a) r=0
b) r=1
c) 0

A

r=1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Which of the following is the correct relation between ω and Ω?

a) Ω=ωT
b) T=Ωω
c) ω=ΩT
d) ω=Ω

A

ω=ΩT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

When σ>0, then what is the condition on ‘r’?

a) r=0
b) r>1
c) 0

A

r>1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

When σ<0, then what is the condition on ‘r’?

a) r=0
b) r<1
c) r>0
d) None of the mentioned

A

r<1

24
Q

If the conversion technique is to be effective, then the LHP of s-plane should be mapped into _____________

a) Outside of unit circle
b) Unit circle
c) Inside unit circle
d) Does not matter

A

Inside unit circle

25
Q

Which of the following rules is used in the bilinear transformation?

a) Simpson’s rule
b) Backward difference
c) Forward difference
d) Trapezoidal rule

A

Trapezoidal rule

26
Q

11) Which of the following substitutions is done in Bilinear transformations?
a) s = 2/T[z-1/z+1]
b) s = 2T[1+z/1-z]
c) s = 2/T[z+1/z-1]
d) s = T/2[z+1/z-1]

A

s = 2/T[z-1/z+1]

27
Q

In IIR Filter design by the Bilinear Transformation, the Bilinear Transformation is a mapping from

a) Z-plane to S-plane
b) S-plane to Z-plane
c) S-plane to J-plane
d) J-plane to Z-plane

A

S-plane to Z-plane

28
Q 
Which of the following defines a Chebyshev polynomial of order N, TN(x)? 
a) cos (Ncos-1x) for all x 
b) cosh (Ncosh-1x) for all x 
c) cos (Ncos-1x), |x|<1 
 cosh (Ncosh-1x), |x|>1 
d) cosh (Ncos-1x) for all x
A

cos (Ncos-1x), |x|<1

cosh (Ncosh-1x), |x|>1

29
Q

The Low pass Chebyshev type-1 filters have

a) Flat pass band
b) Equiripple stop band
c) Equiripple pass band
d) Tapering stop band

A

Equiripple pass band

Not sure

30
Q

The impulse invariant method is obtained by

a) Sampling the impulse response of an equivalent analog filter
b) Taking backward difference for the derivative
c) Mapping from s-domain to z-domain
d) Approximation of derivatives

A

Sampling the impulse response of an equivalent analog filter

31
Q

The computational procedure for Decimation in frequency algorithm takes

a) Log2 N stages
b) Log2 N/2 stages
c) 2 Log2 N stages
d) Log2 N2 stages

A

Log2 N stages

32
Q

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,7,9,14}
b) {14,16,14,16}
c) {9,7,9,11}
d) {14,14,16,16}

A

{9,7,9,11}

33
Q

In Overlap save method of long sequence filtering, what is the length of the input sequence block?

a) L
b) L-1
c) L+M-1
d) L+M

A

L+M-1

34
Q

In Overlap save method of long sequence filtering, how many zeros are appended to the impulse response of the FIR filter?

a) L-1
b) L
c) L+1
d) L+M-1

A

L-1

35
Q

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

36
Q

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)-WNk F2(k)

37
Q

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

a) {14,16,14,16}
b) {9,7,9,7}
c) {14,14,16,16}

A

{14,16,14,16}

38
Q

f X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)?

A

X*(N-k)

39
Q

The similarity between the Fourier transform and the z transform is that

a) Both convert discrete time domain to frequency spectrum domain
b) Both convert discrete frequency domain to time spectrum domain
c)

A

Both convert discrete time domain to frequency spectrum domain

40
Q

The Nth rot of unity WN is given as ______________

A

e-j2π/N

41
Q

In Signal Processing ,the conditioner block is required ____

(a) to filter, to demodulate , to amplify the Signal.
(b) to demodulate
(c) to amplify the Signal
(d) to filter, to demodulate

A

(a) to filter, to demodulate , to amplify the Signal.

42
Q

Special Instructions provided by DSP chip are:

a) Reduced overhead instructions
(b) Basic instructions
(c) Application based instructions
(d) (a),(b),(c

A

(a),(b),(c)

43
Q

Which pair of instruction support simultaneous loading of data into temp. register and data shifting

(a) RTP, NM1
(b) LTM,PPT
(c) LTD.MPY
(d) MACD, HNM1

A

LTD.MPY

44
Q

The block B0 of DARAM on chip size is

(a) 32× 16 bit data
(b) 512× 16 bit program
(c) 512× 16 bit data
(d) 512× 16 bit data /program

A

512× 16 bit data /program

45
Q

CBSR1 stands for

(a) Circular buffer 2 start register
(b) Circular buffer 1start register
(c) Circular buffer 1end register
(d) Circular buffer 2 end register

A

Circular buffer 1start register

46
Q

In status register 1 of TMS320C5x OVM bit rest value is

(a) 0
(b) 1
(c) X
(d) Nc.

A

X

47
Q

ARAU is a part of which area of architecture of TMS320C5x

(a) Memory
(b) Peripherals
(c) CPU
(d) Busses

A

CPU

48
Q

Types of architecture of DSP

a) Von Neumann
(b) Harward
(c) Super Harward
(d) (a),(b),(c

A

(a),(b),(c)

49
Q

Important aspects of optimizing SHARC are

(a) I/O Controller , instruction Cache
(b) On chip peripherals , I/O chip
(c) Specialized Addressing Modes , I/O Controller
(d) Specialized program code , On chip peripherals

A

I/O Controller , instruction Cache

50
Q

The technique that allows 1 or more operations to overlap during execution is known as

(a) Instruction Cache
(b) On chip peripherals
(c) Pipelining
(d) Specialized program

A

Pipelining

51
Q

Typical DSP MAC computes _______ product

(a) 8bit
(b) 32bit
(c) 16bit
(d) 28bit

A

32bit

52
Q

TMS320C5x family of processor consist of ____ types of on-chip memory

(a) 2
(b) 3
(c) 1
(d) 8

A

3

53
Q

The architecture of TMS320C5x is broadly classified in ____ major areas.

(a) 4
(b) 2
(c) 3
(d) 5

A

3

54
Q

Name the techniques to achieve extended parallelism

(a) SIMD, SSP, SMP
(b) SIMD, VLIW, SSP
(c) VLIM,SMP
(d) VLIM , SSP

A

SIMD, VLIW, SSP

55
Q

How many methods are there to slow down the processor by adding wait states

(a) 2
(b) 3
(c) 1
(d) 4

A

2

Discrete Time Signal Processing (7 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions