Friday, June 5, 2009

Fast Correlation

I've uploaded a small package to the Matlab File Exchange to improve the speed of your cross correlations. This package uses the FFT to calculate the circular cross correlation of two periodic signals. Since the FFT calculates the DFT of a N-point signal in O(N log N) calculations (rather than O(N2)) it is much faster than the naïve method, especially for long signals. In Matlab, the fft method is faster than the multiplication method in all but the most trivial cases, as shown in the image, plotting the ratio of the speed of the fast method to that of the naïve method from the definition. The figure also shows that the fft algorithm is typically fastest when N is a power of 2, and slowest when N is prime.

4 comments:

Kevin said...
This comment has been removed by the author.
Kevin said...

I am interested in your journal article on subsample delay estimation. Did you publish it? Where could I find it?

Travis said...

Send me an email and I'll get you a copy. travis.mlfx@nutaksas.com

zayedyagi said...

There are plenty of facilities for couples at this lodge, including a bar, a restaurant, and a on line casino. Guests staying at Live Casino & Hotel - Philadelphia get pleasure from entry to a on line casino, a 24-hour fitness center, and free WiFi in public areas. The 24-hour entrance desk has multilingual workers ready 먹튀사이트 먹튀프렌즈 to help with luggage storage, dry cleaning/laundry, and securing valuables.