Member Variables¶

A¶

• variable dft_plan<T>::all_stages Internal data.
• variable dft_plan<T>::arblen True if Bluestein's FFT algorithm is selected.

B¶

• variable convolve_filter<T>::block_size
• variable dft_stage<T>::blocks Number of independent blocks processed by the stage.

C¶

• variable dft_stage<T>::can_inplace Whether the stage can operate in-place.
• variable convolve_filter<T>::cscratch
• variable dft_resampler_params::cutoff Normalised cutoff frequency (0..1], where 1.0 = Nyquist of the output rate.

D¶

• variable dft_stage<T>::data Pointer to the stage's internal data buffer.
• variable dft_plan<T>::data Internal data.
• variable dft_stage<T>::data_size Size in bytes of the stage's internal data (e.g. twiddles).
• variable dft_plan<T>::data_size Internal data size.
• variable convolve_filter<T>::data_size
• variable dft_plan<T>::disposition_inplace Internal data.
• variable dft_plan<T>::disposition_outofplace Internal data.

F¶

• variable convolve_filter<T>::fft
• variable dft_plan_real<T>::fmt Packing format of the complex spectrum.

I¶

• variable dft_resampler_params::input_block_size Computed FFT block size (power of two) satisfying the overlap-save constraint.
• variable convolve_filter<T>::input_position
• variable convolve_filter<T>::ir_segments

L¶

• variable ngfft_plan<T>::l2fftsize Log2 of the FFT size (e.g. 16 means a 65536-point FFT).

N¶

• variable dft_stage<T>::name Human-readable name of the stage (for
• variable dft_stage<T>::need_reorder Whether the stage output requires bit-reversal reordering.

O¶

• variable dft_stage<T>::out_offset Offset (in complex elements) between successive recursive outputs.
• variable convolve_filter<T>::overlap

P¶

• variable convolve_filter<T>::position
• variable convolve_filter<T>::premul
• variable dft_plan<T>::progressive_optimized True if the plan is for progressive execution of the DFT.

R¶

• variable dft_stage<T>::radix Radix of the stage (number of butterfly arms).
• variable convolve_filter<T>::real_fft
• variable dft_plan_md_real<T, Dims>::real_out_is_enough If true, the inverse transform may write directly into the real output buffer without an extra complex working region.
• variable dft_stage<T>::recursion Whether the stage uses recursive execution.
• variable dft_stage<T>::repeats Number of recursive repetitions used during execution.

S¶

• variable convolve_filter<T>::saved_input
• variable convolve_filter<T>::scratch1
• variable convolve_filter<T>::scratch2
• variable convolve_filter<T>::segments
• variable dft_resampler_params::shift Resampling factor as a power of 2 (e.g. 1 for 2x, -1 for 0.5x, 0 for filter-only).
• variable dft_plan<T>::size The size of the DFT as passed to the constructor.
• variable dft_plan_real<T>::size Number of real samples in the transform.
• variable dft_plan_md<T, Dims>::size Per-dimension sizes of the transform.
• variable dft_plan_md_real<T, Dims>::size Per-dimension sizes of the real transform.
• variable dft_stage<T>::stage_size Number of complex elements processed by this stage.
• variable dft_plan<T>::stages Internal data.
• variable dft_resampler_params::stopband_atten_db Desired stopband attenuation in dB (e.g. 144). Controls Kaiser beta.

T¶

• variable convolve_filter<T>::temp
• variable dft_stage<T>::temp_size Size in bytes of scratch buffer required by this stage.
• variable dft_plan<T>::temp_size The temporary (scratch) buffer size for the DFT plan.
• variable dft_plan_md<T, Dims>::temp_size Scratch buffer size in bytes required by
• variable dft_plan_md_real<T, Dims>::temp_size Scratch buffer size in bytes required by
• variable dft_resampler_params::transition_width Transition bandwidth normalised to the lower-rate Nyquist (0..1].
• variable ngfft_plan<T>::twiddles User-allocated pointer to twiddle factors. The required element count is obtained from ngfft_twiddle_count(); the buffer must be cache-line aligned. Initialise via ngfft_initialize() before first use.

U¶

• variable dft_stage<T>::user Stage-specific user value (e.g. log2 of the stage size).