EDA365欢迎您登录!
您需要 登录 才可以下载或查看,没有帐号?注册
x
本帖最后由 mytomorrow 于 2019-12-10 10:08 编辑
9 g3 k8 o* V. Z/ V- l2 I
5 H/ c% }+ z: l7 Z( C* l# U目录 ifft Syntax Description 0 {( f9 Z0 h0 [
" {! _) f* e1 c0 B! {4 u
ifft
/ k) ~+ @- \/ x
Inverse fast Fourier transform
# g$ ?# V4 S& I' A- L' O$ Q
6 U l( a3 T4 N) ~7 i- h
Syntax : a# l3 @! b9 o% [3 a( m
X = ifft(Y) 8 C1 u% D1 U5 d9 [% r# {7 q
X = ifft(Y,n)
( K) ^. g; U% A; C# C
X = ifft(Y,n,dim)
$ w+ s; r/ w3 }
X = ifft(___,symflag) 3 f9 _8 e5 ^4 C d& I
, i; G' ]. C& }, B' ^
Description
& u2 I8 F/ u4 x# q7 d: l( Q
X = ifft(Y) 9 A( m: S% s+ o' k" b% y
X = ifft(Y) computes the inverse discrete Fourier transform of Y using a fast Fourier transform algorithm. X is the same size as Y. $ \( |3 E1 B4 Q
- If Y is a vector, then ifft(Y) returns the inverse transform of the vector.7 f$ }' H$ |4 t# `. |! Q9 x
4 X% y) x! N7 I7 e( @
- If Y is a matrix, then ifft(Y) returns the inverse transform of each column of the matrix.
. g" i( K' E, e! N+ I
, s2 d6 z: t* @ U2 e. r7 m$ S/ |
- If Y is a multidimensional array, then ifft(Y) treats the values along the first dimension whose size does not equal 1 as vectors and returns the inverse transform of each vector.
7 E8 \: ~5 K" c9 J
% Y" g( p5 j0 `4 \3 V6 B
本想翻译一下的,但是手册里面的英文描述的太清晰了,单词也很简单,所以就这样直接看吧。 . R) j9 }; g9 p* u7 }+ ?8 l5 _
X = ifft(Y,n) returns the n-point inverse Fourier transform of Y by padding Y with trailing zeros to length n.
. u! h3 F+ T9 w# _9 _- J3 M1 E/ U) z! B
X = ifft(Y,n,dim) returns the inverse Fourier transform along the dimension dim. For example, if Y is a matrix, then ifft(Y,n,2) returns the n-point inverse transform of each row.
8 p: C) j) I1 e* _, d& a4 q
X = ifft(Y,n,dim)沿维度dim返回逆傅立叶变换。 例如,如果Y是矩阵,则ifft(Y,n,2)返回每行的n点逆变换。
- g) I, z/ e5 e5 t
X = ifft(___,symflag) specifies the symmetry of Y. For example, ifft(Y,'symmetric') treats Y as conjugate symmetric.
* K8 y5 ~. w. T: _- [3 N0 C% f
X = ifft(___,symflag)指定Y的对称性。例如,ifft(Y,'symmetric')将Y视为共轭对称。
& \. O: A' F8 z/ |# l* ~
% H5 o* y8 w+ k$ F
( E9 t( j. |, G3 {! G0 q* ]* }" r' C
|