FftSharp

Silence frequencies above the given frequency

Silence frequencies below the given frequency

Silence frequencies outside the given frequency range

Silence frequencies inside the given frequency range

Generate this window as a new array with the given length. Normalizing will scale the window so the sum of all points is 1.

Return a new array where this window was multiplied by the given signal. Normalizing will scale the window so the sum of all points is 1 prior to multiplication.

Modify the given signal by multiplying it by this window IN PLACE. Normalizing will scale the window so the sum of all points is 1 prior to multiplication.

Single word name for this window

A brief description of what makes this window unique and what it is typically used for.

Test if a number is an even power of 2

Return the input array (or a new zero-padded new one) ensuring length is a power of 2

array of any length the input array or a zero-padded copy

Return the input array (or a new zero-padded new one) ensuring length is a power of 2

array of any length the input array or a zero-padded copy

Return the input array zero-padded to reach a final length

array of any length pad the array with zeros a the end to achieve this final length a zero-padded copy of the input array

Return the input array zero-padded to reach a final length

array of any length pad the array with zeros a the end to achieve this final length a zero-padded copy of the input array

Compute the discrete Fourier Transform (in-place) using the FFT algorithm.

Data to transform in-place. Length must be a power of 2.

Compute the discrete Fourier Transform (in-place) using the FFT algorithm.

Data to transform in-place. Length must be a power of 2.

High performance FFT function. Complex input will be transformed in place. Input array length must be a power of two. This length is NOT validated. Running on an array with an invalid length may throw an invalid index exception.

Compute the inverse discrete Fourier Transform (in-place) using the FFT algorithm.

Data to transform in-place. Length must be a power of 2.

Reverse the sequence of bits in an integer (01101 -> 10110)

Calculate sample frequency for each point in a FFT

Return the distance between each FFT point in frequency units (Hz)

Test if a number is an even power of 2

Create an array of Complex data given the real component

Create an array of Complex data given the real component

Compute the 1D discrete Fourier Transform using the Fast Fourier Transform (FFT) algorithm

real input (must be an array with length that is a power of 2) transformed input

Compute the 1D discrete Fourier Transform using the Fast Fourier Transform (FFT) algorithm

real input (must be an array with length that is a power of 2) real component of transformed input

Compute the 1D discrete Fourier Transform using the Fast Fourier Transform (FFT) algorithm

Memory location of the results (must be an equal to input length / 2 + 1) real input (must be an array with length that is a power of 2) real component of transformed input

Return a Complex array as an array of its absolute values

Calculte power spectrum density (PSD) original (RMS) units

real input

Calculte power spectrum density (PSD) original (RMS) units

Memory location of the results. real input

Calculte power spectrum density (PSD) in dB units

real input

Calculte power spectrum density (PSD) in dB units

Memory location of the results. real input

Multiply the array by this window and return the result as a new array

Multiply the array by this window, modifying it in place

Return an array containing all available windows. Note that all windows returned will use the default constructor, but some windows have customization options in their constructors if you create them individually.