|
180 | 180 | """ |
181 | 181 | import numpy as np |
182 | 182 | from scipy.special import loggamma |
183 | | -from scipy.fftpack._fftpack import drfft |
184 | | -# from scipy.fftpack import rfft, irfft |
185 | | -# from scipy.fftpack.basic import _raw_fft |
| 183 | +from scipy.fftpack import rfft, irfft |
186 | 184 |
|
187 | 185 |
|
188 | 186 | def fhti(n, mu, dlnr, q=0, kr=1, kropt=0): |
@@ -599,9 +597,7 @@ def fhtq(a, xsave, tdir=1): |
599 | 597 | n = fct.size |
600 | 598 |
|
601 | 599 | # normal FFT |
602 | | - # fct = rfft(fct) |
603 | | - # _raw_fft(fct, n, -1, 1, 1, _fftpack.drfft) |
604 | | - fct = drfft(fct, n, 1, 0) |
| 600 | + fct = rfft(fct) |
605 | 601 |
|
606 | 602 | m = np.arange(1, n//2, dtype=int) # index variable |
607 | 603 | if q == 0: # unbiased (q = 0) transform |
@@ -667,9 +663,7 @@ def fhtq(a, xsave, tdir=1): |
667 | 663 | fct[-1] /= ar |
668 | 664 |
|
669 | 665 | # normal FFT back |
670 | | - # fct = irfft(fct) |
671 | | - # _raw_fft(fct, n, -1, -1, 1, _fftpack.drfft) |
672 | | - fct = drfft(fct, n, -1, 1) |
| 666 | + fct = irfft(fct) |
673 | 667 |
|
674 | 668 | # reverse the array and at the same time undo the FFTs' multiplication by n |
675 | 669 | # => Just reverse the array, the rest is already done in drfft. |
|
0 commit comments