diff options
author | cookedm <cookedm@localhost> | 2006-07-06 16:57:20 +0000 |
---|---|---|
committer | cookedm <cookedm@localhost> | 2006-07-06 16:57:20 +0000 |
commit | 6782a92fd1a7625ee48f6b2946a7d7149ab28a77 (patch) | |
tree | 177a92f0673655b58b247e663477af06ac1192b6 /numpy/dft/helper.py | |
parent | 216f071ab060a6f08c22666aea33f7095f079d1e (diff) | |
download | numpy-6782a92fd1a7625ee48f6b2946a7d7149ab28a77.tar.gz |
Branch numpy.distutils to distutils-revamp
Diffstat (limited to 'numpy/dft/helper.py')
-rw-r--r-- | numpy/dft/helper.py | 66 |
1 files changed, 0 insertions, 66 deletions
diff --git a/numpy/dft/helper.py b/numpy/dft/helper.py deleted file mode 100644 index 4e1da2abd..000000000 --- a/numpy/dft/helper.py +++ /dev/null @@ -1,66 +0,0 @@ -""" -Discrete Fourier Transforms - helper.py -""" -# Created by Pearu Peterson, September 2002 - -__all__ = ['fftshift','ifftshift','fftfreq'] - -from numpy.core import asarray, concatenate, arange, take, \ - array, integer -import types - -def fftshift(x,axes=None): - """ fftshift(x, axes=None) -> y - - Shift zero-frequency component to center of spectrum. - - This function swaps half-spaces for all axes listed (defaults to all). - - Notes: - If len(x) is even then the Nyquist component is y[0]. - """ - tmp = asarray(x) - ndim = len(tmp.shape) - if axes is None: - axes = range(ndim) - y = tmp - for k in axes: - n = tmp.shape[k] - p2 = (n+1)/2 - mylist = concatenate((arange(p2,n),arange(p2))) - y = take(y,mylist,k) - return y - - -def ifftshift(x,axes=None): - """ ifftshift(x,axes=None) - > y - - Inverse of fftshift. - """ - tmp = asarray(x) - ndim = len(tmp.shape) - if axes is None: - axes = range(ndim) - y = tmp - for k in axes: - n = tmp.shape[k] - p2 = n-(n+1)/2 - mylist = concatenate((arange(p2,n),arange(p2))) - y = take(y,mylist,k) - return y - -def fftfreq(n,d=1.0): - """ fftfreq(n, d=1.0) -> f - - DFT sample frequencies - - The returned float array contains the frequency bins in - cycles/unit (with zero at the start) given a window length n and a - sample spacing d: - - f = [0,1,...,n/2-1,-n/2,...,-1]/(d*n) if n is even - f = [0,1,...,(n-1)/2,-(n-1)/2,...,-1]/(d*n) if n is odd - """ - assert isinstance(n,types.IntType) or isinstance(n, integer) - k = range(0,(n-1)/2+1)+range(-(n/2),0) - return array(k,'d')/(n*d) |