Chapter 3

Signals and Hilbert Spaces

(3.9)

(3.10)

(3.11)

(3.14)

(3.15)

(3.16)

(3.17)

(3.18)

(3.20)

(3.21)

(3.24)

(3.25)

(3.26)

(3.27)

〈x, y〉= ∑𝑁−1 ∗

𝑛=0 𝑥𝑛 𝑦𝑛 (3.29)

(3.40)

(3.42)

(3.32)

x(m) m=0,1,…,M-1

(3.38)

(3.41)
Chapter 4
Fourier Analysis

(4.1)

(4.2)

(4.3)

(4.4)

(4.5)

X = Wx (4.6)

x = (1//N) WHX (4.7)

(4.8)

(4.9)

(4.10)
[k] = ∑ n=0 , N-1 [n]W N,kn k Z (4.11)

[n] = ∑ k=0, N-1 [k] WN-nk, n Z (4.12)

(4.14)

(4.15)

(4.16)

(4.17)

(4.18)

(4.19)
 (4.45)

(4.60)

x[-n mod N] X[-k mod N] (4.75)

(4.71)

(4.72)
[ x[N-k] x[N-k+1] … x[N - 1] x[0] x[1] … x[N-k-1] ]T = [ x[n - k] mod N ] (4.73)

(4.55)

(4.56)

(4.68)

(4.69)

(4.83)

(4.84)

(4.59)

(4.70)

(4.85)

x[n] = cos , n = 0,1,2,…,63

x[n] = cos
(4.87)

(4.88)

(4.89)

(4.90)
Chapter 5
Discrete-Time Filters

(5.1)

(5.2)
h[n] = {δ[n]}

(5.3)

(5.13)
1
ℎ[𝑛] = ∑𝑁−1
𝑘=0 𝛿[𝑛 − 𝑘] (5.14)
𝑁

(5.15)

(5.16)
(5.18)

(5.21)

(5.22)