Nearest power-of-two number: Difference between revisions
From Atomix
No edit summary |
mNo edit summary |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
The rate of sampling can be used to convert these two durations (diss-length and fft-length) into a number of samples. Although many fast Fourier transform algorithms can transform data of any number of samples, the fastest execution occurs for lengths that are whole-number powers of two. It is recommended to round the number of samples up to the next power of two. | The rate of sampling can be used to convert these two durations (diss-length and fft-length) into a number of samples. Although many fast Fourier transform algorithms can transform data of any number of samples, '''the fastest execution occurs for lengths that are whole-number powers of two'''. It is recommended to round the number of samples up to the next power of two. | ||
---------------------------- | ---------------------------- | ||
return to [[Flow chart for shear probes]] | return to [[Flow chart for shear probes]] | ||
[[Category:Shear probes]] | |||
Latest revision as of 18:09, 6 June 2024
The rate of sampling can be used to convert these two durations (diss-length and fft-length) into a number of samples. Although many fast Fourier transform algorithms can transform data of any number of samples, the fastest execution occurs for lengths that are whole-number powers of two. It is recommended to round the number of samples up to the next power of two.
return to Flow chart for shear probes
