Explanation for a function within xcorr

2022 8 10
1 个回答
回答已采纳
更新时间：2022 8 14
6 次查看（30 天）

0 个投票

Looking within the xcorr function, most of it is pretty straightforward, except for one function within xcorr called "findTransformLength".
function m = findTransformLength(m)
m = 2*m;
while true
r = m;
for p = [2 3 5 7]
while (r > 1) && (mod(r, p) == 0)
r = r / p;
end
end
if r == 1
break;
end
m = m + 1;
end
With no comments, i fail to understand what this function is meant to acheive and what is the significance of p = [2 3 5 7]. Why those numbers specifically? Why not take a fixed FFT size instead?

请先登录，再回答此问题。

 采纳的回答

David Goodmanson
David Goodmanson 2022-8-12
编辑：David Goodmanson 2022-8-12

0 个投票

Hi big,
rather than puzzle this out in place, it seemed easier to look at the output of the function for the first hundred values of m. The answer seems to be: the smallest value that is
(a) greater than or equal to 2*m, and
(b) contains only the prime factors 2,3,5,7 to various powers.
This is done to take advantage of the speed of the fft in those circumstances.
n = 100;
a = zeros(n,1);
for k = 1:n
a(k) = findTransformLength(k);
end
[(1:n)' a]
function m = findTransformLength(m)
(as you have it)
end % extra 'end' required to delineate a function at the bottom of a script file

2 个评论
显示 无 隐藏 无

Big heads
Big heads 2022-8-12
Thank you David for the reply. I see what the function does. But why not just use a constant FFT size? What would be wrong with that?
m2 = findTransformLength(m);
X = fft(x,m2,1);
As we know increasing the FFT size does not necessarily increase the resolution of the FFT output. so why do the "findTransformLength" at all. as long as we take the FFT (with a fixed size) of both A and B, do a multiplication of A with the complex conjugate of B and then take an inverse iFFT, that should suffice, shouldn't it?
David Goodmanson
David Goodmanson 2022-8-14
Hi big,
I believe this is done for reasons of speed. If the length of the array is factored into primes, and one or more of the primes are large, then the fft is slow. When the length is the product of small prime factors, then the fft is faster, typically by a factor of 5 to 10.

请先登录，再进行评论。

更多回答（0 个）

类别

在 帮助中心 和 File Exchange 中查找有关 Correlation and Convolution 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by