Does fftn do post padding ?
2 Ansichten (letzte 30 Tage)
Ältere Kommentare anzeigen
x = randi(256, 200,200,200);
x = fftn(x,[256,256,256]);
Is this post padding by 56 ?
0 Kommentare
Antworten (1)
David Goodmanson
am 8 Feb. 2020
Bearbeitet: David Goodmanson
am 8 Feb. 2020
HI raheem,
It's pre padding of the original x array by 56 in each dimension, before the fft. As you can see, the y array has no zeros.
x = randi(256, 200,200,200);
y = fftn(x,[256,256,256]);
any(y(:)==0)
ans =
logical
0
soapbox stuff: Unless the length of an array is a large prime number, padding before doing an fft is almost always a bad idea. It changes the resulting frequency array and can lead to problems representing the frequency domain waveform, among other things.
Certainly with the fft algorithms in use today, padding to length 2^n because of the vaunted speed advantage is mostly a myth. For small problems any speed advantage is negligible. So let's take your example as a medium size problem:
x = randi(256, 200,200,200);
tic
for k = 1:100
y = fftn(x,[256,256,256]);
end
toc
Elapsed time is 18.387219 seconds.
tic
for k = 1:100
y = fftn(x);
end
toc
Elapsed time is 5.873024 seconds.
so padding is faster, but only in the sense that it is 3 times slower.
Siehe auch
Kategorien
Mehr zu Fourier Analysis and Filtering finden Sie in Help Center und File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!