You are on page 1of 2

Asan Memorial College of Engineering and Technology

11.

Department of ECE

i) An 8 point sequence is given by x(n) = {2,1,2,1,1,2,1,2}.


Compute 8-point DFT of x(n) by radix-2 DIT-FFT

EC6502 - Principles of Digital Signal Processing

(10)

Internal Assessment 1
Date:26/07/16

ii) Perform the linear convolution of the following sequences by


Total Marks - 50

overlap save method x(n)={1,2,3,-1,-2,-3,4,5,6}, h(n)={2,1,-1} (6)

Part A - 18 Marks

1.

What is twiddle factor?

2.

What is zero padding? What are its uses?

3.

Find the 4 point DFT of sequence x(n) = {1, 1, -1, -1}.

4.

What is meant by bit reversal?

5.

How many multiplications and additions are involved in

Asan Memorial College of Engineering and Technology


Department of ECE
EC6502 - Principles of Digital Signal Processing
Internal Assessment 1
Date:26/07/16

radix-2 FFT?

Total Marks - 50
Part A - 18 Marks

6.

Compare the DIT and DIF radix-2 FFT.

1.

What is twiddle factor?

7.

What is FFT?

2.

What is zero padding? What are its uses?

8.

Define DFT of a discrete time sequence.

3.

Find the 4 point DFT of sequence x(n) = {1, 1, -1, -1}.

9.

Find the IDFT of Y(K) = {1, 0, 1, 0}

4.

What is meant by bit reversal?

5.

How many multiplications and additions are involved in

Part B - 32 Marks

10. i) Explain any two properties of DFT.

radix-2 FFT?

(04)

ii) Explain Radix 2 8 point DIF FFT Algorithm using flow


graph.

(12)

6.

Compare the DIT and DIF radix-2 FFT.

7.

What is FFT?

8.

Define DFT of a discrete time sequence.

9.

Find the IDFT of Y(K) = {1, 0, 1, 0}

Part B - 32 Marks

10. i) Explain any two properties of DFT.

(04)

ii) Explain Radix 2 8 point DIF FFT Algorithm using flow


graph.

11.

(12)

i) An 8 point sequence is given by x(n) = {2,1,2,1,1,2,1,2}.


Compute 8-point DFT of x(n) by radix-2 DIT-FFT
(10)

ii) Perform the linear convolution of the following sequences by overlap


save method x(n)={1,2,3,-1,-2,-3,4,5,6}, h(n)={2,1,-1}

(6)

You might also like