diff options
| author | Charles Harris <charlesr.harris@gmail.com> | 2013-08-18 11:16:06 -0600 |
|---|---|---|
| committer | Charles Harris <charlesr.harris@gmail.com> | 2013-08-18 11:20:45 -0600 |
| commit | 8ddb0ce0acafe75d78df528b4d2540dfbf4b364d (patch) | |
| tree | 156b23f48f14c7c1df699874007c521b5482d1a4 /numpy/fft | |
| parent | 13b0b272f764c14bc4ac34f5b19fd030d9c611a4 (diff) | |
| download | numpy-8ddb0ce0acafe75d78df528b4d2540dfbf4b364d.tar.gz | |
STY: Giant whitespace cleanup.
Now is as good a time as any with open PR's at a low.
Diffstat (limited to 'numpy/fft')
| -rw-r--r-- | numpy/fft/fftpack.py | 12 | ||||
| -rw-r--r-- | numpy/fft/helper.py | 12 |
2 files changed, 12 insertions, 12 deletions
diff --git a/numpy/fft/fftpack.py b/numpy/fft/fftpack.py index 4961b2989..2ca6cc668 100644 --- a/numpy/fft/fftpack.py +++ b/numpy/fft/fftpack.py @@ -273,7 +273,7 @@ def rfft(a, n=None, axis=-1): out : complex ndarray The truncated or zero-padded input, transformed along the axis indicated by `axis`, or the last one if `axis` is not specified. - If `n` is even, the length of the transformed axis is ``(n/2)+1``. + If `n` is even, the length of the transformed axis is ``(n/2)+1``. If `n` is odd, the length is ``(n+1)/2``. Raises @@ -298,13 +298,13 @@ def rfft(a, n=None, axis=-1): compute the negative frequency terms, and the length of the transformed axis of the output is therefore ``n//2+1``. - When ``A = rfft(a)`` and fs is the sampling frequency, ``A[0]`` contains + When ``A = rfft(a)`` and fs is the sampling frequency, ``A[0]`` contains the zero-frequency term 0*fs, which is real due to Hermitian symmetry. - If `n` is even, ``A[-1]`` contains the term representing both positive - and negative Nyquist frequency (+fs/2 and -fs/2), and must also be purely - real. If `n` is odd, there is no term at fs/2; ``A[-1]`` contains - the largest positive frequency (fs/2*(n-1)/n), and is complex in the + If `n` is even, ``A[-1]`` contains the term representing both positive + and negative Nyquist frequency (+fs/2 and -fs/2), and must also be purely + real. If `n` is odd, there is no term at fs/2; ``A[-1]`` contains + the largest positive frequency (fs/2*(n-1)/n), and is complex in the general case. If the input `a` contains an imaginary part, it is silently discarded. diff --git a/numpy/fft/helper.py b/numpy/fft/helper.py index 0a475153f..058f6864d 100644 --- a/numpy/fft/helper.py +++ b/numpy/fft/helper.py @@ -125,8 +125,8 @@ def fftfreq(n, d=1.0): """ Return the Discrete Fourier Transform sample frequencies. - The returned float array `f` contains the frequency bin centers in cycles - per unit of the sample spacing (with zero at the start). For instance, if + The returned float array `f` contains the frequency bin centers in cycles + per unit of the sample spacing (with zero at the start). For instance, if the sample spacing is in seconds, then the frequency unit is cycles/second. Given a window length `n` and a sample spacing `d`:: @@ -140,7 +140,7 @@ def fftfreq(n, d=1.0): Window length. d : scalar, optional Sample spacing (inverse of the sampling rate). Defaults to 1. - + Returns ------- f : ndarray @@ -172,11 +172,11 @@ def fftfreq(n, d=1.0): def rfftfreq(n, d=1.0): """ - Return the Discrete Fourier Transform sample frequencies + Return the Discrete Fourier Transform sample frequencies (for usage with rfft, irfft). - The returned float array `f` contains the frequency bin centers in cycles - per unit of the sample spacing (with zero at the start). For instance, if + The returned float array `f` contains the frequency bin centers in cycles + per unit of the sample spacing (with zero at the start). For instance, if the sample spacing is in seconds, then the frequency unit is cycles/second. Given a window length `n` and a sample spacing `d`:: |