Is Fourier series a sampled version of Fourier transform?Using fourier coefficients to reconstruct data in matlabThe Fourier Series Of This Triangle WaveWhy we need fourier transform of periodic signal although we have fourier series for periodic signal?Difference between discrete time fourier transform and discrete fourier transformAbout Discrete Fourier Transform vs. Discrete Fourier SeriesCan I study continuous time Fourier Transform and treat the rest as special casesFourier Series ProofFourier Transform/Series DFT/DFS textbook problem (simple?)Link between DFS, DFT, DTFT

Adding things to bunches of things vs multiplication

What allows us to use imaginary numbers?

What if a restaurant suddenly cannot accept credit cards, and the customer has no cash?

Visa on arrival to exit airport in Russia

What is the fastest way to level past 95 in Diablo II?

Ghost house where the house only appeared once a year for it was the ghost

How do I pass a "list of lists" as the argument to a function of the form F[x,y]?

Why is the battery jumpered to a resistor in this schematic?

Has the speed of light ever been measured in vacuum?

Why does Japan use the same type of AC power outlet as the US?

When does The Truman Show take place?

What are the advantages of this gold finger shape?

What is the opposite of "hunger level"?

A+ rating still unsecure by Google Chrome's opinion

Why do we use low resistance cables to minimize power losses?

Airline power sockets shut down when I plug my computer in. How can I avoid that?

Why does "auf der Strecke bleiben" mean "to fall by the wayside"?

How to prevent criminal gangs from making/buying guns?

What's a good pattern to calculate a variable only when it is used the first time?

Set theory with antielements?

Why does auto deduce this variable as double and not float?

What's the point of writing that I know will never be used or read?

Is a USB 3.0 device possible with a four contact USB 2.0 connector?

Are there any cons in using rounded corners for bar graphs?



Is Fourier series a sampled version of Fourier transform?


Using fourier coefficients to reconstruct data in matlabThe Fourier Series Of This Triangle WaveWhy we need fourier transform of periodic signal although we have fourier series for periodic signal?Difference between discrete time fourier transform and discrete fourier transformAbout Discrete Fourier Transform vs. Discrete Fourier SeriesCan I study continuous time Fourier Transform and treat the rest as special casesFourier Series ProofFourier Transform/Series DFT/DFS textbook problem (simple?)Link between DFS, DFT, DTFT






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








2












$begingroup$


I recently learned about dtft and how dft/dfs is the sampled version of dtft. I was wondering if Fourier series is also obtainable by sampling Fourier transform? I am a noob in the subject so sorry if this is stupid










share|improve this question









New contributor



Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$













  • $begingroup$
    For more details maybe you could make use of math.SE.
    $endgroup$
    – mathreadler
    1 hour ago

















2












$begingroup$


I recently learned about dtft and how dft/dfs is the sampled version of dtft. I was wondering if Fourier series is also obtainable by sampling Fourier transform? I am a noob in the subject so sorry if this is stupid










share|improve this question









New contributor



Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$













  • $begingroup$
    For more details maybe you could make use of math.SE.
    $endgroup$
    – mathreadler
    1 hour ago













2












2








2





$begingroup$


I recently learned about dtft and how dft/dfs is the sampled version of dtft. I was wondering if Fourier series is also obtainable by sampling Fourier transform? I am a noob in the subject so sorry if this is stupid










share|improve this question









New contributor



Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$




I recently learned about dtft and how dft/dfs is the sampled version of dtft. I was wondering if Fourier series is also obtainable by sampling Fourier transform? I am a noob in the subject so sorry if this is stupid







fourier-transform sampling continuous-signals fourier-series






share|improve this question









New contributor



Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.










share|improve this question









New contributor



Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








share|improve this question




share|improve this question








edited 4 hours ago









Matt L.

53.2k2 gold badges39 silver badges99 bronze badges




53.2k2 gold badges39 silver badges99 bronze badges






New contributor



Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








asked 10 hours ago









Kartik HegdeKartik Hegde

111 bronze badge




111 bronze badge




New contributor



Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




New contributor




Kartik Hegde is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • $begingroup$
    For more details maybe you could make use of math.SE.
    $endgroup$
    – mathreadler
    1 hour ago
















  • $begingroup$
    For more details maybe you could make use of math.SE.
    $endgroup$
    – mathreadler
    1 hour ago















$begingroup$
For more details maybe you could make use of math.SE.
$endgroup$
– mathreadler
1 hour ago




$begingroup$
For more details maybe you could make use of math.SE.
$endgroup$
– mathreadler
1 hour ago










4 Answers
4






active

oldest

votes


















3












$begingroup$

There are 4 versions of Fourier transforms that are all close cousins.



It's all due to the basic property that "sampling in one domain corresponds to periodicity in the other domain". If a time signal is periodic, the frequency domain signal is discrete. If a frequency domain signal is periodic, the time domain signal is discrete.



So you have four variants



> `Time Frequency Transform 
Continuos & aperidoc Continuos & aperidoc Fourier Transform
Discrete & aperidoc Continuos & peridoc Discrete Time Fourier Transform
Continuos & peridoc Discrete & aperidoc Fourier Series
Discrete & peridoc Discrete & peridoc Discrete Fourier Transform


The flavors are different since a continuous signal requires integration and a discrete signal needs summation.



The naming conventions are non-intuitive: it would be easier if the DFT would have been called Discrete Fourier Series and the DTFT called DFT, but it is the way it is.



Which flavor you need to use depends on the nature of your signals and depending on what assumptions around the signals you can make, you can use one flavor to calculate a different one.






share|improve this answer









$endgroup$






















    2












    $begingroup$

    Not stupid.



    For a real valued (band limited) periodic signal, the coefficients for the Fourier series can be found directly from the Discrete Fourier Series (DFT/FFT) done on one period of the cycle.



    See my answer here for details:



    Using fourier coefficients to reconstruct data in matlab



    As for naming, DFT is the term used for both the transform being done and the results of that transform, which can lead to confusion. Macleod uses the term Discrete Fourier Spectrum (DFS) for the results of a DFT. I agree that that would be a better convention, but it is not very well known.






    share|improve this answer









    $endgroup$














    • $begingroup$
      definitely not stupid.
      $endgroup$
      – robert bristow-johnson
      3 hours ago


















    2












    $begingroup$

    Not exactly,



    With continuous periodic functions, one is free to select any fundamental frequency. The Fourier series doesn’t suffer spectral leakage.



    In a discretely samples sequence, exact periods are a rational multiple of the sample period. A continuous time periodic function isn’t necessarily periodic when sampled.






    share|improve this answer









    $endgroup$






















      2












      $begingroup$

      Yes, for time-limited functions it is possible to obtain the Fourier series coefficients by sampling the Fourier transform. This is the dual case of the more common form of the sampling theorem, stating that a band-limited function is fully characterized by its (time-domain) samples.



      The same is true in the discrete domain. Note that only for finite length signals is the DFT a sampled version of the DTFT.



      Let $g(t)$ be a function that is zero outside the interval $[0,T]$. Its Fourier transform is



      $$beginalignG(jomega)&=int_-infty^inftyg(t)e^-jomega tdt\&=int_0^Tg(t)e^-jomega tdttag1endalign$$



      In the interval $tin[0,T]$, the function $g(t)$ can be described by its Fourier coefficients:



      $$c_k=frac1Tint_0^Tg(t)e^-jfrac2pi kTtdttag2$$



      Comparing $(1)$ and $(2)$ shows that the Fourier coefficients $c_k$ are (scaled) samples of the Fourier transform $G(jomega)$:



      $$c_k=frac1TGleft(jfrac2pi kTright)tag3$$



      In general, for functions that are not necessarily time-limited, the samples of the Fourier transform given by $(3)$ are the Fourier series coefficients of an aliased version of the original function. This is shown by Poisson's sum formula:



      $$sum_n=-infty^inftyg(t-nT)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTttag4$$



      Of course, if $g(t)$ is zero outside the interval $[0,T]$ we have



      $$g(t)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTt,qquad tin[0,T]tag5$$






      share|improve this answer











      $endgroup$














      • $begingroup$
        well, because we oft use "$f$" for frequency in the Fourier Transform, i sorta wish you would use "$x(t)$" and "$X(jOmega)$" (to keep consistent with the Laplace transform, if you insist on using angular frequency). if it was "ordinary frequency", i would use "$x(t)$" and "$X(f)$". if it was anyone else i might just modify the answer.
        $endgroup$
        – robert bristow-johnson
        3 hours ago







      • 1




        $begingroup$
        @robertbristow-johnson: If it was anyone else I wouldn't have edited :)
        $endgroup$
        – Matt L.
        3 hours ago













      Your Answer








      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "295"
      ;
      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: false,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: null,
      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
      );



      );






      Kartik Hegde is a new contributor. Be nice, and check out our Code of Conduct.









      draft saved

      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdsp.stackexchange.com%2fquestions%2f60144%2fis-fourier-series-a-sampled-version-of-fourier-transform%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      4 Answers
      4






      active

      oldest

      votes








      4 Answers
      4






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      3












      $begingroup$

      There are 4 versions of Fourier transforms that are all close cousins.



      It's all due to the basic property that "sampling in one domain corresponds to periodicity in the other domain". If a time signal is periodic, the frequency domain signal is discrete. If a frequency domain signal is periodic, the time domain signal is discrete.



      So you have four variants



      > `Time Frequency Transform 
      Continuos & aperidoc Continuos & aperidoc Fourier Transform
      Discrete & aperidoc Continuos & peridoc Discrete Time Fourier Transform
      Continuos & peridoc Discrete & aperidoc Fourier Series
      Discrete & peridoc Discrete & peridoc Discrete Fourier Transform


      The flavors are different since a continuous signal requires integration and a discrete signal needs summation.



      The naming conventions are non-intuitive: it would be easier if the DFT would have been called Discrete Fourier Series and the DTFT called DFT, but it is the way it is.



      Which flavor you need to use depends on the nature of your signals and depending on what assumptions around the signals you can make, you can use one flavor to calculate a different one.






      share|improve this answer









      $endgroup$



















        3












        $begingroup$

        There are 4 versions of Fourier transforms that are all close cousins.



        It's all due to the basic property that "sampling in one domain corresponds to periodicity in the other domain". If a time signal is periodic, the frequency domain signal is discrete. If a frequency domain signal is periodic, the time domain signal is discrete.



        So you have four variants



        > `Time Frequency Transform 
        Continuos & aperidoc Continuos & aperidoc Fourier Transform
        Discrete & aperidoc Continuos & peridoc Discrete Time Fourier Transform
        Continuos & peridoc Discrete & aperidoc Fourier Series
        Discrete & peridoc Discrete & peridoc Discrete Fourier Transform


        The flavors are different since a continuous signal requires integration and a discrete signal needs summation.



        The naming conventions are non-intuitive: it would be easier if the DFT would have been called Discrete Fourier Series and the DTFT called DFT, but it is the way it is.



        Which flavor you need to use depends on the nature of your signals and depending on what assumptions around the signals you can make, you can use one flavor to calculate a different one.






        share|improve this answer









        $endgroup$

















          3












          3








          3





          $begingroup$

          There are 4 versions of Fourier transforms that are all close cousins.



          It's all due to the basic property that "sampling in one domain corresponds to periodicity in the other domain". If a time signal is periodic, the frequency domain signal is discrete. If a frequency domain signal is periodic, the time domain signal is discrete.



          So you have four variants



          > `Time Frequency Transform 
          Continuos & aperidoc Continuos & aperidoc Fourier Transform
          Discrete & aperidoc Continuos & peridoc Discrete Time Fourier Transform
          Continuos & peridoc Discrete & aperidoc Fourier Series
          Discrete & peridoc Discrete & peridoc Discrete Fourier Transform


          The flavors are different since a continuous signal requires integration and a discrete signal needs summation.



          The naming conventions are non-intuitive: it would be easier if the DFT would have been called Discrete Fourier Series and the DTFT called DFT, but it is the way it is.



          Which flavor you need to use depends on the nature of your signals and depending on what assumptions around the signals you can make, you can use one flavor to calculate a different one.






          share|improve this answer









          $endgroup$



          There are 4 versions of Fourier transforms that are all close cousins.



          It's all due to the basic property that "sampling in one domain corresponds to periodicity in the other domain". If a time signal is periodic, the frequency domain signal is discrete. If a frequency domain signal is periodic, the time domain signal is discrete.



          So you have four variants



          > `Time Frequency Transform 
          Continuos & aperidoc Continuos & aperidoc Fourier Transform
          Discrete & aperidoc Continuos & peridoc Discrete Time Fourier Transform
          Continuos & peridoc Discrete & aperidoc Fourier Series
          Discrete & peridoc Discrete & peridoc Discrete Fourier Transform


          The flavors are different since a continuous signal requires integration and a discrete signal needs summation.



          The naming conventions are non-intuitive: it would be easier if the DFT would have been called Discrete Fourier Series and the DTFT called DFT, but it is the way it is.



          Which flavor you need to use depends on the nature of your signals and depending on what assumptions around the signals you can make, you can use one flavor to calculate a different one.







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 10 hours ago









          HilmarHilmar

          11.7k1 gold badge12 silver badges18 bronze badges




          11.7k1 gold badge12 silver badges18 bronze badges


























              2












              $begingroup$

              Not stupid.



              For a real valued (band limited) periodic signal, the coefficients for the Fourier series can be found directly from the Discrete Fourier Series (DFT/FFT) done on one period of the cycle.



              See my answer here for details:



              Using fourier coefficients to reconstruct data in matlab



              As for naming, DFT is the term used for both the transform being done and the results of that transform, which can lead to confusion. Macleod uses the term Discrete Fourier Spectrum (DFS) for the results of a DFT. I agree that that would be a better convention, but it is not very well known.






              share|improve this answer









              $endgroup$














              • $begingroup$
                definitely not stupid.
                $endgroup$
                – robert bristow-johnson
                3 hours ago















              2












              $begingroup$

              Not stupid.



              For a real valued (band limited) periodic signal, the coefficients for the Fourier series can be found directly from the Discrete Fourier Series (DFT/FFT) done on one period of the cycle.



              See my answer here for details:



              Using fourier coefficients to reconstruct data in matlab



              As for naming, DFT is the term used for both the transform being done and the results of that transform, which can lead to confusion. Macleod uses the term Discrete Fourier Spectrum (DFS) for the results of a DFT. I agree that that would be a better convention, but it is not very well known.






              share|improve this answer









              $endgroup$














              • $begingroup$
                definitely not stupid.
                $endgroup$
                – robert bristow-johnson
                3 hours ago













              2












              2








              2





              $begingroup$

              Not stupid.



              For a real valued (band limited) periodic signal, the coefficients for the Fourier series can be found directly from the Discrete Fourier Series (DFT/FFT) done on one period of the cycle.



              See my answer here for details:



              Using fourier coefficients to reconstruct data in matlab



              As for naming, DFT is the term used for both the transform being done and the results of that transform, which can lead to confusion. Macleod uses the term Discrete Fourier Spectrum (DFS) for the results of a DFT. I agree that that would be a better convention, but it is not very well known.






              share|improve this answer









              $endgroup$



              Not stupid.



              For a real valued (band limited) periodic signal, the coefficients for the Fourier series can be found directly from the Discrete Fourier Series (DFT/FFT) done on one period of the cycle.



              See my answer here for details:



              Using fourier coefficients to reconstruct data in matlab



              As for naming, DFT is the term used for both the transform being done and the results of that transform, which can lead to confusion. Macleod uses the term Discrete Fourier Spectrum (DFS) for the results of a DFT. I agree that that would be a better convention, but it is not very well known.







              share|improve this answer












              share|improve this answer



              share|improve this answer










              answered 10 hours ago









              Cedron DawgCedron Dawg

              3,8752 gold badges3 silver badges12 bronze badges




              3,8752 gold badges3 silver badges12 bronze badges














              • $begingroup$
                definitely not stupid.
                $endgroup$
                – robert bristow-johnson
                3 hours ago
















              • $begingroup$
                definitely not stupid.
                $endgroup$
                – robert bristow-johnson
                3 hours ago















              $begingroup$
              definitely not stupid.
              $endgroup$
              – robert bristow-johnson
              3 hours ago




              $begingroup$
              definitely not stupid.
              $endgroup$
              – robert bristow-johnson
              3 hours ago











              2












              $begingroup$

              Not exactly,



              With continuous periodic functions, one is free to select any fundamental frequency. The Fourier series doesn’t suffer spectral leakage.



              In a discretely samples sequence, exact periods are a rational multiple of the sample period. A continuous time periodic function isn’t necessarily periodic when sampled.






              share|improve this answer









              $endgroup$



















                2












                $begingroup$

                Not exactly,



                With continuous periodic functions, one is free to select any fundamental frequency. The Fourier series doesn’t suffer spectral leakage.



                In a discretely samples sequence, exact periods are a rational multiple of the sample period. A continuous time periodic function isn’t necessarily periodic when sampled.






                share|improve this answer









                $endgroup$

















                  2












                  2








                  2





                  $begingroup$

                  Not exactly,



                  With continuous periodic functions, one is free to select any fundamental frequency. The Fourier series doesn’t suffer spectral leakage.



                  In a discretely samples sequence, exact periods are a rational multiple of the sample period. A continuous time periodic function isn’t necessarily periodic when sampled.






                  share|improve this answer









                  $endgroup$



                  Not exactly,



                  With continuous periodic functions, one is free to select any fundamental frequency. The Fourier series doesn’t suffer spectral leakage.



                  In a discretely samples sequence, exact periods are a rational multiple of the sample period. A continuous time periodic function isn’t necessarily periodic when sampled.







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 8 hours ago









                  Stanley PawlukiewiczStanley Pawlukiewicz

                  7,1622 gold badges6 silver badges23 bronze badges




                  7,1622 gold badges6 silver badges23 bronze badges
























                      2












                      $begingroup$

                      Yes, for time-limited functions it is possible to obtain the Fourier series coefficients by sampling the Fourier transform. This is the dual case of the more common form of the sampling theorem, stating that a band-limited function is fully characterized by its (time-domain) samples.



                      The same is true in the discrete domain. Note that only for finite length signals is the DFT a sampled version of the DTFT.



                      Let $g(t)$ be a function that is zero outside the interval $[0,T]$. Its Fourier transform is



                      $$beginalignG(jomega)&=int_-infty^inftyg(t)e^-jomega tdt\&=int_0^Tg(t)e^-jomega tdttag1endalign$$



                      In the interval $tin[0,T]$, the function $g(t)$ can be described by its Fourier coefficients:



                      $$c_k=frac1Tint_0^Tg(t)e^-jfrac2pi kTtdttag2$$



                      Comparing $(1)$ and $(2)$ shows that the Fourier coefficients $c_k$ are (scaled) samples of the Fourier transform $G(jomega)$:



                      $$c_k=frac1TGleft(jfrac2pi kTright)tag3$$



                      In general, for functions that are not necessarily time-limited, the samples of the Fourier transform given by $(3)$ are the Fourier series coefficients of an aliased version of the original function. This is shown by Poisson's sum formula:



                      $$sum_n=-infty^inftyg(t-nT)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTttag4$$



                      Of course, if $g(t)$ is zero outside the interval $[0,T]$ we have



                      $$g(t)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTt,qquad tin[0,T]tag5$$






                      share|improve this answer











                      $endgroup$














                      • $begingroup$
                        well, because we oft use "$f$" for frequency in the Fourier Transform, i sorta wish you would use "$x(t)$" and "$X(jOmega)$" (to keep consistent with the Laplace transform, if you insist on using angular frequency). if it was "ordinary frequency", i would use "$x(t)$" and "$X(f)$". if it was anyone else i might just modify the answer.
                        $endgroup$
                        – robert bristow-johnson
                        3 hours ago







                      • 1




                        $begingroup$
                        @robertbristow-johnson: If it was anyone else I wouldn't have edited :)
                        $endgroup$
                        – Matt L.
                        3 hours ago















                      2












                      $begingroup$

                      Yes, for time-limited functions it is possible to obtain the Fourier series coefficients by sampling the Fourier transform. This is the dual case of the more common form of the sampling theorem, stating that a band-limited function is fully characterized by its (time-domain) samples.



                      The same is true in the discrete domain. Note that only for finite length signals is the DFT a sampled version of the DTFT.



                      Let $g(t)$ be a function that is zero outside the interval $[0,T]$. Its Fourier transform is



                      $$beginalignG(jomega)&=int_-infty^inftyg(t)e^-jomega tdt\&=int_0^Tg(t)e^-jomega tdttag1endalign$$



                      In the interval $tin[0,T]$, the function $g(t)$ can be described by its Fourier coefficients:



                      $$c_k=frac1Tint_0^Tg(t)e^-jfrac2pi kTtdttag2$$



                      Comparing $(1)$ and $(2)$ shows that the Fourier coefficients $c_k$ are (scaled) samples of the Fourier transform $G(jomega)$:



                      $$c_k=frac1TGleft(jfrac2pi kTright)tag3$$



                      In general, for functions that are not necessarily time-limited, the samples of the Fourier transform given by $(3)$ are the Fourier series coefficients of an aliased version of the original function. This is shown by Poisson's sum formula:



                      $$sum_n=-infty^inftyg(t-nT)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTttag4$$



                      Of course, if $g(t)$ is zero outside the interval $[0,T]$ we have



                      $$g(t)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTt,qquad tin[0,T]tag5$$






                      share|improve this answer











                      $endgroup$














                      • $begingroup$
                        well, because we oft use "$f$" for frequency in the Fourier Transform, i sorta wish you would use "$x(t)$" and "$X(jOmega)$" (to keep consistent with the Laplace transform, if you insist on using angular frequency). if it was "ordinary frequency", i would use "$x(t)$" and "$X(f)$". if it was anyone else i might just modify the answer.
                        $endgroup$
                        – robert bristow-johnson
                        3 hours ago







                      • 1




                        $begingroup$
                        @robertbristow-johnson: If it was anyone else I wouldn't have edited :)
                        $endgroup$
                        – Matt L.
                        3 hours ago













                      2












                      2








                      2





                      $begingroup$

                      Yes, for time-limited functions it is possible to obtain the Fourier series coefficients by sampling the Fourier transform. This is the dual case of the more common form of the sampling theorem, stating that a band-limited function is fully characterized by its (time-domain) samples.



                      The same is true in the discrete domain. Note that only for finite length signals is the DFT a sampled version of the DTFT.



                      Let $g(t)$ be a function that is zero outside the interval $[0,T]$. Its Fourier transform is



                      $$beginalignG(jomega)&=int_-infty^inftyg(t)e^-jomega tdt\&=int_0^Tg(t)e^-jomega tdttag1endalign$$



                      In the interval $tin[0,T]$, the function $g(t)$ can be described by its Fourier coefficients:



                      $$c_k=frac1Tint_0^Tg(t)e^-jfrac2pi kTtdttag2$$



                      Comparing $(1)$ and $(2)$ shows that the Fourier coefficients $c_k$ are (scaled) samples of the Fourier transform $G(jomega)$:



                      $$c_k=frac1TGleft(jfrac2pi kTright)tag3$$



                      In general, for functions that are not necessarily time-limited, the samples of the Fourier transform given by $(3)$ are the Fourier series coefficients of an aliased version of the original function. This is shown by Poisson's sum formula:



                      $$sum_n=-infty^inftyg(t-nT)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTttag4$$



                      Of course, if $g(t)$ is zero outside the interval $[0,T]$ we have



                      $$g(t)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTt,qquad tin[0,T]tag5$$






                      share|improve this answer











                      $endgroup$



                      Yes, for time-limited functions it is possible to obtain the Fourier series coefficients by sampling the Fourier transform. This is the dual case of the more common form of the sampling theorem, stating that a band-limited function is fully characterized by its (time-domain) samples.



                      The same is true in the discrete domain. Note that only for finite length signals is the DFT a sampled version of the DTFT.



                      Let $g(t)$ be a function that is zero outside the interval $[0,T]$. Its Fourier transform is



                      $$beginalignG(jomega)&=int_-infty^inftyg(t)e^-jomega tdt\&=int_0^Tg(t)e^-jomega tdttag1endalign$$



                      In the interval $tin[0,T]$, the function $g(t)$ can be described by its Fourier coefficients:



                      $$c_k=frac1Tint_0^Tg(t)e^-jfrac2pi kTtdttag2$$



                      Comparing $(1)$ and $(2)$ shows that the Fourier coefficients $c_k$ are (scaled) samples of the Fourier transform $G(jomega)$:



                      $$c_k=frac1TGleft(jfrac2pi kTright)tag3$$



                      In general, for functions that are not necessarily time-limited, the samples of the Fourier transform given by $(3)$ are the Fourier series coefficients of an aliased version of the original function. This is shown by Poisson's sum formula:



                      $$sum_n=-infty^inftyg(t-nT)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTttag4$$



                      Of course, if $g(t)$ is zero outside the interval $[0,T]$ we have



                      $$g(t)=frac1Tsum_k=-infty^inftyGleft(jfrac2pi kTright)e^jfrac2pi kTt,qquad tin[0,T]tag5$$







                      share|improve this answer














                      share|improve this answer



                      share|improve this answer








                      edited 3 hours ago

























                      answered 6 hours ago









                      Matt L.Matt L.

                      53.2k2 gold badges39 silver badges99 bronze badges




                      53.2k2 gold badges39 silver badges99 bronze badges














                      • $begingroup$
                        well, because we oft use "$f$" for frequency in the Fourier Transform, i sorta wish you would use "$x(t)$" and "$X(jOmega)$" (to keep consistent with the Laplace transform, if you insist on using angular frequency). if it was "ordinary frequency", i would use "$x(t)$" and "$X(f)$". if it was anyone else i might just modify the answer.
                        $endgroup$
                        – robert bristow-johnson
                        3 hours ago







                      • 1




                        $begingroup$
                        @robertbristow-johnson: If it was anyone else I wouldn't have edited :)
                        $endgroup$
                        – Matt L.
                        3 hours ago
















                      • $begingroup$
                        well, because we oft use "$f$" for frequency in the Fourier Transform, i sorta wish you would use "$x(t)$" and "$X(jOmega)$" (to keep consistent with the Laplace transform, if you insist on using angular frequency). if it was "ordinary frequency", i would use "$x(t)$" and "$X(f)$". if it was anyone else i might just modify the answer.
                        $endgroup$
                        – robert bristow-johnson
                        3 hours ago







                      • 1




                        $begingroup$
                        @robertbristow-johnson: If it was anyone else I wouldn't have edited :)
                        $endgroup$
                        – Matt L.
                        3 hours ago















                      $begingroup$
                      well, because we oft use "$f$" for frequency in the Fourier Transform, i sorta wish you would use "$x(t)$" and "$X(jOmega)$" (to keep consistent with the Laplace transform, if you insist on using angular frequency). if it was "ordinary frequency", i would use "$x(t)$" and "$X(f)$". if it was anyone else i might just modify the answer.
                      $endgroup$
                      – robert bristow-johnson
                      3 hours ago





                      $begingroup$
                      well, because we oft use "$f$" for frequency in the Fourier Transform, i sorta wish you would use "$x(t)$" and "$X(jOmega)$" (to keep consistent with the Laplace transform, if you insist on using angular frequency). if it was "ordinary frequency", i would use "$x(t)$" and "$X(f)$". if it was anyone else i might just modify the answer.
                      $endgroup$
                      – robert bristow-johnson
                      3 hours ago





                      1




                      1




                      $begingroup$
                      @robertbristow-johnson: If it was anyone else I wouldn't have edited :)
                      $endgroup$
                      – Matt L.
                      3 hours ago




                      $begingroup$
                      @robertbristow-johnson: If it was anyone else I wouldn't have edited :)
                      $endgroup$
                      – Matt L.
                      3 hours ago










                      Kartik Hegde is a new contributor. Be nice, and check out our Code of Conduct.









                      draft saved

                      draft discarded


















                      Kartik Hegde is a new contributor. Be nice, and check out our Code of Conduct.












                      Kartik Hegde is a new contributor. Be nice, and check out our Code of Conduct.











                      Kartik Hegde is a new contributor. Be nice, and check out our Code of Conduct.














                      Thanks for contributing an answer to Signal Processing 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%2fdsp.stackexchange.com%2fquestions%2f60144%2fis-fourier-series-a-sampled-version-of-fourier-transform%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

                      Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

                      Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

                      Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її