{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

fft.slides.printing.6

# fft.slides.printing.6 - Implementation Padding Fast Fourier...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Implementation: Padding, Fast Fourier Transform Implementation: Padding, Fast Fourier Transform CS 450: Introduction to Digital Signal and Image Processing Bryan Morse BYU Computer Science Implementation: Padding, Fast Fourier Transform Introduction Implementing Convolution using the Fourier Transform We saw earlier: f ( t ) * h ( t ) = F- 1 ( F ( f ( t )) F ( h ( t ))) 1. Compute the Fourier Transform of the input signal f ( t ) 2. Compute the Fourier Transform of the convolution kernel h ( t ) I May be done by building the kernel and applying the DFT/FFT I May be calculated analytically directly in the frequency domain 3. Multiply the two Fourier Transforms together (complex multiply) 4. Apply the inverse Fourier Transform (if the signal and kernel are real-valued, just use the real part of the result) Implementation: Padding, Fast Fourier Transform Padding Padding the Kernel I To multiply F ( u ) and H ( u ) , they must be the same size I This means the discrete f ( t ) and h ( t ) must be the same size I If necessary, pad the kernel h ( t ) with zeroes to be the same size as the signal f ( t ) —adding zeroes to a convolution kernel doesn’t change anything Implementation: Padding, Fast Fourier Transform...
View Full Document

{[ snackBarMessage ]}

### Page1 / 3

fft.slides.printing.6 - Implementation Padding Fast Fourier...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online