xݕɬ[' d Z ddlmZmZmZmZmZ ddlmZm Z g dZ
e efZ ddZ
ee
d dd Z ee
d dd
Z e d dd Z e d dd
ZdS )z*
Discrete Fourier Transforms - helper.py
)integeremptyarangeasarrayroll)array_function_dispatch
set_module)fftshift ifftshiftfftfreqrfftfreqNc | fS N )xaxess d/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib64/python3.11/site-packages/numpy/fft/helper.py_fftshift_dispatcherr s
4K z numpy.fft)modulec t |3t t j }d j D }n4t |t r j | dz }n fd|D }t || S )ad
Shift the zero-frequency component to the center of the spectrum.
This function swaps half-spaces for all axes listed (defaults to all).
Note that ``y[0]`` is the Nyquist component only if ``len(x)`` is even.
Parameters
----------
x : array_like
Input array.
axes : int or shape tuple, optional
Axes over which to shift. Default is None, which shifts all axes.
Returns
-------
y : ndarray
The shifted array.
See Also
--------
ifftshift : The inverse of `fftshift`.
Examples
--------
>>> freqs = np.fft.fftfreq(10, 0.1)
>>> freqs
array([ 0., 1., 2., ..., -3., -2., -1.])
>>> np.fft.fftshift(freqs)
array([-5., -4., -3., -2., -1., 0., 1., 2., 3., 4.])
Shift the zero-frequency component only along the second axis:
>>> freqs = np.fft.fftfreq(9, d=1./9).reshape(3, 3)
>>> freqs
array([[ 0., 1., 2.],
[ 3., 4., -4.],
[-3., -2., -1.]])
>>> np.fft.fftshift(freqs, axes=(1,))
array([[ 2., 0., 1.],
[-4., 3., 4.],
[-1., -3., -2.]])
Nc g | ]}|d z S r .0dims r
z fftshift..C s ---c---r r c 0 g | ]}j | d z S r shaper axr s r r z fftshift..G s$ 111b!111r r tuplerangendimr!
isinstance
integer_typesr r r shifts ` r r
r
s Z
A |U16]]##--QW--- D- ( ( 2
"1111D111 5$ r c t |3t t j }d j D }n5t |t r j | dz }n fd|D }t || S )a/
The inverse of `fftshift`. Although identical for even-length `x`, the
functions differ by one sample for odd-length `x`.
Parameters
----------
x : array_like
Input array.
axes : int or shape tuple, optional
Axes over which to calculate. Defaults to None, which shifts all axes.
Returns
-------
y : ndarray
The shifted array.
See Also
--------
fftshift : Shift zero-frequency component to the center of the spectrum.
Examples
--------
>>> freqs = np.fft.fftfreq(9, d=1./9).reshape(3, 3)
>>> freqs
array([[ 0., 1., 2.],
[ 3., 4., -4.],
[-3., -2., -1.]])
>>> np.fft.ifftshift(np.fft.fftshift(freqs))
array([[ 0., 1., 2.],
[ 3., 4., -4.],
[-3., -2., -1.]])
Nc g | ]}|d z S r r r s r r z ifftshift..r s 0003!8000r r c 2 g | ]}j | d z S r r r" s r r z ifftshift..v s' 444172;!#$444r r$ r* s ` r r r L s F
A |U16]]##00000 D- ( ( 5'$-1$%4444t444 5$ r ?c $ t | t st d d| |z z }t | t }| dz
dz dz }t d|t }||d|< t | dz dt }|||d< ||z S )a-
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 sample spacing is in seconds, then the frequency unit is cycles/second.
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
Parameters
----------
n : int
Window length.
d : scalar, optional
Sample spacing (inverse of the sampling rate). Defaults to 1.
Returns
-------
f : ndarray
Array of length `n` containing the sample frequencies.
Examples
--------
>>> signal = np.array([-2, 8, 6, 4, 1, 0, 3, 5], dtype=float)
>>> fourier = np.fft.fft(signal)
>>> n = signal.size
>>> timestep = 0.1
>>> freq = np.fft.fftfreq(n, d=timestep)
>>> freq
array([ 0. , 1.25, 2.5 , ..., -3.75, -2.5 , -1.25])
n should be an integerr/ r r dtypeN)r( r)
ValueErrorr intr )ndvalresultsNp1p2s r r r { s J a ' ' 31222
Q-CAsmmG
1q1 A 1C BGBQBK !Q$# & & &BGABBK S=r c t | t st d d| |z z }| dz dz }t d|t }||z S )a?
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 sample spacing is in seconds, then the frequency unit is cycles/second.
Given a window length `n` and a sample spacing `d`::
f = [0, 1, ..., n/2-1, n/2] / (d*n) if n is even
f = [0, 1, ..., (n-1)/2-1, (n-1)/2] / (d*n) if n is odd
Unlike `fftfreq` (but like `scipy.fftpack.rfftfreq`)
the Nyquist frequency component is considered to be positive.
Parameters
----------
n : int
Window length.
d : scalar, optional
Sample spacing (inverse of the sampling rate). Defaults to 1.
Returns
-------
f : ndarray
Array of length ``n//2 + 1`` containing the sample frequencies.
Examples
--------
>>> signal = np.array([-2, 8, 6, 4, 1, 0, 3, 5, -3, 4], dtype=float)
>>> fourier = np.fft.rfft(signal)
>>> n = signal.size
>>> sample_rate = 100
>>> freq = np.fft.fftfreq(n, d=1./sample_rate)
>>> freq
array([ 0., 10., 20., ..., -30., -20., -10.])
>>> freq = np.fft.rfftfreq(n, d=1./sample_rate)
>>> freq
array([ 0., 10., 20., 30., 40., 50.])
r1 r/ r r2 r r3 )r( r) r5 r r6 )r7 r8 r9 r; r: s r r
r
s^ X a ' ' 31222
qs)C 1qAQ%%%G S=r r )r/ )__doc__
numpy.corer r r r r numpy.core.overridesr r __all__r6 r) r r
r r r
r r r rC sF = < < < < < < < < < < < < < D D D D D D D D ;
:
:g
-kBBB5 5 5 CB5 p -kBBB+ + + CB+ \ K- - - -` K0 0 0 0 0 0r