Table For Discrete-Time Fourier Transform
Table For Discrete-Time Fourier Transform
𝒙 𝒏 Remarks
𝟏 𝒇𝒔 /𝟐 𝑿 𝒇 = 𝒙 𝒏 𝒆−𝒊𝟐𝝅𝒇𝒏𝑻𝒔 𝟏
= 𝑿 𝒇 𝒆𝒊𝟐𝝅𝒇𝒏𝑻𝒔 𝒅𝒇 𝒏=−∞ 𝒇𝒔 =
𝒇𝒔 −𝒇𝒔 /𝟐 𝑻𝒔
𝒂𝟏 𝒙𝟏 𝒏 + 𝒂𝟐 𝒙𝟐 𝒏 𝒂 𝟏 𝑿𝟏 𝒇 + 𝒂 𝟐 𝑿𝟐 𝒇 Linearity
𝒙 −𝒏 𝑿 −𝒇
𝒙 𝒏 − 𝒏𝟎 𝒆−𝒊𝟐𝝅𝒇𝒏𝟎𝑻𝒔 𝑿 𝒇 𝒏𝟎 is an integer
𝒊𝟐𝝅𝒇𝟎 𝒏𝑻𝒔 𝑿 𝒇 − 𝒇𝟎 𝒇𝟎 is real
𝒆 𝒙 𝒏
−𝟏 𝒏 𝒙 𝒏 𝒇𝒔
𝑿 𝒇−
𝟐
𝒙𝟏 𝒏 ∗ 𝒙𝟐 𝒏 𝑿𝟏 𝒇 𝑿 𝟐 𝒇 Convolution in the time
domain
𝒙𝟏 𝒏 𝒙𝟐 𝒏 𝑿𝟏 𝒇 ⊛ 𝑿 𝟐 𝒇 = Multiplication in the
𝒇𝒔 /𝟐
𝟏 time domain
𝑿𝟏 𝝊 𝑿𝟐 𝒇 − 𝝊 𝒅𝝊
𝒇𝒔 −𝒇𝒔 /𝟐
𝒙 𝑴𝒏 𝑀−1
1 𝑓𝑠 𝑀 is a positive integer
𝑋 𝑓−𝑚
𝑀 𝑀
𝑚 =0
𝒏 𝑿 𝒇 𝑳 is a positive integer
𝒙 when 𝒏 is a multiple of
𝑳
𝑳, and zero otherwise.
𝒏𝒎 𝒙 𝒏 𝟏 𝒅𝒎 𝑿 Provided
𝒅𝒎 𝑿
−𝒊𝟐𝝅𝑻𝒔 𝒎 𝒅𝒇𝒎 exists, 𝑚 is nonnegative
𝒅𝒇𝒎
integer
∗
𝒙 𝒏 is real 𝑿 𝒇 = 𝑿 −𝒇 Hermitian symmerty
∞
𝒙 𝒏 is periodic with 𝒇𝒔 𝒇𝒔 𝒀 𝒎 =𝒀 𝒎+𝑴 =
𝒀 𝒎 𝜹 𝒇−𝒎 𝑴−𝟏
period 𝑴 𝑴 𝑴 𝒊𝟐𝝅𝒎𝒍
𝒎=−∞ 𝒙 𝒍 𝒆− 𝑴
𝒍=𝟎
𝒎 = 𝟎, 𝟏, 𝟐, … 𝑴 − 𝟏
𝒏 𝑿 𝒇
+
𝒙 𝒎 𝟏 − 𝒆∞−𝒊𝟐𝝅𝒇𝑻𝒔
𝒎=−∞ 𝒇𝒔
𝑿(𝟎) 𝜹 𝒇 − 𝒗𝒇𝒔
𝟐
𝒗=−∞
∞ 𝟐 𝟏 𝒇𝒔 /𝟐 𝟐
𝑬= 𝒏=−∞ 𝒙 𝒏 = 𝑿 𝒇 𝒅𝒇 (Parseval’s theorem)
𝒇𝒔 −𝒇𝒔 /𝟐
∞ 𝒇𝒔 /𝟐
𝟏
𝒙𝟏 𝒏 𝒙∗𝟐 𝒏 = 𝑿𝟏 𝒇 𝑿∗𝟐 𝒇 𝒅𝒇
𝒇𝒔
𝒏=−∞ −𝒇𝒔 /𝟐
∞
𝒙 𝒏
𝟏 𝒇𝒔 /𝟐 𝑿 𝒇 = 𝒙 𝒏 𝒆−𝒊𝟐𝝅𝒇𝒏𝑻𝒔 Remarks
= 𝑿 𝒇 𝒆𝒊𝟐𝝅𝒇𝒏𝑻𝒔 𝒅𝒇 𝒏=−∞
𝒇𝒔 −𝒇𝒔 /𝟐
𝜹 𝒏 𝟏
∞ ∞
𝟏= 𝜹 𝒏−𝒎 𝒇𝒔 𝜹 𝒇 − 𝒎𝒇𝒔
𝒎=−∞ 𝒎=−∞
𝟏 ,𝟎 ≤ 𝒏 ≤ 𝑵 − 𝟏 𝐬𝐢𝐧 𝝅𝒇𝑵𝑻𝒔
𝒙 𝒏 = 𝒆−𝒊𝝅𝒇 𝑵−𝟏 𝑻𝒔
𝟎, otherwise 𝐬𝐢𝐧 𝝅𝒇𝑻𝒔
𝟏 , −𝑵 ≤ 𝒏 ≤ 𝑵 𝐬𝐢𝐧 𝝅𝒇 𝟐𝑵 + 𝟏 𝑻𝒔
𝒙 𝒏 =
𝟎, otherwise 𝐬𝐢𝐧 𝝅𝒇𝑻𝒔
𝒙 𝒏 𝟐
𝟏 𝐬𝐢𝐧 𝝅𝒇𝑵𝑻𝒔
𝒏
𝟏 − , −𝑵 < 𝑛 < 𝑁 𝑵 𝐬𝐢𝐧 𝝅𝒇𝑻𝒔
= 𝑵
𝟎, otherwise
𝒏 𝟏
𝜶 𝒖 𝒏 𝜶 <1
𝟏 − 𝜶𝒆−𝒊𝟐𝝅𝒇𝑻𝒔
𝜶𝒏 𝟏 − 𝜶𝟐 𝜶 <1
𝟏 + 𝜶𝟐 − 𝟐𝜶 𝐜𝐨𝐬 𝟐𝝅𝒇𝑻𝒔
sgn(n) 𝟏 𝟏
−
𝟏 − 𝒆−𝒊𝟐𝝅𝒇𝑻𝒔 ∞𝟏 − 𝒆𝒊𝟐𝝅𝒇𝑻𝒔
𝒖(n) 𝟏 𝒇𝒔
+ 𝜹 𝒇 − 𝒎𝒇𝒔
𝟏− 𝒆−𝒊𝟐𝝅𝒇𝑻𝒔 𝟐
𝒎=−∞
∞
𝒆𝒊𝟐𝝅𝒇𝟎𝒏𝑻𝒔
𝒇𝒔 𝜹 𝒇 − 𝒇𝟎 − 𝒎𝒇𝒔
𝒎=−∞
∞
sinc 𝜶𝒏 𝟏 𝒇 − 𝒏𝒇𝒔 𝜶 > 0 is real
rect
𝜶 𝜶𝒇𝒔
𝒏=−∞