Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Calculus > Integral Transforms > Fourier Analysis >

FourierSequenceTransform

FourierSequenceTransform[expr, n, Omega]
gives the Fourier sequence transform of expr.
FourierSequenceTransform[expr, {n1, n2, ...}, {Omega1, Omega2, ...}]
gives the multdimensional Fourier sequence transform.
  • FourierSequenceTransform[expr, n, Omega] takes a sequence whose n^(th) term is given by expr, and yields a function of the continuous parameter Omega.
  • The Fourier sequence transform of f(n) is by default defined to be sum_(n=-infty)^inftyf(n) ⅇ^(-ⅈ n omega).
  • The multidimensional transform of f(n_1,n_2,...) is defined to be sum_(n_1=-infty)^inftysum_(n_2=-infty)^infty... f(n_1,n_2,...) ⅇ^(-ⅈ (n_1 omega_1+n_2 omega_2+...)).
  • The following options can be given:
Assumptions$Assumptionsassumptions on parameters
FourierParameters{1,1}parameters to definite discrete-time Fourier transform
GenerateConditionsFalsewhether to generate results that involve conditions on parameters
{1, 1}sum_(n=-infty)^inftyf(n) ⅇ^(-ⅈ n omega)default settings
{1, -2Pi}sum_(n=-infty)^inftyf(n) ⅇ^(ⅈ 2 pi n omega)period 1
{a, b}general setting
Find the discrete-time Fourier transform of a simple signal:
Find a bivariate discrete-time Fourier transform:
Find the discrete-time Fourier transform of a simple signal:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
Find a bivariate discrete-time Fourier transform:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Compute the transform for each frequency Omega:
Plot the spectrum:
The phase:
Plot both spectrum and phase using color:
Constant:
Periodic:
Impulse:
Exponential:
Exponential polynomial:
Rational sequence:
Rational-trigonometric:
Hypergeometric terms:
Use a non-default setting for FourierParameters:
Obtain conditions on parameters:
FourierSequenceTransform is defined by a doubly infinite sum:
FourierSequenceTransform is closely related to ZTransform:
A discrete analog of FourierTransform being closely related to LaplaceTransform:
FourierSequenceTransform is the periodic inverse to FourierCoefficient:
The result is periodic, which is assumed in the definition for FourierCoefficient:
FourierSequenceTransform provides a q-analog for generating function:
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team