Nearest power-of-two number - Revision history

Marcus at 18:09, 6 June 2024

2024-06-06T18:09:50Z

← Older revision		Revision as of 18:09, 6 June 2024
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.

	----------------------------		----------------------------

CynthiaBluteau: Categorization

2021-11-23T15:28:38Z

Categorization

← Older revision		Revision as of 15:28, 23 November 2021
Line 3:		Line 3:
	----------------------------		----------------------------
	return to [[Flow chart for shear probes]]		return to [[Flow chart for shear probes]]


			[[Category:Shear probes]]

Ilker at 15:38, 9 November 2021

2021-11-09T15:38:07Z

← Older revision		Revision as of 15:38, 9 November 2021
Line 1:		Line 1:
	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 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]]

Aleboyer: 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..."

2021-08-20T22:50:36Z

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..."

New page

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 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.