#include <vnl_fft_prime_factors.h>
Collaboration diagram for vnl_fft_prime_factors< T >:
Public Methods | |
vnl_fft_prime_factors () | |
vnl_fft_prime_factors (int N) | |
~vnl_fft_prime_factors () | |
T const * | trigs () const |
int | number () const |
int const * | pqr () const |
operator bool () const | |
void | resize (int N) |
Given an integer N of the form N = (2**P)(3**Q)(5**R) split N into its primefactors (2, 3, 5)
Definition at line 24 of file vnl_fft_prime_factors.h.
|
|
|
constructor takes the size of the signal. Definition at line 30 of file vnl_fft_prime_factors.h. |
|
Definition at line 32 of file vnl_fft_prime_factors.h. |
|
number which was factorized. Definition at line 40 of file vnl_fft_prime_factors.h. |
|
Definition at line 46 of file vnl_fft_prime_factors.h. |
|
exponents P, Q, R. Definition at line 44 of file vnl_fft_prime_factors.h. |
|
Definition at line 48 of file vnl_fft_prime_factors.h. |
|
array of twiddle factors. Definition at line 36 of file vnl_fft_prime_factors.h. |