Discrete-time Fourier transform of $x[n] = 1$ The 2019 Stack Overflow Developer Survey Results Are InExistence of Fourier transformThe Continuity of the Discrete Time Fourier Transform of Absolutely Summable SeriesDiscrete time fourier transform of partial sumIs the definition of DTFT using $omega$ wrong?Using Fourier transform to compute Fourier series.Fourier transform accumulation propertyRelationship between short-time and large-frequency asymptotics in Fourier transformDTFT of the unit step functionOn the discrete-time Fourier transform of unit step sequence.Approximating inverse Fourier transform with inverse discrete Fourier transform

Why not take a picture of a closer black hole?

Old scifi movie from the 50s or 60s with men in solid red uniforms who interrogate a spy from the past

Falsification in Math vs Science

If climate change impact can be observed in nature, has that had any effect on rural, i.e. farming community, perception of the scientific consensus?

How can I define good in a religion that claims no moral authority?

Keeping a retro style to sci-fi spaceships?

Can you cast a spell on someone in the Ethereal Plane, if you are on the Material Plane and have the True Seeing spell active?

Is an up-to-date browser secure on an out-of-date OS?

Cooking pasta in a water boiler

Is it ok to offer lower paid work as a trial period before negotiating for a full-time job?

Why can't devices on different VLANs, but on the same subnet, communicate?

Why doesn't UInt have a toDouble()?

What was the last CPU that did not have the x87 floating-point unit built in?

Are spiders unable to hurt humans, especially very small spiders?

Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?

Dropping list elements from nested list after evaluation

For what reasons would an animal species NOT cross a *horizontal* land bridge?

What is preventing me from simply constructing a hash that's lower than the current target?

Why is this code so slow?

Pokemon Turn Based battle (Python)

How to quickly solve partial fractions equation?

How to support a colleague who finds meetings extremely tiring?

Why don't hard Brexiteers insist on a hard border to prevent illegal immigration after Brexit?

Why didn't the Event Horizon Telescope team mention Sagittarius A*?



Discrete-time Fourier transform of $x[n] = 1$



The 2019 Stack Overflow Developer Survey Results Are InExistence of Fourier transformThe Continuity of the Discrete Time Fourier Transform of Absolutely Summable SeriesDiscrete time fourier transform of partial sumIs the definition of DTFT using $omega$ wrong?Using Fourier transform to compute Fourier series.Fourier transform accumulation propertyRelationship between short-time and large-frequency asymptotics in Fourier transformDTFT of the unit step functionOn the discrete-time Fourier transform of unit step sequence.Approximating inverse Fourier transform with inverse discrete Fourier transform










1












$begingroup$


How to calculate the DTFT of $1$? The sequence $x[n] = 1$ is not absolutely summable, so one can not compute the DTFT by using the definition



$$X(Omega) space = sum limits_n=-infty^inftyx[n]e^-jOmega n$$



Can anyone point me to a derivation of DTFT of $1$ from the first principles?



The derivations I came across used the fact that DTFT of $e^jOmega_0n$ is



$$2pisum limits_k=-infty^infty delta(Omega-Omega_0-2kpi)$$



which again brings me to the question: how?










share|cite|improve this question











$endgroup$











  • $begingroup$
    Rodrigo de Azevedo, thanks for the edit! Yes, I'm aware that it should be an impulse train and computing the IDFT will prove it. My quest however is to compute the DTFT and get the result as the impulse train. I want to deduce it mathematically without guessing its DTFT and then taking IDFT to prove it.
    $endgroup$
    – Navin
    Mar 24 at 10:57






  • 1




    $begingroup$
    The DTFT of the complex exponential is not the result of a computation (as the DTFT series does not converge, of course). It is just a convenient definition, which we take for granted. It is intuitively justified because it gives the expected result when applying the IDTFT formula. Other than that, there is nothing more to say.
    $endgroup$
    – Stelios
    Mar 24 at 12:21















1












$begingroup$


How to calculate the DTFT of $1$? The sequence $x[n] = 1$ is not absolutely summable, so one can not compute the DTFT by using the definition



$$X(Omega) space = sum limits_n=-infty^inftyx[n]e^-jOmega n$$



Can anyone point me to a derivation of DTFT of $1$ from the first principles?



The derivations I came across used the fact that DTFT of $e^jOmega_0n$ is



$$2pisum limits_k=-infty^infty delta(Omega-Omega_0-2kpi)$$



which again brings me to the question: how?










share|cite|improve this question











$endgroup$











  • $begingroup$
    Rodrigo de Azevedo, thanks for the edit! Yes, I'm aware that it should be an impulse train and computing the IDFT will prove it. My quest however is to compute the DTFT and get the result as the impulse train. I want to deduce it mathematically without guessing its DTFT and then taking IDFT to prove it.
    $endgroup$
    – Navin
    Mar 24 at 10:57






  • 1




    $begingroup$
    The DTFT of the complex exponential is not the result of a computation (as the DTFT series does not converge, of course). It is just a convenient definition, which we take for granted. It is intuitively justified because it gives the expected result when applying the IDTFT formula. Other than that, there is nothing more to say.
    $endgroup$
    – Stelios
    Mar 24 at 12:21













1












1








1





$begingroup$


How to calculate the DTFT of $1$? The sequence $x[n] = 1$ is not absolutely summable, so one can not compute the DTFT by using the definition



$$X(Omega) space = sum limits_n=-infty^inftyx[n]e^-jOmega n$$



Can anyone point me to a derivation of DTFT of $1$ from the first principles?



The derivations I came across used the fact that DTFT of $e^jOmega_0n$ is



$$2pisum limits_k=-infty^infty delta(Omega-Omega_0-2kpi)$$



which again brings me to the question: how?










share|cite|improve this question











$endgroup$




How to calculate the DTFT of $1$? The sequence $x[n] = 1$ is not absolutely summable, so one can not compute the DTFT by using the definition



$$X(Omega) space = sum limits_n=-infty^inftyx[n]e^-jOmega n$$



Can anyone point me to a derivation of DTFT of $1$ from the first principles?



The derivations I came across used the fact that DTFT of $e^jOmega_0n$ is



$$2pisum limits_k=-infty^infty delta(Omega-Omega_0-2kpi)$$



which again brings me to the question: how?







fourier-analysis fourier-transform signal-processing






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 24 at 23:30







Navin

















asked Mar 24 at 7:47









NavinNavin

266




266











  • $begingroup$
    Rodrigo de Azevedo, thanks for the edit! Yes, I'm aware that it should be an impulse train and computing the IDFT will prove it. My quest however is to compute the DTFT and get the result as the impulse train. I want to deduce it mathematically without guessing its DTFT and then taking IDFT to prove it.
    $endgroup$
    – Navin
    Mar 24 at 10:57






  • 1




    $begingroup$
    The DTFT of the complex exponential is not the result of a computation (as the DTFT series does not converge, of course). It is just a convenient definition, which we take for granted. It is intuitively justified because it gives the expected result when applying the IDTFT formula. Other than that, there is nothing more to say.
    $endgroup$
    – Stelios
    Mar 24 at 12:21
















  • $begingroup$
    Rodrigo de Azevedo, thanks for the edit! Yes, I'm aware that it should be an impulse train and computing the IDFT will prove it. My quest however is to compute the DTFT and get the result as the impulse train. I want to deduce it mathematically without guessing its DTFT and then taking IDFT to prove it.
    $endgroup$
    – Navin
    Mar 24 at 10:57






  • 1




    $begingroup$
    The DTFT of the complex exponential is not the result of a computation (as the DTFT series does not converge, of course). It is just a convenient definition, which we take for granted. It is intuitively justified because it gives the expected result when applying the IDTFT formula. Other than that, there is nothing more to say.
    $endgroup$
    – Stelios
    Mar 24 at 12:21















$begingroup$
Rodrigo de Azevedo, thanks for the edit! Yes, I'm aware that it should be an impulse train and computing the IDFT will prove it. My quest however is to compute the DTFT and get the result as the impulse train. I want to deduce it mathematically without guessing its DTFT and then taking IDFT to prove it.
$endgroup$
– Navin
Mar 24 at 10:57




$begingroup$
Rodrigo de Azevedo, thanks for the edit! Yes, I'm aware that it should be an impulse train and computing the IDFT will prove it. My quest however is to compute the DTFT and get the result as the impulse train. I want to deduce it mathematically without guessing its DTFT and then taking IDFT to prove it.
$endgroup$
– Navin
Mar 24 at 10:57




1




1




$begingroup$
The DTFT of the complex exponential is not the result of a computation (as the DTFT series does not converge, of course). It is just a convenient definition, which we take for granted. It is intuitively justified because it gives the expected result when applying the IDTFT formula. Other than that, there is nothing more to say.
$endgroup$
– Stelios
Mar 24 at 12:21




$begingroup$
The DTFT of the complex exponential is not the result of a computation (as the DTFT series does not converge, of course). It is just a convenient definition, which we take for granted. It is intuitively justified because it gives the expected result when applying the IDTFT formula. Other than that, there is nothing more to say.
$endgroup$
– Stelios
Mar 24 at 12:21










0






active

oldest

votes












Your Answer





StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

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
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3160252%2fdiscrete-time-fourier-transform-of-xn-1%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes















draft saved

draft discarded
















































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.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3160252%2fdiscrete-time-fourier-transform-of-xn-1%23new-answer', 'question_page');

);

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







Popular posts from this blog

How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye