Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
38 views1 page

第二次小考

The document is an exam paper for a course on signals and systems, detailing various problems related to Fourier series, Fourier transforms, and convolution for discrete-time and continuous-time signals. It includes tasks such as finding Fourier series coefficients, calculating transforms, and verifying properties of convolution. The exam emphasizes clear answers, calculation processes, and allows the use of calculators within a three-hour time limit.

Uploaded by

廖子豪
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views1 page

第二次小考

The document is an exam paper for a course on signals and systems, detailing various problems related to Fourier series, Fourier transforms, and convolution for discrete-time and continuous-time signals. It includes tasks such as finding Fourier series coefficients, calculating transforms, and verifying properties of convolution. The exam emphasizes clear answers, calculation processes, and allows the use of calculators within a three-hour time limit.

Uploaded by

廖子豪
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

國立雲林科技大學信號與系統第二次小考(2021/6/9)

注意:(1)請勿作弊,(2)答案標示清楚,(3)答案請化到最簡,(4)要有計算過程, (5)考試時間 3 小時,(6)可使用計算機。


1. Consider a causal discrete-time LTI system whose input x[n] and output y[n] are related by the following
difference equation: 𝑦[𝑛] − 𝑦[𝑛 − 1] = 𝑥[𝑛] (10%)
Find the Fourier series representation of the output y[n] for each of the following inputs:
(a) 𝑥[𝑛] = sin ( n) (b) 𝑥[𝑛] = cos ( n) + 2cos( n)
2. Consider the following three discrete-time signals with a fundamental period of 6: (20%)
𝑥[𝑛] = 1 + 𝑐𝑜𝑠 ( 𝑛) , 𝑦[𝑛] = 𝑠𝑖𝑛( + ), 𝑧[𝑛] = 𝑥[𝑛]𝑦[𝑛],
(a) Determine the Fourier series coefficients of x[n]. (b) Determine the Fourier series coefficients of y[n].
(c) Use the results of parts (a) and (b), along with the multiplication property of the discrete-time Fourier series, to
determine the Fourier series coefficients of 𝑧[𝑛] = x[n]y[n].
(d) Determine the Fourier series coefficients of z[n] through direct evaluation, and compare your result with that of part (c).
3. Use the Fourier transform analysis equation (4.9) to calculate the Fourier transforms of: (10%)
(a) 𝛿(𝑡 + 1) + 𝛿(𝑡 − 1) (b) {𝑢(−2 − 𝑡) + 𝑢(𝑡 − 2)}
Sketch and label the magnitude of each Fourier transform.
4. (a) Compute the convolution of each of the following pairs of signals 𝑥(𝑡) and ℎ(𝑡) by calculating 𝑋(𝑗𝑤) and
𝐻(𝑗𝑤), using the convolution property, and inverse transforming. (15%)
(i) 𝑥(𝑡) = 𝑡𝑒 𝑢(𝑡), ℎ(𝑡) = 𝑒 𝑢(𝑡)
−2𝑡 −4𝑡
(ii) 𝑥(𝑡) = 𝑡𝑒 𝑢(𝑡), ℎ(𝑡) = 𝑡𝑒 𝑢(𝑡)
−2𝑡 −4𝑡

(iii) 𝑥(𝑡) = 𝑒−𝑡 𝑢(𝑡), ℎ(𝑡) = 𝑒𝑡 𝑢(−𝑡)


(b) Suppose that 𝑥(𝑡) = 𝑒−(𝑡−2) 𝑢(𝑡 − 2) and ℎ(𝑡) is as depicted in Figure 1. Verify the convolution property for this
pair of signals by showing that the Fourier transform of 𝑦(𝑡) = 𝑥(𝑡) ∗ ℎ(𝑡) equals 𝐻(𝑗𝑤)𝑋(𝑗𝑤).

Figure 1 Figure 2
5. Compute the Fourier transform of each of the following signals: (20%)
| |
(a) [𝑒 𝑐𝑜𝑠 𝑤 𝑡]𝑢(𝑡), 𝑎 > 0 (b) 𝑒 sin2t
(c) [𝑡𝑒 𝑠𝑖𝑛4𝑡]𝑢(𝑡) (d) 𝑥(𝑡) as shown in Figure 2
6. Determine which, if any, of the following signals have Fourier transforms that satisfy each of the following
conditions: (15%)
1.𝑅𝑒 𝑋 𝑒 =0 2. 𝐽𝑚 𝑋 𝑒 =0 3.There exists a real 𝑎 such that 𝑒 𝑋(𝑒 ) is real.
4.∫ 𝑥 𝑒 𝑑𝑤 = 0 5.𝑋 𝑒 𝑝𝑒𝑟𝑖𝑜𝑑𝑖𝑐. 6. 𝑋 𝑒 =0
(a) 𝑥[𝑛] as in Figure 3 (b) 𝑥[𝑛] = ( )| |
(c) 𝑥[𝑛] = δ(n − 1) + δ(n + 3)

Figure 3
7. The following four facts are given about a real signal 𝑥[𝑛] with Fourier transform 𝑋 𝑒 : (20%)
1. 𝑥[𝑛] = 0 𝑓𝑜𝑟 𝑛 > 0. 2. 𝑥[0] > 0. 3. 𝐽𝑚 𝑋 𝑒 = 𝑠𝑖𝑛 𝑤 − 𝑠𝑖𝑛2𝑤.
4. ∫ |𝑋 𝑒 | 𝑑𝑤 = 3. Determine 𝑥[𝑛].
8. Translate the following sentences and terminologies into Chinese (10%)
(1)(a) periodic (b) high pass (c) infinite (d) imaginary (f) summation
(2) The most important similarities between continuous and discrete-time Fourier analysis are in their uses in
analyzing and representing signals and LTI systems.

You might also like