Determine Discrete-Time Fourier Transform of exponential or sine with time-shift? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)If a Fourier Transform is continuous in frequency, then what are the “harmonics”?Using Discrete Fourier trasform of the samples of a continuous/periodic signal to obtain frequency data similar to FT of the original signalConfusion about a simple Fourier TransformCalculate Inverse Discrete Time Fourier TransformFourier transform of phase shifted sinusoidSpace-time Fourier explainerFourier Transform Notation in Signal Processing1D Fourier transform of 2D function with shiftDiscrete Fourier Transform of Sinc FunctionDiscrete-time Fourier transform of $x[n] = 1$
Illegal assignment from sObject to Id
Find 108 by using 3,4,6
An adverb for when you're not exaggerating
Maximum summed subsequences with non-adjacent items
Why does the remaining Rebel fleet at the end of Rogue One seem dramatically larger than the one in A New Hope?
Did Deadpool rescue all of the X-Force?
What is the difference between globalisation and imperialism?
How fail-safe is nr as stop bytes?
How does the math work when buying airline miles?
Denied boarding although I have proper visa and documentation. To whom should I make a complaint?
Take 2! Is this homebrew Lady of Pain warlock patron balanced?
How do I find out the mythology and history of my Fortress?
Selecting user stories during sprint planning
Is CEO the "profession" with the most psychopaths?
AppleTVs create a chatty alternate WiFi network
What would you call this weird metallic apparatus that allows you to lift people?
How would a mousetrap for use in space work?
How to tell that you are a giant?
Can anything be seen from the center of the Boötes void? How dark would it be?
How to install press fit bottom bracket into new frame
How can I reduce the gap between left and right of cdot with a macro?
What's the meaning of "fortified infraction restraint"?
What is this clumpy 20-30cm high yellow-flowered plant?
Is there hard evidence that the grant peer review system performs significantly better than random?
Determine Discrete-Time Fourier Transform of exponential or sine with time-shift?
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)If a Fourier Transform is continuous in frequency, then what are the “harmonics”?Using Discrete Fourier trasform of the samples of a continuous/periodic signal to obtain frequency data similar to FT of the original signalConfusion about a simple Fourier TransformCalculate Inverse Discrete Time Fourier TransformFourier transform of phase shifted sinusoidSpace-time Fourier explainerFourier Transform Notation in Signal Processing1D Fourier transform of 2D function with shiftDiscrete Fourier Transform of Sinc FunctionDiscrete-time Fourier transform of $x[n] = 1$
$begingroup$
Consider the following periodic and time-discrete signal:
$$y[n] = sin (Omega_0 n+phi)$$
How do I determine the discrete-time Fourier transform for $-pi<Omega<pi$ for that signal?
I know that the $theta$ causes a time shift, equal to $e^jOmegathetaX[Omega]$ in the frequency domain. But how is $x[n]=sin(Omega_0n)$ transformed into the following?
$$X[Omega]=fracpijsum_k=-infty^infty {delta(Omega-Omega_0 -2pi k)-delta/Omega+Omega_0 -2pi k)$$
Where does $pi$ come from and the delta function?
Thank you!
fourier-analysis fourier-transform signal-processing discrete-time
$endgroup$
add a comment |
$begingroup$
Consider the following periodic and time-discrete signal:
$$y[n] = sin (Omega_0 n+phi)$$
How do I determine the discrete-time Fourier transform for $-pi<Omega<pi$ for that signal?
I know that the $theta$ causes a time shift, equal to $e^jOmegathetaX[Omega]$ in the frequency domain. But how is $x[n]=sin(Omega_0n)$ transformed into the following?
$$X[Omega]=fracpijsum_k=-infty^infty {delta(Omega-Omega_0 -2pi k)-delta/Omega+Omega_0 -2pi k)$$
Where does $pi$ come from and the delta function?
Thank you!
fourier-analysis fourier-transform signal-processing discrete-time
$endgroup$
add a comment |
$begingroup$
Consider the following periodic and time-discrete signal:
$$y[n] = sin (Omega_0 n+phi)$$
How do I determine the discrete-time Fourier transform for $-pi<Omega<pi$ for that signal?
I know that the $theta$ causes a time shift, equal to $e^jOmegathetaX[Omega]$ in the frequency domain. But how is $x[n]=sin(Omega_0n)$ transformed into the following?
$$X[Omega]=fracpijsum_k=-infty^infty {delta(Omega-Omega_0 -2pi k)-delta/Omega+Omega_0 -2pi k)$$
Where does $pi$ come from and the delta function?
Thank you!
fourier-analysis fourier-transform signal-processing discrete-time
$endgroup$
Consider the following periodic and time-discrete signal:
$$y[n] = sin (Omega_0 n+phi)$$
How do I determine the discrete-time Fourier transform for $-pi<Omega<pi$ for that signal?
I know that the $theta$ causes a time shift, equal to $e^jOmegathetaX[Omega]$ in the frequency domain. But how is $x[n]=sin(Omega_0n)$ transformed into the following?
$$X[Omega]=fracpijsum_k=-infty^infty {delta(Omega-Omega_0 -2pi k)-delta/Omega+Omega_0 -2pi k)$$
Where does $pi$ come from and the delta function?
Thank you!
fourier-analysis fourier-transform signal-processing discrete-time
fourier-analysis fourier-transform signal-processing discrete-time
edited Mar 28 at 10:22
Defindun
asked Mar 27 at 17:13
DefindunDefindun
387
387
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
First, an example with simple exponential
We start off by a simplified example with the determining the Discrete-Time Fourier Transform (DTFT) of the exponential function given by
$$x_1[n]=e^iOmega_0n tag1.$$
Using the Fourier Transform
$$mathcal Fx_1[n] tag2=X_1(Omega)=sum_k=-infty^inftyx_1[k]e^-iOmega k$$
we can calculate $mathcal F x_1[n]$ by substituting $x_1[n]$ and simplify the expression as follows:
$$sum_k=-infty^inftye^iOmega_0 ke^-iOmega k=sum_k=-infty^inftye^i(Omega_0-Omega)k tag3$$
Then, by defining $Omega'=Omega - Omega_0$ (observe the changed order) so that
$$sum_k=-infty^infty1cdot e^-iOmega'k tag4$$
we cleary see that it's now just the DTFT of a constant $1$, i.e. $mathcal F 1 $, which is given by
$$mathcal F 1 =2pi delta(Omega') tag5$$
and $2pi delta(Omega-Omega_0)$ in our case. Now, why is this? Where does the $2pi$ come from?
So we have assumed that $mathcal F 1 = 2pidelta(Omega)$, which defines the constant $1$ as a function $x_2[n]=1$. If we use the Inverse Discrete-Time Fourier Transform (IDTFT)
$$mathcal F^-1 X_2(Omega) = frac12pi int_-pi^pi X_2(Omega)e^iOmega n dOmega tag6$$
and substitute $X_2(Omega)$ for our assumed $2pidelta(Omega)$ we get
$$frac12pi int_-pi^pi 2pidelta(Omega)e^iOmega n dOmega tag7$$
which, since $delta(Omega)$ is "on" or $1$ only for $Omega=0$, evaulates to
$$frac2pi2pi e^iOmega 0 = 1. tag8$$
We have thereby shown that the DTFT of a constant $1$ is equal to $2pidelta(Omega)$.
If we now continue from equation $(4)$, we have that the resulting DTFT of an exponential $x_1[n]=e^iOmega_0n$ becomes
$$mathcal Fx_1[n] = sum_k=-infty^infty1cdot e^-iOmega'k = 2pidelta(Omega') = 2pidelta(Omega - Omega_0) tag9.$$
Secondly, show Discrete-Time Fourier Transform of a sine
We have the discrete-time function
$$y[n]=sin(Omega_0n+phi) tag10.$$
Observe that the $phi$ causes a time-shift and can be handled separately. Therefore consider, for now, only the function
$$x[n]=sin(Omega_0n) tag11.$$
Using Euler's formula we can write the sine as exponentials in the form
$$x[n]=frac12i left ( e^iOmega_0n - e^-iOmega_0n right ) tag12$$
Using the DTFT of $x[n]$ we get
$$mathcal F x[n] = sum_k=-infty^inftyfrac12i left ( e^iOmega_0k - e^-iOmega_0k right ) e^-iOmega k tag13$$
which can be rewritten as
$$frac12i left [ sum_k=-infty^inftye^-i(Omega-Omega_0)k - sum_k=-infty^inftye^-i(Omega+Omega_0)k right] tag14.$$
We can now see that each term in equation $(14)$ is on the form in equation $(9)$ and therefore we get
$$frac12i left [ 2pidelta(Omega-Omega_0) - 2pidelta(Omega+Omega_0 right] tag15$$
and
$$ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag16$$
if we shift the order of the terms to compensate the negative sign when $i$ jumps up from the denominator.
To consider the time-shift $phi$ we mutltiply our results with $e^iOmegaphi$ and finally get
$$e^iOmegaphi cdot ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag17$$
I'm not a hundred percent certain of my answer and I don't fully understand how to get the general form in the questions asked. If someone has edits to suggest, please do so.
The solutions are inspired and based on the following YouTube videos:
- https://www.youtube.com/watch?v=El1pSEUxg-c&
- https://www.youtube.com/watch?v=3USY_IHOfnk
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3164796%2fdetermine-discrete-time-fourier-transform-of-exponential-or-sine-with-time-shift%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
First, an example with simple exponential
We start off by a simplified example with the determining the Discrete-Time Fourier Transform (DTFT) of the exponential function given by
$$x_1[n]=e^iOmega_0n tag1.$$
Using the Fourier Transform
$$mathcal Fx_1[n] tag2=X_1(Omega)=sum_k=-infty^inftyx_1[k]e^-iOmega k$$
we can calculate $mathcal F x_1[n]$ by substituting $x_1[n]$ and simplify the expression as follows:
$$sum_k=-infty^inftye^iOmega_0 ke^-iOmega k=sum_k=-infty^inftye^i(Omega_0-Omega)k tag3$$
Then, by defining $Omega'=Omega - Omega_0$ (observe the changed order) so that
$$sum_k=-infty^infty1cdot e^-iOmega'k tag4$$
we cleary see that it's now just the DTFT of a constant $1$, i.e. $mathcal F 1 $, which is given by
$$mathcal F 1 =2pi delta(Omega') tag5$$
and $2pi delta(Omega-Omega_0)$ in our case. Now, why is this? Where does the $2pi$ come from?
So we have assumed that $mathcal F 1 = 2pidelta(Omega)$, which defines the constant $1$ as a function $x_2[n]=1$. If we use the Inverse Discrete-Time Fourier Transform (IDTFT)
$$mathcal F^-1 X_2(Omega) = frac12pi int_-pi^pi X_2(Omega)e^iOmega n dOmega tag6$$
and substitute $X_2(Omega)$ for our assumed $2pidelta(Omega)$ we get
$$frac12pi int_-pi^pi 2pidelta(Omega)e^iOmega n dOmega tag7$$
which, since $delta(Omega)$ is "on" or $1$ only for $Omega=0$, evaulates to
$$frac2pi2pi e^iOmega 0 = 1. tag8$$
We have thereby shown that the DTFT of a constant $1$ is equal to $2pidelta(Omega)$.
If we now continue from equation $(4)$, we have that the resulting DTFT of an exponential $x_1[n]=e^iOmega_0n$ becomes
$$mathcal Fx_1[n] = sum_k=-infty^infty1cdot e^-iOmega'k = 2pidelta(Omega') = 2pidelta(Omega - Omega_0) tag9.$$
Secondly, show Discrete-Time Fourier Transform of a sine
We have the discrete-time function
$$y[n]=sin(Omega_0n+phi) tag10.$$
Observe that the $phi$ causes a time-shift and can be handled separately. Therefore consider, for now, only the function
$$x[n]=sin(Omega_0n) tag11.$$
Using Euler's formula we can write the sine as exponentials in the form
$$x[n]=frac12i left ( e^iOmega_0n - e^-iOmega_0n right ) tag12$$
Using the DTFT of $x[n]$ we get
$$mathcal F x[n] = sum_k=-infty^inftyfrac12i left ( e^iOmega_0k - e^-iOmega_0k right ) e^-iOmega k tag13$$
which can be rewritten as
$$frac12i left [ sum_k=-infty^inftye^-i(Omega-Omega_0)k - sum_k=-infty^inftye^-i(Omega+Omega_0)k right] tag14.$$
We can now see that each term in equation $(14)$ is on the form in equation $(9)$ and therefore we get
$$frac12i left [ 2pidelta(Omega-Omega_0) - 2pidelta(Omega+Omega_0 right] tag15$$
and
$$ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag16$$
if we shift the order of the terms to compensate the negative sign when $i$ jumps up from the denominator.
To consider the time-shift $phi$ we mutltiply our results with $e^iOmegaphi$ and finally get
$$e^iOmegaphi cdot ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag17$$
I'm not a hundred percent certain of my answer and I don't fully understand how to get the general form in the questions asked. If someone has edits to suggest, please do so.
The solutions are inspired and based on the following YouTube videos:
- https://www.youtube.com/watch?v=El1pSEUxg-c&
- https://www.youtube.com/watch?v=3USY_IHOfnk
$endgroup$
add a comment |
$begingroup$
First, an example with simple exponential
We start off by a simplified example with the determining the Discrete-Time Fourier Transform (DTFT) of the exponential function given by
$$x_1[n]=e^iOmega_0n tag1.$$
Using the Fourier Transform
$$mathcal Fx_1[n] tag2=X_1(Omega)=sum_k=-infty^inftyx_1[k]e^-iOmega k$$
we can calculate $mathcal F x_1[n]$ by substituting $x_1[n]$ and simplify the expression as follows:
$$sum_k=-infty^inftye^iOmega_0 ke^-iOmega k=sum_k=-infty^inftye^i(Omega_0-Omega)k tag3$$
Then, by defining $Omega'=Omega - Omega_0$ (observe the changed order) so that
$$sum_k=-infty^infty1cdot e^-iOmega'k tag4$$
we cleary see that it's now just the DTFT of a constant $1$, i.e. $mathcal F 1 $, which is given by
$$mathcal F 1 =2pi delta(Omega') tag5$$
and $2pi delta(Omega-Omega_0)$ in our case. Now, why is this? Where does the $2pi$ come from?
So we have assumed that $mathcal F 1 = 2pidelta(Omega)$, which defines the constant $1$ as a function $x_2[n]=1$. If we use the Inverse Discrete-Time Fourier Transform (IDTFT)
$$mathcal F^-1 X_2(Omega) = frac12pi int_-pi^pi X_2(Omega)e^iOmega n dOmega tag6$$
and substitute $X_2(Omega)$ for our assumed $2pidelta(Omega)$ we get
$$frac12pi int_-pi^pi 2pidelta(Omega)e^iOmega n dOmega tag7$$
which, since $delta(Omega)$ is "on" or $1$ only for $Omega=0$, evaulates to
$$frac2pi2pi e^iOmega 0 = 1. tag8$$
We have thereby shown that the DTFT of a constant $1$ is equal to $2pidelta(Omega)$.
If we now continue from equation $(4)$, we have that the resulting DTFT of an exponential $x_1[n]=e^iOmega_0n$ becomes
$$mathcal Fx_1[n] = sum_k=-infty^infty1cdot e^-iOmega'k = 2pidelta(Omega') = 2pidelta(Omega - Omega_0) tag9.$$
Secondly, show Discrete-Time Fourier Transform of a sine
We have the discrete-time function
$$y[n]=sin(Omega_0n+phi) tag10.$$
Observe that the $phi$ causes a time-shift and can be handled separately. Therefore consider, for now, only the function
$$x[n]=sin(Omega_0n) tag11.$$
Using Euler's formula we can write the sine as exponentials in the form
$$x[n]=frac12i left ( e^iOmega_0n - e^-iOmega_0n right ) tag12$$
Using the DTFT of $x[n]$ we get
$$mathcal F x[n] = sum_k=-infty^inftyfrac12i left ( e^iOmega_0k - e^-iOmega_0k right ) e^-iOmega k tag13$$
which can be rewritten as
$$frac12i left [ sum_k=-infty^inftye^-i(Omega-Omega_0)k - sum_k=-infty^inftye^-i(Omega+Omega_0)k right] tag14.$$
We can now see that each term in equation $(14)$ is on the form in equation $(9)$ and therefore we get
$$frac12i left [ 2pidelta(Omega-Omega_0) - 2pidelta(Omega+Omega_0 right] tag15$$
and
$$ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag16$$
if we shift the order of the terms to compensate the negative sign when $i$ jumps up from the denominator.
To consider the time-shift $phi$ we mutltiply our results with $e^iOmegaphi$ and finally get
$$e^iOmegaphi cdot ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag17$$
I'm not a hundred percent certain of my answer and I don't fully understand how to get the general form in the questions asked. If someone has edits to suggest, please do so.
The solutions are inspired and based on the following YouTube videos:
- https://www.youtube.com/watch?v=El1pSEUxg-c&
- https://www.youtube.com/watch?v=3USY_IHOfnk
$endgroup$
add a comment |
$begingroup$
First, an example with simple exponential
We start off by a simplified example with the determining the Discrete-Time Fourier Transform (DTFT) of the exponential function given by
$$x_1[n]=e^iOmega_0n tag1.$$
Using the Fourier Transform
$$mathcal Fx_1[n] tag2=X_1(Omega)=sum_k=-infty^inftyx_1[k]e^-iOmega k$$
we can calculate $mathcal F x_1[n]$ by substituting $x_1[n]$ and simplify the expression as follows:
$$sum_k=-infty^inftye^iOmega_0 ke^-iOmega k=sum_k=-infty^inftye^i(Omega_0-Omega)k tag3$$
Then, by defining $Omega'=Omega - Omega_0$ (observe the changed order) so that
$$sum_k=-infty^infty1cdot e^-iOmega'k tag4$$
we cleary see that it's now just the DTFT of a constant $1$, i.e. $mathcal F 1 $, which is given by
$$mathcal F 1 =2pi delta(Omega') tag5$$
and $2pi delta(Omega-Omega_0)$ in our case. Now, why is this? Where does the $2pi$ come from?
So we have assumed that $mathcal F 1 = 2pidelta(Omega)$, which defines the constant $1$ as a function $x_2[n]=1$. If we use the Inverse Discrete-Time Fourier Transform (IDTFT)
$$mathcal F^-1 X_2(Omega) = frac12pi int_-pi^pi X_2(Omega)e^iOmega n dOmega tag6$$
and substitute $X_2(Omega)$ for our assumed $2pidelta(Omega)$ we get
$$frac12pi int_-pi^pi 2pidelta(Omega)e^iOmega n dOmega tag7$$
which, since $delta(Omega)$ is "on" or $1$ only for $Omega=0$, evaulates to
$$frac2pi2pi e^iOmega 0 = 1. tag8$$
We have thereby shown that the DTFT of a constant $1$ is equal to $2pidelta(Omega)$.
If we now continue from equation $(4)$, we have that the resulting DTFT of an exponential $x_1[n]=e^iOmega_0n$ becomes
$$mathcal Fx_1[n] = sum_k=-infty^infty1cdot e^-iOmega'k = 2pidelta(Omega') = 2pidelta(Omega - Omega_0) tag9.$$
Secondly, show Discrete-Time Fourier Transform of a sine
We have the discrete-time function
$$y[n]=sin(Omega_0n+phi) tag10.$$
Observe that the $phi$ causes a time-shift and can be handled separately. Therefore consider, for now, only the function
$$x[n]=sin(Omega_0n) tag11.$$
Using Euler's formula we can write the sine as exponentials in the form
$$x[n]=frac12i left ( e^iOmega_0n - e^-iOmega_0n right ) tag12$$
Using the DTFT of $x[n]$ we get
$$mathcal F x[n] = sum_k=-infty^inftyfrac12i left ( e^iOmega_0k - e^-iOmega_0k right ) e^-iOmega k tag13$$
which can be rewritten as
$$frac12i left [ sum_k=-infty^inftye^-i(Omega-Omega_0)k - sum_k=-infty^inftye^-i(Omega+Omega_0)k right] tag14.$$
We can now see that each term in equation $(14)$ is on the form in equation $(9)$ and therefore we get
$$frac12i left [ 2pidelta(Omega-Omega_0) - 2pidelta(Omega+Omega_0 right] tag15$$
and
$$ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag16$$
if we shift the order of the terms to compensate the negative sign when $i$ jumps up from the denominator.
To consider the time-shift $phi$ we mutltiply our results with $e^iOmegaphi$ and finally get
$$e^iOmegaphi cdot ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag17$$
I'm not a hundred percent certain of my answer and I don't fully understand how to get the general form in the questions asked. If someone has edits to suggest, please do so.
The solutions are inspired and based on the following YouTube videos:
- https://www.youtube.com/watch?v=El1pSEUxg-c&
- https://www.youtube.com/watch?v=3USY_IHOfnk
$endgroup$
First, an example with simple exponential
We start off by a simplified example with the determining the Discrete-Time Fourier Transform (DTFT) of the exponential function given by
$$x_1[n]=e^iOmega_0n tag1.$$
Using the Fourier Transform
$$mathcal Fx_1[n] tag2=X_1(Omega)=sum_k=-infty^inftyx_1[k]e^-iOmega k$$
we can calculate $mathcal F x_1[n]$ by substituting $x_1[n]$ and simplify the expression as follows:
$$sum_k=-infty^inftye^iOmega_0 ke^-iOmega k=sum_k=-infty^inftye^i(Omega_0-Omega)k tag3$$
Then, by defining $Omega'=Omega - Omega_0$ (observe the changed order) so that
$$sum_k=-infty^infty1cdot e^-iOmega'k tag4$$
we cleary see that it's now just the DTFT of a constant $1$, i.e. $mathcal F 1 $, which is given by
$$mathcal F 1 =2pi delta(Omega') tag5$$
and $2pi delta(Omega-Omega_0)$ in our case. Now, why is this? Where does the $2pi$ come from?
So we have assumed that $mathcal F 1 = 2pidelta(Omega)$, which defines the constant $1$ as a function $x_2[n]=1$. If we use the Inverse Discrete-Time Fourier Transform (IDTFT)
$$mathcal F^-1 X_2(Omega) = frac12pi int_-pi^pi X_2(Omega)e^iOmega n dOmega tag6$$
and substitute $X_2(Omega)$ for our assumed $2pidelta(Omega)$ we get
$$frac12pi int_-pi^pi 2pidelta(Omega)e^iOmega n dOmega tag7$$
which, since $delta(Omega)$ is "on" or $1$ only for $Omega=0$, evaulates to
$$frac2pi2pi e^iOmega 0 = 1. tag8$$
We have thereby shown that the DTFT of a constant $1$ is equal to $2pidelta(Omega)$.
If we now continue from equation $(4)$, we have that the resulting DTFT of an exponential $x_1[n]=e^iOmega_0n$ becomes
$$mathcal Fx_1[n] = sum_k=-infty^infty1cdot e^-iOmega'k = 2pidelta(Omega') = 2pidelta(Omega - Omega_0) tag9.$$
Secondly, show Discrete-Time Fourier Transform of a sine
We have the discrete-time function
$$y[n]=sin(Omega_0n+phi) tag10.$$
Observe that the $phi$ causes a time-shift and can be handled separately. Therefore consider, for now, only the function
$$x[n]=sin(Omega_0n) tag11.$$
Using Euler's formula we can write the sine as exponentials in the form
$$x[n]=frac12i left ( e^iOmega_0n - e^-iOmega_0n right ) tag12$$
Using the DTFT of $x[n]$ we get
$$mathcal F x[n] = sum_k=-infty^inftyfrac12i left ( e^iOmega_0k - e^-iOmega_0k right ) e^-iOmega k tag13$$
which can be rewritten as
$$frac12i left [ sum_k=-infty^inftye^-i(Omega-Omega_0)k - sum_k=-infty^inftye^-i(Omega+Omega_0)k right] tag14.$$
We can now see that each term in equation $(14)$ is on the form in equation $(9)$ and therefore we get
$$frac12i left [ 2pidelta(Omega-Omega_0) - 2pidelta(Omega+Omega_0 right] tag15$$
and
$$ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag16$$
if we shift the order of the terms to compensate the negative sign when $i$ jumps up from the denominator.
To consider the time-shift $phi$ we mutltiply our results with $e^iOmegaphi$ and finally get
$$e^iOmegaphi cdot ipi left [ delta(Omega+Omega_0) - delta(Omega-Omega_0) right] tag17$$
I'm not a hundred percent certain of my answer and I don't fully understand how to get the general form in the questions asked. If someone has edits to suggest, please do so.
The solutions are inspired and based on the following YouTube videos:
- https://www.youtube.com/watch?v=El1pSEUxg-c&
- https://www.youtube.com/watch?v=3USY_IHOfnk
edited Mar 28 at 8:23
answered Mar 28 at 7:41
DefindunDefindun
387
387
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3164796%2fdetermine-discrete-time-fourier-transform-of-exponential-or-sine-with-time-shift%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown