Jacome Sebastian 10
Jacome Sebastian 10
ELECTRNICA
PROCESAMIENTO DIGITAL DE SEALES
NRC:2687
Deber: 10
4 de julio de 2016
1
Procesamiento Digital de Seales Segundo Parcial
Deber N 10
La FFT
1. Let x[n] be a sequence of length 1024 that is to be convolved with a sequence h[n] de la
longitud L. of length L. For what values of L is it more ecient to perform the convolution
directly than it is to perform the convolution by taking the inverse DFT of the product
X[k]H[k] and evaluating the DFTs using a radix-2 FFT algorithm?
N =P +L1
N = 1024 1 + L N 1023 + L
N
log2 (N ) = M.L
2
1023 + L
log2 (1023 + L) = 1024L
2
(1023 + L)log2 (1023 + L) = 2048L
2048L
log2 (1023 + L) =
(1023 + L)
L < 33
2. Suppose that we have a 1025-point data sequence 1025 (1 more than N = 210 ) 210). Instead
of discarding the nal value, we zero pad the sequence to make it of length N = 211 so that
we can use a radix-2 FFT algorithm.
a ) How many multiplications and additions are required to compute the DFT using a
radix-2 FFT algorithm?
b ) How many multiplications and additions would be required to compute a 1025-point
DFT directly?
# de mariposas= N log2 N
= 2048log2 (2048)
= 22 528
2 Jcome Sebastin
Procesamiento Digital de Seales Segundo Parcial
X(n) X(n)
000 000
001 100
002 200
010 010
011 110
012 210
020 020
4. How many complex multiplications are necessary in a radix-3 decimation-in-frequency FFT?
3 Jcome Sebastin
Procesamiento Digital de Seales Segundo Parcial
5. How many complex multiplications are required for a 12-point prime factor FFT with N1 = 4
and N2 = 3 if we do not count multiplications by 1 and j?
N1 = A = 4 N2 = 3
N3 = 3 = N2 N21 N1
N22 ln(N1 ) = C
N4 = 1 = N1 N11 N2
N22 ln(N1 ) = B
4 Jcome Sebastin
Procesamiento Digital de Seales Segundo Parcial
(
0 n1 3
n = (n1 + 4n2 )N
n2 0
(
0 k1 3
k = (3k1 + 22k2 )N
k2 0
n2 / n1 0 1 2 3 4
0
1 4 de 8 puntos
2
k2 k1 0 1 2 3
0
1 8 de 4 puntos
2
Cada 3 puntos la DFT requiere 3 multiplicaciones complejas
Cada 4 puntos la DFT requiere 24 multiplicaciones complejas
3 2 4 = 24
6. How many complex multiplications are required for a 15-point prime factor FFT if we do
not count multiplications by 1?
N1 = 3 N2 = 5
(
0 n1 4
n = 3n1 + n2
0 n2 4
(
0 k1 4
k = k1 + 5k2
0 k2 2
n2 n1 0 1 2 3 4
0 x(0) x(3) x(6) x(9) x(12)
1 x(1) x(4) x(7) x(10) x(13)
2 x(2) x(5) x(8) x(11) x(14)
5 Jcome Sebastin
Procesamiento Digital de Seales Segundo Parcial
Generando la matriz
1 1 1 1 1
1 w15 (w15 )2 (w15 )3 (w15 )4
1 (w15 )5 (w15 )6 (w15 )7 (w15 )8
k2 k1 0 1 2 3 4
0 x(0) x(3) x(6) x(9) x(12)
1 x(1) x(4) x(7) x(10) x(13)
2 x(2) x(5) x(8) x(11) x(14)
= Cada 5 puntos la DT F
15 + 3(4) = 27
27Ln7 ' 90
Multiplicaciones Complejas
7. Determine the basic cell of a radix-5 algorithm. Analyze the possible simplications in the
graph of the cell.
6 Jcome Sebastin
Procesamiento Digital de Seales Segundo Parcial
8. Show that the number of complex multiplications of the FFT algorithm for generic N is
given by:
M (N ) = N (N1 + N2 + ... + Nl1 + Nl l)
X1
N2l X1
N2l X1
N2l
mN k+(N1 1)k
mN1 k mN1 k+k
X(k) = x(N1 m)WN + x(N1 m+1)WN +....+ x(N1 m+N1 1)WN 1
m=0 m=0 m=0
X1
N2l X1
N2l
X(k) = x(N1 m)WNmk
2l
+ x(N1 m + 1)WNmk
2l
m=0 m=0
X1
N2l
+WN2k x(N1 m + 2)WNmk
2l
+ ....
m=0
(N 1)k
X1
N2l
+WN 1 x(N1 m + N1 1)WNmk
2l
m=0
N
X1 1 X1
N2l
X(k) = WNrk x(N1 m + r)WNmk
2l 1
r=0 m=0
7 Jcome Sebastin