NDFTNominal Dry Film Thickness (coating systems)
NDFTNonuniform Discrete Fourier Transform
NDFTNonequispaced Discrete Fourier Transform (mathematics)
References in periodicals archive ?
where the update step in Algorithm 1 is simply changed to [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], the conjugated NDFT f = [bar.
If the restriction on n is not fulfilled, the NDFT method is competitive, anyway.
The Horner-like NDFT uses no extra memory and is considerably faster than the NDFT.
N = M < 32 for d = 1, just use the NDFT or its Horner-like derivative.