Nearest power-of-two number: Difference between revisions
From Atomix
Created page with "The rate of sampling can then be used to convert these two durations into a number of samples. Although many fast Fourier transform algorithms can transform data of any number..." |
No edit summary |
||
| Line 1: | Line 1: | ||
The rate of sampling can | 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]] | |||
Revision as of 15:38, 9 November 2021
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
