Question

Problem 5 (score 30%) You are given a final sequence of N samples of a time signal sampled withk samples/sec. a) Define the Discrete Fourier-Transform (DFT) and inverse DFT of the sequence. Are there any restrictions on the samples? b) Define the z-transform of the sequence c) d) Sketch a block-diagram of a recursive, digital filter and relate the filter-coefficients to the z-transform of the sequence.

Answer 1

$ignat sampled ple 4p samples/sec Given N sam Time with K wi th deals that a thans foum DFT the It discrete finite signal fvequencies fvequeney and a bmo finite discote number That aue 27 K N-1 K= 0, 1, 2 N O 1 L-1 Limited to time signal that is FOA inbo all the contain heguoncies N L above the zecoves ie can the -Romahion in we N-1 from x(n) KD with deals that inverse DFT thans foum It is fom ignal feguancias which time coninous discuete Jurtn N-L X(u9)e n = 0, 1 2. N-1. x(t.) KeO he nestnchon be on mere should DF T b mteger only should be somple me Samples re valid Thans form Yammaj: Disaete number feguoncies number integer for Z TRANSFORM C Z-tvansfoam the signal xn] finite lengt Given a defmed X(z) as 15 Z x(K) -K k O

Shore [o, N and sencesuppot any complex tha Interval is uonce Z is rumber Z -domain to Than way Bsvo Aepre sented domain time Cas K 11 x() d(n-k) X(z) x(n) KEO Ko diagtay Block 6ltea Digital Recursive R 7 aymi digital filter a in 4Fead back implomanted Example dolay AAst ouder One egaudled signal with coefficiant ven by be Con trans foum The poly nomial ignal samples in ts o n < 2 nt L x(n) oherwise tvans foun has - 2 x (z) + 2z + 3z fom digital In this he aet i lter