|
|
1 | (32) |
|
|
2 | (11) |
|
1.1.1 Even and Odd Functions |
|
|
2 | (1) |
|
1.1.2 Definition of the Fourier Series |
|
|
3 | (2) |
|
1.1.3 Calculation of the Fourier Coefficients |
|
|
5 | (4) |
|
1.1.4 Fourier Series in Complex Notation |
|
|
9 | (4) |
|
|
13 | (8) |
|
|
13 | (1) |
|
1.2.2 The First Shifting Rule (Shifting Within the Time Domain) |
|
|
13 | (3) |
|
1.2.3 The Second Shifting Rule (Shifting Within the Frequency Domain) |
|
|
16 | (5) |
|
|
21 | (1) |
|
1.3 Partial Sums, Bessel's Inequality, Parseval's Equation |
|
|
21 | (3) |
|
|
24 | (9) |
|
1.4.1 Dirichlet's Integral Kernel |
|
|
25 | (1) |
|
1.4.2 Integral Notation of Partial Sums |
|
|
26 | (1) |
|
|
27 | (6) |
|
2 Continuous Fourier Transformation |
|
|
33 | (38) |
|
2.1 Continuous Fourier Transformation |
|
|
33 | (9) |
|
2.1.1 Even and Odd Functions |
|
|
34 | (1) |
|
|
34 | (1) |
|
2.1.3 Forward and Inverse Transformation |
|
|
35 | (6) |
|
2.1.4 Polar Representation of the Fourier Transform |
|
|
41 | (1) |
|
|
42 | (5) |
|
|
42 | (1) |
|
2.2.2 The First Shifting Rule |
|
|
42 | (2) |
|
2.2.3 The Second Shifting Rule |
|
|
44 | (2) |
|
|
46 | (1) |
|
2.3 Convolution, Cross Correlation, Autocorrelation, Parseval's Theorem |
|
|
47 | (13) |
|
|
47 | (9) |
|
|
56 | (1) |
|
|
57 | (1) |
|
|
58 | (2) |
|
2.4 Fourier Transformation of Derivatives |
|
|
60 | (2) |
|
|
62 | (9) |
|
|
62 | (2) |
|
|
64 | (7) |
|
|
71 | (22) |
|
3.1 The Rectangular Window |
|
|
72 | (4) |
|
|
72 | (1) |
|
3.1.2 Intensity at the Central Peak |
|
|
72 | (2) |
|
3.1.3 Sidelobe Suppression |
|
|
74 | (1) |
|
|
74 | (1) |
|
3.1.5 Asymptotic Behaviour of Sidelobes |
|
|
75 | (1) |
|
3.2 The Triangular Window (Fejer Window) |
|
|
76 | (1) |
|
|
77 | (1) |
|
3.4 The cos2-Window (Hanning) |
|
|
78 | (2) |
|
|
80 | (1) |
|
|
81 | (1) |
|
|
82 | (1) |
|
3.8 The Kaiser---Bessel Window |
|
|
83 | (2) |
|
3.9 The Blackman---Harris Window |
|
|
85 | (1) |
|
3.10 Overview over Window Functions |
|
|
86 | (4) |
|
3.11 Windowing or Convolution? |
|
|
90 | (3) |
|
4 Discrete Fourier Transformation |
|
|
93 | (44) |
|
4.1 Discrete Fourier Transformation |
|
|
93 | (7) |
|
4.1.1 Even and Odd Series and Wrap-Around |
|
|
94 | (1) |
|
4.1.2 The Kronecker Symbol or the "Discrete δ-Function" |
|
|
94 | (2) |
|
4.1.3 Definition of the Discrete Fourier Transformation |
|
|
96 | (4) |
|
|
100 | (4) |
|
|
100 | (1) |
|
4.2.2 The First Shifting Rule (Shifting in the Time Domain) |
|
|
101 | (1) |
|
4.2.3 The Second Shifting Rule (Shifting in the Frequency Domain) |
|
|
102 | (1) |
|
4.2.4 Scaling Rule/Nyquist Frequency |
|
|
102 | (2) |
|
4.3 Convolution, Cross Correlation, Autocorrelation, Parseval's Theorem |
|
|
104 | (6) |
|
|
105 | (3) |
|
|
108 | (1) |
|
|
109 | (1) |
|
|
109 | (1) |
|
|
110 | (5) |
|
|
115 | (4) |
|
4.6 How to Get Rid of the "Straight-Jacket" Periodic Continuation? By Using Zero-Padding! |
|
|
119 | (6) |
|
4.7 Fast Fourier Transformation (FFT) |
|
|
125 | (12) |
|
5 Filter Effect in Digital Data Processing |
|
|
137 | (18) |
|
|
137 | (2) |
|
5.2 Low-Pass, High-Pass, Band-Pass, Notch Filter |
|
|
139 | (7) |
|
|
146 | (1) |
|
|
147 | (1) |
|
5.5 Differentiation of Discrete Data |
|
|
148 | (1) |
|
5.6 Integration of Discrete Data |
|
|
149 | (6) |
|
6 Data Streams and Fractional Delays |
|
|
155 | (18) |
|
|
155 | (1) |
|
6.2 Non-recursive Algorithms |
|
|
156 | (8) |
|
6.3 Stability of Recursive Algorithms |
|
|
164 | (1) |
|
6.4 Thiran's All-Pass Filter for N = 1 |
|
|
165 | (8) |
|
|
167 | (1) |
|
|
168 | (1) |
|
|
169 | (4) |
|
7 Tomography: Backprojection of Filtered Projections |
|
|
173 | (10) |
|
|
173 | (2) |
|
7.2 Backprojection of Filtered Projections |
|
|
175 | (8) |
Appendix: Solutions |
|
183 | (54) |
References |
|
237 | (2) |
Index |
|
239 | |