data structure for an NNFFT (nonequispaced in time and frequency fast Fourier transform) plan with float precision
More...
Data Fields |
NFFT_INT | N_total |
| Total number of Fourier coefficients.
|
NFFT_INT | M_total |
| Total number of samples.
|
fftwf_complex * | f_hat |
| Fourier coefficients.
|
fftwf_complex * | f |
| Samples.
|
void(* | mv_trafo )(void *) |
| Transform.
|
void(* | mv_adjoint )(void *) |
| Adjoint transform.
|
int | d |
| dimension, rank
|
float * | sigma |
| oversampling-factor
|
float * | a |
| 1 + 2*m/N1
|
int * | N |
| cut-off-frequencies
|
int * | N1 |
| sigma*N
|
int * | aN1 |
| sigma*a*N
|
int | m |
| cut-off parameter in time-domain
|
float * | b |
| shape parameters
|
int | K |
| number of precomp.
|
int | aN1_total |
| aN1_total=aN1[0]* ...
|
nfftf_plan * | direct_plan |
| plan for the nfft
|
unsigned | nnfft_flags |
| flags for precomputation, malloc
|
int * | n |
| n=N1, for the window function
|
float * | x |
| nodes (in time/spatial domain)
|
float * | v |
| nodes (in fourier domain)
|
float * | c_phi_inv |
| precomputed data, matrix D
|
float * | psi |
| precomputed data, matrix B
|
int | size_psi |
| only for thin B
|
int * | psi_index_g |
| only for thin B
|
int * | psi_index_f |
| only for thin B
|
fftwf_complex * | F |
float * | spline_coeffs |
| input for de Boor algorithm, if B_SPLINE or SINC_2m is defined
|
data structure for an NNFFT (nonequispaced in time and frequency fast Fourier transform) plan with float precision
Definition at line 408 of file nfft3.h.