This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: F u N v N Fee u v Feo u v W Foe u v W Foo u v W N v N u N u v N v N u N u v N v N u N u v ( , / ) ( , ) ( , ) ( , ) ( , ) ( / , ) ( , ) ( , ) ( , ) ( , ) ( / , / ) ( , ) ( , ) ( , ) ( , ) + =-+-+ = +--+ + =--+ + + + 2 2 2 2 (V) Therefore, the Fourier Transform for a 2D funtion f(x,y) of NxN points can be obtained by simple operations (additions and multiplications) of four Fourier Transforms of N/2xN/2 points (Eq.(III)-(V)). Also, each one of this four Fourier Transforms can be obtained by simple operations of four Fourier Transforms of N/4xN/4 points. This procedure can be done until the number points of each Fourier Transform is 2x2 . October 3, 1994 Patricio Vidal...
View Full Document
- Spring '11
- convolution theorem, ux + vy