April 2024
Intermediate to advanced
400 pages
12h 28m
English
Content preview from Digital Signal Processing, 10th Edition
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,
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.
3Other Fast Algorithms for the FFT
Algorithms for the fast calculation of a discrete Fourier transform (DFT) are based on factorization of the matrix of the transform. We have already seen such factorization in the sections on decimation-in-time and decimation-in-frequency algorithms, in the preceding chapter, which are particular examples of a large group of algorithms.
In order to use these fast algorithms and thus to exploit to the full both the characteristics of the signals to be processed and the various technological possibilities, one must use a suitable mathematical tool – the Kronecker product of matrices. By combining this product with the conventional product, it is possible to factorize the matrix of the DFT in a simple way.
3.1 Kronecker Product of Matrices
The Kronecker product is a tensor operation which is a generalization of the multiplication of a matrix by a scalar [1]. Knowing two matrices A and B with m and p rows and n and q columns respectively, the Kronecker product of A by B (written A × B) is a new matrix with mp rows and nq columns, which is obtained by replacing each element bij of the matrix B by the following array bijA:
This product is generally not commutative:
As an example of the product, if the matrix B is
the Kronecker product of the ...
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.