fourier expansion to evaluate faddeeva
reference information
simplified way to do (-1)^n
evaluate many times to test time
shift and bit-wise .and. works apparently
now find the fastest one