October 2006
Intermediate to advanced
369 pages
8h 11m
English
Content preview from Digital Filters Design for Signal and Image ProcessingBecome an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
8.5. Filtering in the frequency domain
When the filter properties are specified in the frequency domain, or when the impulse responses have a very large support, it is advantageous to carry out the filtering operation in the Fourier domain by using equation (8.5). Changing the representation domain is done using the 2-D discrete Fourier transform. Consequently, the input/output relation, in the spatial domain, is no longer described by a simple discrete convolution equation, but by a circular convolution equation. We will look at the effects of this phenomenon at the end of this section.
8.5.1. 2-D discrete Fourier transform (DFT)
Let us look at a sequence of two indices {xk,l}. To simplify our presentation, we assume that the two indices have the same variation domain, from 0 to N−1. The transformed sequence 
is given by:
It is clear that the transform sequence is periodic, of period N for each index.
Equation (8.36) also shows that the transformation is separable, being constituted of a discrete 1-D Fourier transform (DFT) operating row by row, followed with a DFT column by column.
As in the 1-D context, the 2-D discrete Fourier transform is inversible:
As in the 1-D context, we ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.