AssignmentDocument
AssignmentDocument
Summary
1
Part 1
1. Read in the list of values in your input file, noting the number N1 ,
the number of values in each signal in your data. The following steps
will be set out for x1 but must be done for each of the four signals
you have, x1 to x4 .
2. For the first signal in your data, x1 [n], calculate the DFT of the signal
x1 [n] for N2 = N1 . The result of your calculation should be a list of
values in a file. Explain in your program comments or elsewhere in
your submission how your program handles the complex values of
the transform x
c1 [k].
Part 2
• y1 [0] = x1 [0]
• y1 [1] = 1
x1 [0] + x1 [1] ,
2
• y1 [2] = 1
x1 [0] + x1 [1] + x1 [2] ,
3
• y1 [3] = 1
x1 [0] + x1 [1] + x1 [2] + x1 [3] ,
4
• y1 [N1 − 4] = 1
4 x1 [N1 − 4] + x1 [N1 − 3] + x1 [N1 − 2] + x1 [N1 − 1]
• y1 [N1 − 3] = 1
3 x1 [N1 − 3] + x1 [N1 − 2] + x1 [N1 − 1]
• y1 [N1 − 2] = 1
2 x1 [N1 − 2] + x1 [N1 − 1]
2. Calculate the DFT of the signal y1 [n] for both values of the length of
the record N2 .
Part 3
You should now have data files with the signal x1 , the smoothed signal
y1 and the transforms of both signals for lengths of record N1 and 2N1 .
2. Draw plots of |c
x1 [k]| and arg(c
x1 [k]), where |z| represents the modulus
of the complex number z and arg(z) is the argument of z. So if r = |z|
and A = arg(z) then z = rejA .
4. Draw a plot of the real and complex components of transform yb1 [k].
6. Explain what the transform you have calculated is telling you about
the signal x1 . Consider the meaning of the Fourier Transform and
its link to the idea of a spectrum in answering this question.