This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
math121a-f23:october_13_friday [2023/10/14 00:28] pzhou [FT Conventions] |
math121a-f23:october_13_friday [2023/10/14 01:13] (current) pzhou [convlution in space] |
||
---|---|---|---|
Line 8: | Line 8: | ||
- | Discrete Fourier transformation | + | Discrete Fourier transformation |
- | Fix a positive integer . are valued in $\Z / N\Z \cong \{0, | + | |
- | f(x) = \sum_{p \in \Z / N\Z} F(p) F(p) e^{2\pi i \cdot px/N}. | + | Fix a positive integer . are valued in the ' |
- | F(p) = (1/N) \sum_{p \in \Z / N\Z} f(x) e^{-2\pi i \cdot px/N}. | + | $$ \Z / N\Z \cong \{0, |
+ | |||
+ | |||
+ | F(p) = (1/N) \sum_{x \in \Z / N\Z} f(x) e^{-2\pi i \cdot px/N}. | ||
+ | |||
+ | ==== Norm in the Continous Fourier transformation ==== | ||
+ | Let be a complex valued function on , we define | ||
+ | |||
+ | |||
+ | Let be a complex valued function on , we define | ||
+ | |||
+ | |||
+ | ==== Norm in the Discrete Fourier transformation ==== | ||
+ | \| f\|_x^2 := (1/N) \sum_{x=0}^{N-1} |f(x)|^2 | ||
+ | |||
+ | Let be a complex valued function on , we define | ||
+ | \| F\|_p^2 := \sum_{p=0}^{N-1} |F(p)|^2 | ||
+ | |||
+ | ==== Parseval Equality ==== | ||
+ | If is the Fourier transformation of , then | ||
+ | We proved in class the discrete case. The continuous case is similar in spirit, but harder to prove. | ||
+ | |||
+ | ===== Convolution ===== | ||
+ | Consider two people, call them Alice and Bob, they each say an integer number, call it a and b. Suppose and both have equal probability of taking value within $\{1, | ||
+ | |||
+ | We know , for any $i=1, | ||
+ | |||
+ | |||
+ | This is an instance of convolution. | ||
+ | |||
+ | ==== convlution in space ==== | ||
+ | Convolution is usually denoted as . | ||
+ | |||
+ | If and are functions on the space, then we define | ||
+ | |||
+ | If and are functions on the space, then we define | ||
+ | |||
+ | |||
+ | Fourier transformation sends convolution of functions on one side to simply multiplication on the other side. | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ |