Академический Документы
Профессиональный Документы
Культура Документы
Now if that same signal is ideally & uniformly sampled into a digital sequence such that the time domain into the integer, index with the corresponding sample such that | [ ] [ ].
However that resulting sequence may or may not be a DT periodic signal, which is based on the number of samples per signal period & the commensurability between the sampling period, if these conditions are both met there exists a DT Fourier which could be sampled discretely, & theoretically reconstructed back into its original CT periodic signal. Below shows the why the criteria of commensurability must be met Assuming & are commensurable, & ( ( ) ) | | ( ) [ ] [ ]
, then ( )
[ ]
[ ]
[ [ ]
[ ] ]
From Continuous-Time Fourier Series to Discrete-Time Fourier Series to Discrete-Time Fourier Transform
The discrete time signal in the first graph in the above figure part is aperiodic since [ ] we can a periodic extension of [ ] but shifted to the right & left by with spacing so that we may apply
in a limiting case to extend the class of signals that can be transformed. Thus the periodic [ ] [ ] [ ] to recover the
extension is shown in the second graph in the above figure represented as [ ] & in the limiting case can be shown that
Applying the
of the periodic extension signal to get the complex coefficients of the inverse
original signal in the TD. Then applying the limiting condition to find the aperiodic signal [ ] above gain insight to a more general form of transform
[ ]
. [ ]
[ ]
[ ]
] [ ] (
[ [ ]
)]
As
( )
[ ]
[ ]
* [
[ ] [ ]
)+ [ ] [ ] [ ]
]]
Thus the signal we have shown can confidently & without ignorance recover the original signal, also we now have an insight on what the transform should look like after applying the limits to both the DTFS & its inverse. The notation used is for independent variable for the analysis equation below, but later , will be instead, this will become relevant
From Continuous-Time Fourier Series to Discrete-Time Fourier Series to Discrete-Time Fourier Transform
( ( ))
[ ] * [ ] (
( )
)+
[ ] ]
[ ]