Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Discrete-time Fourier transform
open-in-new
<h2 id="relation-to-fourier-transform">Relation to Fourier Transform</h2> <p>Let s ( t ) {\displaystyle s(t)} be a continuous function in the time domain. We begin with a common definition of the continuous <a href="/facts/Fourier_transform/XXhKJtc8">Fourier transform</a>, where f {\displaystyle f} represents frequency in hertz and t {\displaystyle t} represents time in seconds: </p> S ( f ) ≜ ∫ − ∞ ∞ s ( t ) ⋅ e − i 2 π f t d t . {\displaystyle S(f)\triangleq \int _{-\infty }^{\infty }s(t)\cdot e^{-i2\pi ft}dt.} <p>We can reduce the integral into a summation by sampling s ( t ) {\displaystyle s(t)} at intervals of T {\displaystyle T} seconds (see <a href="/facts/Fourier_transform/XXhKJtc8">Fourier transform § Numerical integration of a series of ordered pairs</a>). Specifically, we can replace s ( t ) {\displaystyle s(t)} with a discrete sequence of its samples, s ( n T ) {\displaystyle s(nT)} , for integer values of n {\displaystyle n} , and replace the differential element d t {\displaystyle dt} with the sampling period T {\displaystyle T} . Thus, we obtain one formulation for the discrete-time Fourier transform (DTFT): </p> S 1 / T ( f ) ≜ ∑ n = − ∞ ∞ T ⋅ s ( n T ) ⏟ s [ n ] e − i 2 π f T n . {\displaystyle S_{1/T}(f)\triangleq \sum _{n=-\infty }^{\infty }\underbrace {T\cdot s(nT)} _{s[n]}\ e^{-i2\pi fTn}.} <p>This <a href="/facts/Fourier_series/s3fsxPAT">Fourier series</a> (in frequency) is a continuous periodic function, whose periodicity is the sampling frequency 1 / T {\displaystyle 1/T} . The subscript 1 / T {\displaystyle 1/T} distinguishes it from the continuous Fourier transform S ( f ) {\displaystyle S(f)} , and from the angular frequency form of the DTFT. The latter is obtained by defining an angular frequency variable, ω ≜ 2 π f T {\displaystyle \omega \triangleq 2\pi fT} (which has <a href="/facts/Normalized_frequency_(digital_signal_processing)/hsY0aY3E">normalized units</a> of <i>radians/sample</i>), giving us a periodic function of angular frequency, with periodicity 2 π {\displaystyle 2\pi } :<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> </p> <table><tbody><tr><td> S 2 π ( ω ) = S 1 / T ( ω 2 π T ) = ∑ n = − ∞ ∞ s [ n ] ⋅ e − i ω n . {\displaystyle S_{2\pi }(\omega )=S_{1/T}\left({\tfrac {\omega }{2\pi T}}\right)=\sum _{n=-\infty }^{\infty }s[n]\cdot e^{-i\omega n}.} </td> <td></td> <td>Eq.1</td></tr></tbody></table> <p> The utility of the DTFT is rooted in the <a href="/facts/Poisson_summation_formula/CDM4uRPs">Poisson summation formula</a>, which tells us that the periodic function represented by the Fourier series is a periodic summation of the continuous Fourier transform:<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a></p>Poisson summation <table><tbody><tr><td> S 1 / T ( f ) = ∑ n = − ∞ ∞ s [ n ] ⋅ e − i 2 π f T n = ∑ k = − ∞ ∞ S ( f − k / T ) . {\displaystyle S_{1/T}(f)=\sum _{n=-\infty }^{\infty }s[n]\cdot e^{-i2\pi fTn}\;=\sum _{k=-\infty }^{\infty }S\left(f-k/T\right).} </td> <td></td> <td>Eq.2</td></tr></tbody></table> <p>The components of the periodic summation are centered at integer values (denoted by k {\displaystyle k} ) of a <a href="/facts/Normalized_frequency_(signal_processing)/hsY0aY3E">normalized frequency</a> (cycles per sample). Ordinary/physical frequency (cycles per second) is the product of k {\displaystyle k} and the sample-rate, f s = 1 / T . {\displaystyle f_{s}=1/T.} For sufficiently large f s , {\displaystyle f_{s},} the k = 0 {\displaystyle k=0} term can be observed in the region [ − f s / 2 , f s / 2 ] {\displaystyle [-f_{s}/2,f_{s}/2]} with little or no distortion (<a href="/facts/Aliasing/Pzg84HL0">aliasing</a>) from the other terms. Fig.1 depicts an example where 1 / T {\displaystyle 1/T} is not large enough to prevent aliasing. </p><p>We also note that e − i 2 π f T n {\displaystyle e^{-i2\pi fTn}} is the Fourier transform of δ ( t − n T ) . {\displaystyle \delta (t-nT).} Therefore, an alternative definition of DTFT is:[A] </p> <table><tbody><tr><td> S 1 / T ( f ) = F { ∑ n = − ∞ ∞ s [ n ] ⋅ δ ( t − n T ) } . {\displaystyle S_{1/T}(f)={\mathcal {F}}\left\{\sum _{n=-\infty }^{\infty }s[n]\cdot \delta (t-nT)\right\}.} </td> <td></td> <td>Eq.3</td></tr></tbody></table> <p>The modulated <a href="/facts/Dirac_comb/0tx3xslS">Dirac comb</a> function is a mathematical abstraction sometimes referred to as <i>impulse sampling</i>.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> </p> <h2 id="inverse-transform">Inverse transform</h2> <p>An operation that recovers the discrete data sequence from the DTFT function is called an <i>inverse DTFT</i>. For instance, the inverse continuous Fourier transform of both sides of Eq.3 produces the sequence in the form of a modulated Dirac comb function: </p> ∑ n = − ∞ ∞ s [ n ] ⋅ δ ( t − n T ) = F − 1 { S 1 / T ( f ) } ≜ ∫ − ∞ ∞ S 1 / T ( f ) ⋅ e i 2 π f t d f . {\displaystyle \sum _{n=-\infty }^{\infty }s[n]\cdot \delta (t-nT)={\mathcal {F}}^{-1}\left\{S_{1/T}(f)\right\}\ \triangleq \int _{-\infty }^{\infty }S_{1/T}(f)\cdot e^{i2\pi ft}df.} <p>However, noting that S 1 / T ( f ) {\displaystyle S_{1/T}(f)} is periodic, all the necessary information is contained within any interval of length 1 / T . {\displaystyle 1/T.} In both Eq.1 and Eq.2, the summations over n {\displaystyle n} are a <a href="/facts/Fourier_series/s3fsxPAT">Fourier series</a>, with coefficients s [ n ] . {\displaystyle s[n].} The standard formulas for the Fourier coefficients are also the inverse transforms: </p> <table><tbody><tr><td> s [ n ] = T ∫ 1 T S 1 / T ( f ) ⋅ e i 2 π f n T d f (integral over any interval of length 1 / T ) = 1 2 π ∫ 2 π S 2 π ( ω ) ⋅ e i ω n d ω (integral over any interval of length 2 π ) {\displaystyle {\begin{aligned}s[n]&=T\int _{\frac {1}{T}}S_{1/T}(f)\cdot e^{i2\pi fnT}df\quad \scriptstyle {{\text{(integral over any interval of length }}1/T{\textrm {)}}}\\\displaystyle &={\frac {1}{2\pi }}\int _{2\pi }S_{2\pi }(\omega )\cdot e^{i\omega n}d\omega \quad \scriptstyle {{\text{(integral over any interval of length }}2\pi {\textrm {)}}}\end{aligned}}} </td> <td></td> <td>Eq.4</td></tr></tbody></table> <h2 id="periodic-data">Periodic data</h2> <p>When the input data sequence s [ n ] {\displaystyle s[n]} is N {\displaystyle N} -periodic, Eq.2 can be computationally reduced to a discrete Fourier transform (DFT), because: </p> <ul><li>All the available information is contained within N {\displaystyle N} samples.</li> <li> S 1 / T ( f ) {\displaystyle S_{1/T}(f)} converges to zero everywhere except at integer multiples of 1 / ( N T ) , {\displaystyle 1/(NT),} known as <a href="/facts/Harmonic/9U9REzeR">harmonic</a> frequencies. At those frequencies, the DTFT diverges at different frequency-dependent rates. And those rates are given by the DFT of one cycle of the s [ n ] {\displaystyle s[n]} sequence.</li> <li>The DTFT is periodic, so the maximum number of unique harmonic amplitudes is ( 1 / T ) / ( 1 / ( N T ) ) = N . {\displaystyle (1/T)/(1/(NT))=N.} </li></ul> <p>The DFT of one cycle of the s [ n ] {\displaystyle s[n]} sequence is: </p> S [ k ] ≜ ∑ N s [ n ] ⋅ e − i 2 π k N n ⏟ any n-sequence of length N , k ∈ Z . {\displaystyle S[k]\triangleq \underbrace {\sum _{N}s[n]\cdot e^{-i2\pi {\frac {k}{N}}n}} _{\text{any n-sequence of length N}},\quad k\in \mathbf {Z} .} <p>And s [ n ] {\displaystyle s[n]} can be expressed in terms of the inverse transform, which is sometimes referred to as a <a href="/facts/Discrete_Fourier_series/HRsLlDx3">Discrete Fourier series</a> (DFS):<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a>: p 542 </p> s [ n ] = 1 N ∑ N S [ k ] ⋅ e i 2 π k N n ⏟ any k-sequence of length N , n ∈ Z . {\displaystyle s[n]={\frac {1}{N}}\underbrace {\sum _{N}S[k]\cdot e^{i2\pi {\frac {k}{N}}n}} _{\text{any k-sequence of length N}},\quad n\in \mathbf {Z} .} <p>With these definitions, we can demonstrate the relationship between the DTFT and the DFT: </p> S 1 / T ( f ) ≜ ∑ n = − ∞ ∞ s [ n ] ⋅ e − i 2 π f n T = ∑ n = − ∞ ∞ [ 1 N ∑ k = 0 N − 1 S [ k ] ⋅ e i 2 π k N n ] ⋅ e − i 2 π f n T = 1 N ∑ k = 0 N − 1 S [ k ] [ ∑ n = − ∞ ∞ e i 2 π k N n ⋅ e − i 2 π f n T ] ⏟ DTFT ( e i 2 π k N n ) = 1 N ∑ k = 0 N − 1 S [ k ] ⋅ 1 T ∑ M = − ∞ ∞ δ ( f − k N T − M T ) {\displaystyle {\begin{aligned}S_{1/T}(f)&\triangleq \sum _{n=-\infty }^{\infty }s[n]\cdot e^{-i2\pi fnT}\\&=\sum _{n=-\infty }^{\infty }\left[{\frac {1}{N}}\sum _{k=0}^{N-1}S[k]\cdot e^{i2\pi {\frac {k}{N}}n}\right]\cdot e^{-i2\pi fnT}\\&={\frac {1}{N}}\sum _{k=0}^{N-1}S[k]\underbrace {\left[\sum _{n=-\infty }^{\infty }e^{i2\pi {\frac {k}{N}}n}\cdot e^{-i2\pi fnT}\right]} _{\operatorname {DTFT} \left(e^{i2\pi {\frac {k}{N}}n}\right)}\\&={\frac {1}{N}}\sum _{k=0}^{N-1}S[k]\cdot {\frac {1}{T}}\sum _{M=-\infty }^{\infty }\delta \left(f-{\tfrac {k}{NT}}-{\tfrac {M}{T}}\right)\end{aligned}}} <a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a><a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> <p>Due to the N {\displaystyle N} -periodicity of both functions of k , {\displaystyle k,} this can be simplified to: </p> S 1 / T ( f ) = 1 N T ∑ k = − ∞ ∞ S [ k ] ⋅ δ ( f − k N T ) , {\displaystyle S_{1/T}(f)={\frac {1}{NT}}\sum _{k=-\infty }^{\infty }S[k]\cdot \delta \left(f-{\frac {k}{NT}}\right),} <p>which satisfies the inverse transform requirement: </p> s [ n ] = T ∫ 0 1 T S 1 / T ( f ) ⋅ e i 2 π f n T d f = 1 N ∑ k = − ∞ ∞ S [ k ] ∫ 0 1 T δ ( f − k N T ) e i 2 π f n T d f ⏟ zero for k ∉ [ 0 , N − 1 ] = 1 N ∑ k = 0 N − 1 S [ k ] ∫ 0 1 T δ ( f − k N T ) e i 2 π f n T d f = 1 N ∑ k = 0 N − 1 S [ k ] ⋅ e i 2 π k N T n T = 1 N ∑ k = 0 N − 1 S [ k ] ⋅ e i 2 π k N n {\displaystyle {\begin{aligned}s[n]&=T\int _{0}^{\frac {1}{T}}S_{1/T}(f)\cdot e^{i2\pi fnT}df\\&={\frac {1}{N}}\sum _{k=-\infty }^{\infty }S[k]\underbrace {\int _{0}^{\frac {1}{T}}\delta \left(f-{\tfrac {k}{NT}}\right)e^{i2\pi fnT}df} _{{\text{zero for }}k\ \notin \ [0,N-1]}\\&={\frac {1}{N}}\sum _{k=0}^{N-1}S[k]\int _{0}^{\frac {1}{T}}\delta \left(f-{\tfrac {k}{NT}}\right)e^{i2\pi fnT}df\\&={\frac {1}{N}}\sum _{k=0}^{N-1}S[k]\cdot e^{i2\pi {\tfrac {k}{NT}}nT}\\&={\frac {1}{N}}\sum _{k=0}^{N-1}S[k]\cdot e^{i2\pi {\tfrac {k}{N}}n}\end{aligned}}} <h2 id="sampling-the-dtft">Sampling the DTFT</h2> <p>When the DTFT is continuous, a common practice is to compute an arbitrary number of samples ( N ) {\displaystyle (N)} of one cycle of the periodic function S 1 / T {\displaystyle S_{1/T}} : <a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a>: pp 557–559 & 703 <a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a>: p 76 </p> S 1 / T ( k N T ) ⏟ S k = ∑ n = − ∞ ∞ s [ n ] ⋅ e − i 2 π k N n k = 0 , … , N − 1 = ∑ N s N [ n ] ⋅ e − i 2 π k N n , ⏟ DFT (sum over any n -sequence of length N ) {\displaystyle {\begin{aligned}\underbrace {S_{1/T}\left({\frac {k}{NT}}\right)} _{S_{k}}&=\sum _{n=-\infty }^{\infty }s[n]\cdot e^{-i2\pi {\frac {k}{N}}n}\quad \quad k=0,\dots ,N-1\\&=\underbrace {\sum _{N}s_{_{N}}[n]\cdot e^{-i2\pi {\frac {k}{N}}n},} _{\text{DFT}}\quad \scriptstyle {{\text{(sum over any }}n{\text{-sequence of length }}N)}\end{aligned}}} <p>where s N {\displaystyle s_{_{N}}} is a <a href="/facts/Periodic_summation/x3jMCU4y">periodic summation</a>: </p> s N [ n ] ≜ ∑ m = − ∞ ∞ s [ n − m N ] . {\displaystyle s_{_{N}}[n]\ \triangleq \ \sum _{m=-\infty }^{\infty }s[n-mN].} (see <a href="/facts/Discrete_Fourier_series/HRsLlDx3">Discrete Fourier series</a>) <p>The s N {\displaystyle s_{_{N}}} sequence is the inverse DFT. Thus, our sampling of the DTFT causes the inverse transform to become periodic. The array of | S k | 2 {\displaystyle |S_{k}|^{2}} values is known as a <i><a href="/facts/Periodogram/JMjH2MU0">periodogram</a></i>, and the parameter N {\displaystyle N} is called NFFT in the Matlab function of the same name.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> </p><p>In order to evaluate one cycle of s N {\displaystyle s_{_{N}}} numerically, we require a finite-length s [ n ] {\displaystyle s[n]} sequence. For instance, a long sequence might be truncated by a <a href="/facts/Window_function/5Xj7h2ah">window function</a> of length L {\displaystyle L} resulting in three cases worthy of special mention. For notational simplicity, consider the s [ n ] {\displaystyle s[n]} values below to represent the values modified by the window function. </p><p>Case: Frequency decimation. L = N ⋅ I , {\displaystyle L=N\cdot I,} for some integer I {\displaystyle I} (typically 6 or 8) </p><p>A cycle of s N {\displaystyle s_{_{N}}} reduces to a summation of I {\displaystyle I} segments of length N . {\displaystyle N.} The DFT then goes by various names, such as: </p> <ul><li><i>window-presum FFT</i><a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a></li> <li><i>Weight, overlap, add (WOLA)</i><a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a><a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a><a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a><a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a><a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a><a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a><a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a><a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a></li></ul> <ul><li><i>polyphase DFT</i><a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a><a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></li> <li><i>polyphase filter bank</i><a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a></li> <li><i>multiple block windowing</i> and <i>time-aliasing</i>.<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a></li></ul> <p>Recall that decimation of sampled data in one domain (time or frequency) produces overlap (sometimes known as <a href="/facts/Aliasing/Pzg84HL0">aliasing</a>) in the other, and vice versa. Compared to an L {\displaystyle L} -length DFT, the s N {\displaystyle s_{_{N}}} summation/overlap causes decimation in frequency,<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a>: p.558 leaving only DTFT samples least affected by <a href="/facts/Spectral_leakage/yFqfjdDr">spectral leakage</a>. That is usually a priority when implementing an FFT <a href="/facts/Filter_bank/HXvTRgFN">filter-bank</a> (channelizer). With a conventional window function of length L , {\displaystyle L,} <a href="/facts/Spectral_leakage/yFqfjdDr">scalloping loss</a> would be unacceptable. So multi-block windows are created using <a href="/facts/FIR_filter/5u4Gaqcb">FIR filter</a> design tools.<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a><a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> Their frequency profile is flat at the highest point and falls off quickly at the midpoint between the remaining DTFT samples. The larger the value of parameter I , {\displaystyle I,} the better the potential performance. </p><p>Case: L = N + 1 {\displaystyle L=N+1} </p><p>When a symmetric, L {\displaystyle L} -length <a href="/facts/Window_function/5Xj7h2ah">window function</a> ( s {\displaystyle s} ) is truncated by 1 coefficient it is called <a href="/facts/Spectral_leakage/yFqfjdDr"><i>periodic</i> or <i>DFT-even</i></a>. That is a common practice, but the truncation affects the DTFT (spectral leakage) by a small amount. It is at least of academic interest to characterize that effect. An N {\displaystyle N} -length DFT of the truncated window produces frequency samples at intervals of 1 / N , {\displaystyle 1/N,} instead of 1 / L . {\displaystyle 1/L.} The samples are real-valued,<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a>: p.52 but their values do not exactly match the DTFT of the symmetric window. The periodic summation, s N , {\displaystyle s_{_{N}},} along with an N {\displaystyle N} -length DFT, can also be used to sample the DTFT at intervals of 1 / N . {\displaystyle 1/N.} Those samples are also real-valued and do exactly match the DTFT (example: File:Sampling the Discrete-time Fourier transform.svg). To use the full symmetric window for spectral analysis at the 1 / N {\displaystyle 1/N} spacing, one would combine the n = 0 {\displaystyle n=0} and n = N {\displaystyle n=N} data samples (by addition, because the symmetrical window weights them equally) and then apply the truncated symmetric window and the N {\displaystyle N} -length DFT. </p> <p>Case: Frequency interpolation. L ≤ N {\displaystyle L\leq N} </p><p>In this case, the DFT simplifies to a more familiar form: </p> S k = ∑ n = 0 N − 1 s [ n ] ⋅ e − i 2 π k N n . {\displaystyle S_{k}=\sum _{n=0}^{N-1}s[n]\cdot e^{-i2\pi {\frac {k}{N}}n}.} <p>In order to take advantage of a fast Fourier transform algorithm for computing the DFT, the summation is usually performed over all N {\displaystyle N} terms, even though N − L {\displaystyle N-L} of them are zeros. Therefore, the case L < N {\displaystyle L<N} is often referred to as zero-padding. </p><p>Spectral leakage, which increases as L {\displaystyle L} decreases, is detrimental to certain important performance metrics, such as resolution of multiple frequency components and the amount of noise measured by each DTFT sample. But those things don't always matter, for instance when the s [ n ] {\displaystyle s[n]} sequence is a noiseless sinusoid (or a constant), shaped by a window function. Then it is a common practice to use <i>zero-padding</i> to graphically display and compare the detailed leakage patterns of window functions. To illustrate that for a rectangular window, consider the sequence: </p> s [ n ] = e i 2 π 1 8 n , {\displaystyle s[n]=e^{i2\pi {\frac {1}{8}}n},\quad } and L = 64. {\displaystyle L=64.} <p>Figures 2 and 3 are plots of the magnitude of two different sized DFTs, as indicated in their labels. In both cases, the dominant component is at the signal frequency: f = 1 / 8 = 0.125 {\displaystyle f=1/8=0.125} . Also visible in Fig 2 is the spectral leakage pattern of the L = 64 {\displaystyle L=64} rectangular window. The illusion in Fig 3 is a result of sampling the DTFT at just its zero-crossings. Rather than the DTFT of a finite-length sequence, it gives the impression of an infinitely long sinusoidal sequence. Contributing factors to the illusion are the use of a rectangular window, and the choice of a frequency (1/8 = 8/64) with exactly 8 (an integer) cycles per 64 samples. A <a href="/facts/Window_function/5Xj7h2ah">Hann window</a> would produce a similar result, except the peak would be widened to 3 samples (see <a href="https://commons.wikimedia.org/wiki/File:DFT-even_Hann_window_&_spectral_leakage.png">DFT-even Hann window</a>). </p> <h2 id="convolution">Convolution</h2> <p class="note">Main article: <a href="/facts/Convolution_theorem/E7zhjIx2">Convolution theorem § Functions of a discrete variable (sequences)</a></p> <p>The <a href="/facts/Convolution_theorem/E7zhjIx2">convolution theorem</a> for sequences is: </p> s ∗ y = D T F T − 1 [ D T F T { s } ⋅ D T F T { y } ] . {\displaystyle s*y\ =\ \scriptstyle {\rm {DTFT}}^{-1}\displaystyle \left[\scriptstyle {\rm {DTFT}}\displaystyle \{s\}\cdot \scriptstyle {\rm {DTFT}}\displaystyle \{y\}\right].} <a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a>: p.297 <a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a> <p>An important special case is the <a href="/facts/Circular_convolution/krbXy3LH">circular convolution</a> of sequences s and y defined by s N ∗ y , {\displaystyle s_{_{N}}*y,} where s N {\displaystyle s_{_{N}}} is a periodic summation. The discrete-frequency nature of D T F T { s N } {\displaystyle \scriptstyle {\rm {DTFT}}\displaystyle \{s_{_{N}}\}} means that the product with the continuous function D T F T { y } {\displaystyle \scriptstyle {\rm {DTFT}}\displaystyle \{y\}} is also discrete, which results in considerable simplification of the inverse transform: </p> s N ∗ y = D T F T − 1 [ D T F T { s N } ⋅ D T F T { y } ] = D F T − 1 [ D F T { s N } ⋅ D F T { y N } ] . {\displaystyle s_{_{N}}*y\ =\ \scriptstyle {\rm {DTFT}}^{-1}\displaystyle \left[\scriptstyle {\rm {DTFT}}\displaystyle \{s_{_{N}}\}\cdot \scriptstyle {\rm {DTFT}}\displaystyle \{y\}\right]\ =\ \scriptstyle {\rm {DFT}}^{-1}\displaystyle \left[\scriptstyle {\rm {DFT}}\displaystyle \{s_{_{N}}\}\cdot \scriptstyle {\rm {DFT}}\displaystyle \{y_{_{N}}\}\right].} <a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a><a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a>: p.548 <p>For s and y sequences whose non-zero duration is less than or equal to N, a final simplification is: </p> s N ∗ y = D F T − 1 [ D F T { s } ⋅ D F T { y } ] . {\displaystyle s_{_{N}}*y\ =\ \scriptstyle {\rm {DFT}}^{-1}\displaystyle \left[\scriptstyle {\rm {DFT}}\displaystyle \{s\}\cdot \scriptstyle {\rm {DFT}}\displaystyle \{y\}\right].} <p>The significance of this result is explained at <a href="/facts/Circular_convolution/krbXy3LH">Circular convolution</a> and <a href="/facts/Convolution/PVPrdz9J">Fast convolution algorithms</a>. </p> <h2 id="relationship-to-the-z-transform">Relationship to the Z-transform</h2> <p> S 2 π ( ω ) {\displaystyle S_{2\pi }(\omega )} is a <a href="/facts/Fourier_series/s3fsxPAT">Fourier series</a> that can also be expressed in terms of the bilateral <a href="/facts/Z-transform/ERNvDJqt">Z-transform</a>. I.e.: </p> S 2 π ( ω ) = S z ( z ) | z = e i ω = S z ( e i ω ) , {\displaystyle S_{2\pi }(\omega )=\left.S_{z}(z)\,\right|_{z=e^{i\omega }}=S_{z}(e^{i\omega }),} <p>where the S z {\displaystyle S_{z}} notation distinguishes the Z-transform from the Fourier transform. Therefore, we can also express a portion of the Z-transform in terms of the Fourier transform: </p> S z ( e i ω ) = S 1 / T ( ω 2 π T ) = ∑ k = − ∞ ∞ S ( ω 2 π T − k / T ) = ∑ k = − ∞ ∞ S ( ω − 2 π k 2 π T ) . {\displaystyle {\begin{aligned}S_{z}(e^{i\omega })&=\ S_{1/T}\left({\tfrac {\omega }{2\pi T}}\right)\ =\ \sum _{k=-\infty }^{\infty }S\left({\tfrac {\omega }{2\pi T}}-k/T\right)\\&=\sum _{k=-\infty }^{\infty }S\left({\tfrac {\omega -2\pi k}{2\pi T}}\right).\end{aligned}}} <p>Note that when parameter T changes, the terms of S 2 π ( ω ) {\displaystyle S_{2\pi }(\omega )} remain a constant separation 2 π {\displaystyle 2\pi } apart, and their width scales up or down. The terms of <i>S</i>1/<i>T</i>(<i>f</i>) remain a constant width and their separation 1/<i>T</i> scales up or down. </p> <h2 id="table-of-discrete-time-fourier-transforms">Table of discrete-time Fourier transforms</h2> <p>Some common transform pairs are shown in the table below. The following notation applies: </p> <ul><li> ω = 2 π f T {\displaystyle \omega =2\pi fT} is a real number representing continuous angular frequency (in radians per sample). ( f {\displaystyle f} is in cycles/sec, and T {\displaystyle T} is in sec/sample.) In all cases in the table, the DTFT is 2π-periodic (in ω {\displaystyle \omega } ).</li> <li> S 2 π ( ω ) {\displaystyle S_{2\pi }(\omega )} designates a function defined on − ∞ < ω < ∞ {\displaystyle -\infty <\omega <\infty } .</li> <li> S o ( ω ) {\displaystyle S_{o}(\omega )} designates a function defined on − π < ω ≤ π {\displaystyle -\pi <\omega \leq \pi } , and zero elsewhere. Then: S 2 π ( ω ) ≜ ∑ k = − ∞ ∞ S o ( ω − 2 π k ) . {\displaystyle S_{2\pi }(\omega )\ \triangleq \sum _{k=-\infty }^{\infty }S_{o}(\omega -2\pi k).} </li> <li> δ ( ω ) {\displaystyle \delta (\omega )} is the <a href="/facts/Dirac_delta_function/V8PjRP8T">Dirac delta function</a></li> <li> sinc ( t ) {\displaystyle \operatorname {sinc} (t)} is the normalized <a href="/facts/Sinc_function/lSvDtHy0">sinc function</a></li> <li> rect [ n L ] ≜ { 1 | n | ≤ L / 2 0 | n | > L / 2 {\displaystyle \operatorname {rect} \left[{n \over L}\right]\triangleq {\begin{cases}1&|n|\leq L/2\\0&|n|>L/2\end{cases}}} </li> <li> tri ( t ) {\displaystyle \operatorname {tri} (t)} is the <a href="/facts/Triangle_function/XsMdvErB">triangle function</a></li> <li>n is an integer representing the discrete-time domain (in samples)</li> <li> u [ n ] {\displaystyle u[n]} is the discrete-time <a href="/facts/Heaviside_step_function/bgsUtxgP">unit step function</a></li> <li> δ [ n ] {\displaystyle \delta [n]} is the <a href="/facts/Kronecker_delta/gcGAy0bm">Kronecker delta</a> δ n , 0 {\displaystyle \delta _{n,0}} </li></ul> <table><tbody><tr><th>Time domain <i>s</i>[<i>n</i>]</th><th>Frequency domain <i>S</i>2<i>π</i>(<i>ω</i>)</th><th>Remarks</th><th>Reference</th></tr><tr><td> δ [ n ] {\displaystyle \delta [n]} </td><td> S 2 π ( ω ) = 1 {\displaystyle S_{2\pi }(\omega )=1} </td><td></td><td><a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a>: p.305 </td></tr><tr><td> δ [ n − M ] {\displaystyle \delta [n-M]} </td><td> S 2 π ( ω ) = e − i ω M {\displaystyle S_{2\pi }(\omega )=e^{-i\omega M}} </td><td>integer M {\displaystyle M} </td><td></td></tr><tr><td> ∑ m = − ∞ ∞ δ [ n − M m ] {\displaystyle \sum _{m=-\infty }^{\infty }\delta [n-Mm]\!} </td><td> S 2 π ( ω ) = ∑ m = − ∞ ∞ e − i ω M m = 2 π M ∑ k = − ∞ ∞ δ ( ω − 2 π k M ) {\displaystyle S_{2\pi }(\omega )=\sum _{m=-\infty }^{\infty }e^{-i\omega Mm}={\frac {2\pi }{M}}\sum _{k=-\infty }^{\infty }\delta \left(\omega -{\frac {2\pi k}{M}}\right)\,} <p> S o ( ω ) = 2 π M ∑ k = − ( M − 1 ) / 2 ( M − 1 ) / 2 δ ( ω − 2 π k M ) {\displaystyle S_{o}(\omega )={\frac {2\pi }{M}}\sum _{k=-(M-1)/2}^{(M-1)/2}\delta \left(\omega -{\frac {2\pi k}{M}}\right)\,} odd <i>M</i> S o ( ω ) = 2 π M ∑ k = − M / 2 + 1 M / 2 δ ( ω − 2 π k M ) {\displaystyle S_{o}(\omega )={\frac {2\pi }{M}}\sum _{k=-M/2+1}^{M/2}\delta \left(\omega -{\frac {2\pi k}{M}}\right)\,} even <i>M</i></p></td><td>integer M > 0 {\displaystyle M>0} </td><td></td></tr><tr><td> u [ n ] {\displaystyle u[n]} </td><td> S 2 π ( ω ) = 1 1 − e − i ω + π ∑ k = − ∞ ∞ δ ( ω − 2 π k ) {\displaystyle S_{2\pi }(\omega )={\frac {1}{1-e^{-i\omega }}}+\pi \sum _{k=-\infty }^{\infty }\delta (\omega -2\pi k)\!} <p> S o ( ω ) = 1 1 − e − i ω + π ⋅ δ ( ω ) {\displaystyle S_{o}(\omega )={\frac {1}{1-e^{-i\omega }}}+\pi \cdot \delta (\omega )\!} </p></td><td>The 1 / ( 1 − e − i ω ) {\displaystyle 1/(1-e^{-i\omega })} term must be interpreted as a <a href="/facts/Distribution_(mathematics)/yfaJ4mUp">distribution</a> in the sense of a <a href="/facts/Cauchy_principal_value/Gm33Qevf">Cauchy principal value</a> around its <a href="/facts/Pole_(complex_analysis)/gnA3U8VP">poles</a> at ω = 2 π k {\displaystyle \omega =2\pi k} .</td><td></td></tr><tr><td> a n u [ n ] {\displaystyle a^{n}u[n]} </td><td> S 2 π ( ω ) = 1 1 − a e − i ω {\displaystyle S_{2\pi }(\omega )={\frac {1}{1-ae^{-i\omega }}}\!} </td><td> 0 < | a | < 1 {\displaystyle 0<|a|<1} </td><td><a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a>: p.305 </td></tr><tr><td> e − i a n {\displaystyle e^{-ian}} </td><td> S o ( ω ) = 2 π ⋅ δ ( ω + a ) , {\displaystyle S_{o}(\omega )=2\pi \cdot \delta (\omega +a),} -π < a < π<p> S 2 π ( ω ) = 2 π ∑ k = − ∞ ∞ δ ( ω + a − 2 π k ) {\displaystyle S_{2\pi }(\omega )=2\pi \sum _{k=-\infty }^{\infty }\delta (\omega +a-2\pi k)} </p></td><td>real number a {\displaystyle a} </td><td></td></tr><tr><td> cos ( a ⋅ n ) {\displaystyle \cos(a\cdot n)} </td><td> S o ( ω ) = π [ δ ( ω − a ) + δ ( ω + a ) ] , {\displaystyle S_{o}(\omega )=\pi \left[\delta \left(\omega -a\right)+\delta \left(\omega +a\right)\right],} <p> S 2 π ( ω ) ≜ ∑ k = − ∞ ∞ S o ( ω − 2 π k ) {\displaystyle S_{2\pi }(\omega )\ \triangleq \sum _{k=-\infty }^{\infty }S_{o}(\omega -2\pi k)} </p></td><td>real number a {\displaystyle a} with − π < a < π {\displaystyle -\pi <a<\pi } </td><td></td></tr><tr><td> sin ( a ⋅ n ) {\displaystyle \sin(a\cdot n)} </td><td> S o ( ω ) = π i [ δ ( ω − a ) − δ ( ω + a ) ] {\displaystyle S_{o}(\omega )={\frac {\pi }{i}}\left[\delta \left(\omega -a\right)-\delta \left(\omega +a\right)\right]} </td><td>real number a {\displaystyle a} with − π < a < π {\displaystyle -\pi <a<\pi } </td><td></td></tr><tr><td> rect [ n − M N ] ≡ rect [ n − M N − 1 ] {\displaystyle \operatorname {rect} \left[{n-M \over N}\right]\equiv \operatorname {rect} \left[{n-M \over N-1}\right]} </td><td> S o ( ω ) = sin ( N ω / 2 ) sin ( ω / 2 ) e − i ω M {\displaystyle S_{o}(\omega )={\sin(N\omega /2) \over \sin(\omega /2)}\,e^{-i\omega M}\!} </td><td>integer M , {\displaystyle M,} and odd integer N {\displaystyle N} </td><td></td></tr><tr><td> sinc ( W ( n + a ) ) {\displaystyle \operatorname {sinc} (W(n+a))} </td><td> S o ( ω ) = 1 W rect ( ω 2 π W ) e i a ω {\displaystyle S_{o}(\omega )={\frac {1}{W}}\operatorname {rect} \left({\omega \over 2\pi W}\right)e^{ia\omega }} </td><td>real numbers W , a {\displaystyle W,a} with 0 < W < 1 {\displaystyle 0<W<1} </td><td></td></tr><tr><td> sinc 2 ( W n ) {\displaystyle \operatorname {sinc} ^{2}(Wn)\,} </td><td> S o ( ω ) = 1 W tri ( ω 2 π W ) {\displaystyle S_{o}(\omega )={\frac {1}{W}}\operatorname {tri} \left({\omega \over 2\pi W}\right)} </td><td>real number W {\displaystyle W} , 0 < W < 0.5 {\displaystyle 0<W<0.5} </td><td></td></tr><tr><td> { 0 n = 0 ( − 1 ) n n elsewhere {\displaystyle {\begin{cases}0&n=0\\{\frac {(-1)^{n}}{n}}&{\text{elsewhere}}\end{cases}}} </td><td> S o ( ω ) = j ω {\displaystyle S_{o}(\omega )=j\omega } </td><td>it works as a <a href="/facts/Differentiator/VBK9Bw5f">differentiator</a> filter</td></tr><tr><td> 1 ( n + a ) { cos [ π W ( n + a ) ] − sinc [ W ( n + a ) ] } {\displaystyle {\frac {1}{(n+a)}}\left\{\cos[\pi W(n+a)]-\operatorname {sinc} [W(n+a)]\right\}} </td><td> S o ( ω ) = j ω W ⋅ rect ( ω π W ) e j a ω {\displaystyle S_{o}(\omega )={\frac {j\omega }{W}}\cdot \operatorname {rect} \left({\omega \over \pi W}\right)e^{ja\omega }} </td><td>real numbers W , a {\displaystyle W,a} with 0 < W < 1 {\displaystyle 0<W<1} </td><td></td></tr><tr><td> { π 2 n = 0 ( − 1 ) n − 1 π n 2 otherwise {\displaystyle {\begin{cases}{\frac {\pi }{2}}&n=0\\{\frac {(-1)^{n}-1}{\pi n^{2}}}&{\text{ otherwise}}\end{cases}}} </td><td> S o ( ω ) = | ω | {\displaystyle S_{o}(\omega )=|\omega |} </td><td></td><td></td></tr><tr><td> { 0 ; n even 2 π n ; n odd {\displaystyle {\begin{cases}0;&n{\text{ even}}\\{\frac {2}{\pi n}};&n{\text{ odd}}\end{cases}}} </td><td> S o ( ω ) = { j ω < 0 0 ω = 0 − j ω > 0 {\displaystyle S_{o}(\omega )={\begin{cases}j&\omega <0\\0&\omega =0\\-j&\omega >0\end{cases}}} </td><td><a href="/facts/Hilbert_transform/RoQaC8MS">Hilbert transform</a></td><td></td></tr><tr><td> C ( A + B ) 2 π ⋅ sinc [ A − B 2 π n ] ⋅ sinc [ A + B 2 π n ] {\displaystyle {\frac {C(A+B)}{2\pi }}\cdot \operatorname {sinc} \left[{\frac {A-B}{2\pi }}n\right]\cdot \operatorname {sinc} \left[{\frac {A+B}{2\pi }}n\right]} </td><td> S o ( ω ) = {\displaystyle S_{o}(\omega )=} </td><td>real numbers A , B {\displaystyle A,B} complex C {\displaystyle C} </td><td></td></tr></tbody></table> <h2 id="properties">Properties</h2> <p>This table shows some mathematical operations in the time domain and the corresponding effects in the frequency domain. </p> <ul><li> ∗ {\displaystyle *\!} is the <a href="/facts/Convolution/PVPrdz9J">discrete convolution</a> of two sequences</li> <li> s ∗ [ n ] {\displaystyle s^{*}[n]} is the <a href="/facts/Complex_conjugate/7TEaoQDe">complex conjugate</a> of s [ n ] . {\displaystyle s[n].} </li></ul> <table><tbody><tr><th>Property</th><th>Time domain<i>s</i>[<i>n</i>]</th><th>Frequency domain S 2 π ( ω ) {\displaystyle S_{2\pi }(\omega )} </th><th>Remarks</th><th>Reference</th></tr><tr><td>Linearity</td><td> a ⋅ s [ n ] + b ⋅ y [ n ] {\displaystyle a\cdot s[n]+b\cdot y[n]} </td><td> a ⋅ S 2 π ( ω ) + b ⋅ Y 2 π ( ω ) {\displaystyle a\cdot S_{2\pi }(\omega )+b\cdot Y_{2\pi }(\omega )} </td><td>complex numbers a , b {\displaystyle a,b} </td><td><a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a>: p.294 </td></tr><tr><td>Time reversal / Frequency reversal</td><td> s [ − n ] {\displaystyle s[-n]} </td><td> S 2 π ( − ω ) {\displaystyle S_{2\pi }(-\omega )\!} </td><td></td><td><a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a>: p.297 </td></tr><tr><td>Time conjugation</td><td> s ∗ [ n ] {\displaystyle s^{*}[n]} </td><td> S 2 π ∗ ( − ω ) {\displaystyle S_{2\pi }^{*}(-\omega )\!} </td><td></td><td><a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a>: p.291 </td></tr><tr><td>Time reversal & conjugation</td><td> s ∗ [ − n ] {\displaystyle s^{*}[-n]} </td><td> S 2 π ∗ ( ω ) {\displaystyle S_{2\pi }^{*}(\omega )\!} </td><td></td><td><a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a>: p.291 </td></tr><tr><td>Real part in time</td><td> Re ( s [ n ] ) {\displaystyle \operatorname {Re} {(s[n])}} </td><td> 1 2 ( S 2 π ( ω ) + S 2 π ∗ ( − ω ) ) {\displaystyle {\frac {1}{2}}(S_{2\pi }(\omega )+S_{2\pi }^{*}(-\omega ))} </td><td></td><td><a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a>: p.291 </td></tr><tr><td>Imaginary part in time</td><td> Im ( s [ n ] ) {\displaystyle \operatorname {Im} {(s[n])}} </td><td> 1 2 i ( S 2 π ( ω ) − S 2 π ∗ ( − ω ) ) {\displaystyle {\frac {1}{2i}}(S_{2\pi }(\omega )-S_{2\pi }^{*}(-\omega ))} </td><td></td><td><a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a>: p.291 </td></tr><tr><td>Real part in frequency</td><td> 1 2 ( s [ n ] + s ∗ [ − n ] ) {\displaystyle {\frac {1}{2}}(s[n]+s^{*}[-n])} </td><td> Re ( S 2 π ( ω ) ) {\displaystyle \operatorname {Re} {(S_{2\pi }(\omega ))}} </td><td></td><td><a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a>: p.291 </td></tr><tr><td>Imaginary part in frequency</td><td> 1 2 i ( s [ n ] − s ∗ [ − n ] ) {\displaystyle {\frac {1}{2i}}(s[n]-s^{*}[-n])} </td><td> Im ( S 2 π ( ω ) ) {\displaystyle \operatorname {Im} {(S_{2\pi }(\omega ))}} </td><td></td><td><a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a>: p.291 </td></tr><tr><td>Shift in time / Modulation in frequency</td><td> s [ n − k ] {\displaystyle s[n-k]} </td><td> S 2 π ( ω ) ⋅ e − i ω k {\displaystyle S_{2\pi }(\omega )\cdot e^{-i\omega k}} </td><td>integer k</td><td><a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a>: p.296 </td></tr><tr><td>Shift in frequency / Modulation in time</td><td> s [ n ] ⋅ e i a n {\displaystyle s[n]\cdot e^{ian}\!} </td><td> S 2 π ( ω − a ) {\displaystyle S_{2\pi }(\omega -a)\!} </td><td>real number a {\displaystyle a} </td><td><a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a>: p.300 </td></tr><tr><td>Decimation</td><td> s [ n M ] {\displaystyle s[nM]} </td><td> 1 M ∑ m = 0 M − 1 S 2 π ( ω − 2 π m M ) {\displaystyle {\frac {1}{M}}\sum _{m=0}^{M-1}S_{2\pi }\left({\tfrac {\omega -2\pi m}{M}}\right)\!} <a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a></td><td>integer M {\displaystyle M} </td><td></td></tr><tr><td>Time Expansion</td><td> { s [ n / M ] n = multiple of M 0 otherwise {\displaystyle \scriptstyle {\begin{cases}s[n/M]&n={\text{multiple of M}}\\0&{\text{otherwise}}\end{cases}}} </td><td> S 2 π ( M ω ) {\displaystyle S_{2\pi }(M\omega )\!} </td><td>integer M {\displaystyle M} </td><td><a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a>: p.172 </td></tr><tr><td>Derivative in frequency</td><td> n i s [ n ] {\displaystyle {\frac {n}{i}}s[n]\!} </td><td> d S 2 π ( ω ) d ω {\displaystyle {\frac {dS_{2\pi }(\omega )}{d\omega }}\!} </td><td></td><td><a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a>: p.303 </td></tr><tr><td>Integration in frequency</td><td> {\displaystyle \!} </td><td> {\displaystyle \!} </td><td></td><td></td></tr><tr><td>Differencing in time</td><td> s [ n ] − s [ n − 1 ] {\displaystyle s[n]-s[n-1]\!} </td><td> ( 1 − e − i ω ) S 2 π ( ω ) {\displaystyle \left(1-e^{-i\omega }\right)S_{2\pi }(\omega )\!} </td><td></td><td></td></tr><tr><td>Summation in time</td><td> ∑ m = − ∞ n s [ m ] {\displaystyle \sum _{m=-\infty }^{n}s[m]\!} </td><td> 1 ( 1 − e − i ω ) S 2 π ( ω ) + π S ( 0 ) ∑ k = − ∞ ∞ δ ( ω − 2 π k ) {\displaystyle {\frac {1}{\left(1-e^{-i\omega }\right)}}S_{2\pi }(\omega )+\pi S(0)\sum _{k=-\infty }^{\infty }\delta (\omega -2\pi k)\!} </td><td></td><td></td></tr><tr><td>Convolution in time / Multiplication in frequency</td><td> s [ n ] ∗ y [ n ] {\displaystyle s[n]*y[n]\!} </td><td> S 2 π ( ω ) ⋅ Y 2 π ( ω ) {\displaystyle S_{2\pi }(\omega )\cdot Y_{2\pi }(\omega )\!} </td><td></td><td><a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a>: p.297 </td></tr><tr><td>Multiplication in time / Convolution in frequency</td><td> s [ n ] ⋅ y [ n ] {\displaystyle s[n]\cdot y[n]\!} </td><td> 1 2 π ∫ − π π S 2 π ( ν ) ⋅ Y 2 π ( ω − ν ) d ν {\displaystyle {\frac {1}{2\pi }}\int _{-\pi }^{\pi }S_{2\pi }(\nu )\cdot Y_{2\pi }(\omega -\nu )d\nu \!} </td><td><a href="/facts/Periodic_convolution/krbXy3LH">Periodic convolution</a></td><td><a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a>: p.302 </td></tr><tr><td><a href="/facts/Cross_correlation/Fs1hY3br">Cross correlation</a></td><td> ρ s y [ n ] = s ∗ [ − n ] ∗ y [ n ] {\displaystyle \rho _{sy}[n]=s^{*}[-n]*y[n]\!} </td><td> R s y ( ω ) = S 2 π ∗ ( ω ) ⋅ Y 2 π ( ω ) {\displaystyle R_{sy}(\omega )=S_{2\pi }^{*}(\omega )\cdot Y_{2\pi }(\omega )\!} </td><td></td><td></td></tr><tr><td><a href="/facts/Parseval%27s_theorem/413aRLTs">Parseval's theorem</a></td><td> E s y = ∑ n = − ∞ ∞ s [ n ] ⋅ y ∗ [ n ] {\displaystyle E_{sy}=\sum _{n=-\infty }^{\infty }{s[n]\cdot y^{*}[n]}\!} </td><td> E s y = 1 2 π ∫ − π π S 2 π ( ω ) ⋅ Y 2 π ∗ ( ω ) d ω {\displaystyle E_{sy}={\frac {1}{2\pi }}\int _{-\pi }^{\pi }{S_{2\pi }(\omega )\cdot Y_{2\pi }^{*}(\omega )d\omega }\!} </td><td></td><td><a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a>: p.302 </td></tr></tbody></table> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Least-squares_spectral_analysis/GYXrRKsB">Least-squares spectral analysis</a></li> <li><a href="/facts/Multidimensional_transform/288WFVqy">Multidimensional transform</a></li> <li><a href="/facts/Zak_transform/MRDfcKIB">Zak transform</a></li></ul> <h2 id="notes">Notes</h2> <h2 id="page-citations">Page citations</h2> <h2 id="further-reading">Further reading</h2> <ul><li>Porat, Boaz (1996). <i>A Course in Digital Signal Processing</i>. John Wiley and Sons. pp. 27–29 and 104–105. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-471-14961-6.</li> <li>Siebert, William M. (1986). <i>Circuits, Signals, and Systems</i>. MIT Electrical Engineering and Computer Science Series. Cambridge, MA: MIT Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0262690950.</li> <li>Lyons, Richard G. (2010). <i>Understanding Digital Signal Processing</i> (3rd ed.). Prentice Hall. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0137027415.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Oppenheim and Schafer,[1] p 147 (4.17), where: x [ n ] ≜ s ( n T ) = 1 T s [ n ] , {\displaystyle x[n]\triangleq s(nT)={\tfrac {1}{T}}s[n],} therefore X ( e i ω ) ≜ 1 T S 2 π ( ω ) . {\displaystyle X(e^{i\omega })\triangleq {\tfrac {1}{T}}S_{2\pi }(\omega ).} <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Oppenheim and Schafer,[1] p 147 (4.20), p 694 (10.1), and Prandoni and Vetterli,[2] p 255, (9.33), where: ω ≜ 2 π f T , {\displaystyle \omega \triangleq 2\pi fT,} and X c ( i 2 π f ) ≜ S ( f ) . {\displaystyle X_{c}(i2\pi f)\triangleq S(f).} <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Rao, R. (2008). Signals and Systems. Prentice-Hall Of India Pvt. Limited. ISBN 9788120338593. <a href="9788120338593" target="_blank">9788120338593</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). "4.2, 8.4". Discrete-time signal processing (2nd ed.). Upper Saddle River, N.J.: Prentice Hall. ISBN 0-13-754920-2. samples of the Fourier transform of an aperiodic sequence x[n] can be thought of as DFS coefficients of a periodic sequence obtained through summing periodic replicas of x[n]. <a href="0-13-754920-2" target="_blank">0-13-754920-2</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Oppenheim and Schafer,[1] p 551 (8.35), and Prandoni and Vetterli,[2] p 82, (4.43). With definitions: X ~ ( e i ω ) ≜ 1 T S 2 π ( ω ) , {\displaystyle {\tilde {X}}(e^{i\omega })\triangleq {\tfrac {1}{T}}S_{2\pi }(\omega ),} ω ≜ 2 π f T , {\displaystyle \omega \triangleq 2\pi fT,} X ~ [ k ] ≜ S [ k ] , {\displaystyle {\tilde {X}}[k]\triangleq S[k],} and δ ( 2 π f T − 2 π k N ) ≡ δ ( f − k N T ) / ( 2 π T ) , {\displaystyle \delta \left(2\pi fT-{\tfrac {2\pi k}{N}}\right)\equiv \delta \left(f-{\tfrac {k}{NT}}\right)/(2\pi T),} this expression differs from the references by a factor of 2 π {\displaystyle 2\pi } because they lost it in going from the 3rd step to the 4th. Specifically, the DTFT of e − i a n {\displaystyle e^{-ian}} at § Table of discrete-time Fourier transforms has a 2 π {\displaystyle 2\pi } factor that the references omitted. <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>From § Table of discrete-time Fourier transforms we have: DTFT ( e i 2 π k N n ) = 2 π ∑ M = − ∞ ∞ δ ( ω − 2 π k N − 2 π M ) = 2 π ∑ M = − ∞ ∞ δ ( 2 π f T − 2 π k N − 2 π M ) = 2 π ∑ M = − ∞ ∞ 1 2 π T δ ( 1 2 π T ( 2 π f T − 2 π k N − 2 π M ) ) = 1 T ∑ M = − ∞ ∞ δ ( f − k N T − M T ) {\displaystyle {\begin{aligned}\operatorname {DTFT} \left(e^{i2\pi {\frac {k}{N}}n}\right)&=2\pi \sum _{M=-\infty }^{\infty }\delta \left(\omega -2\pi {\frac {k}{N}}-2\pi M\right)\\&=2\pi \sum _{M=-\infty }^{\infty }\delta \left(2\pi fT-2\pi {\frac {k}{N}}-2\pi M\right)\\&=2\pi \sum _{M=-\infty }^{\infty }{\tfrac {1}{2\pi T}}\ \delta \left({\tfrac {1}{2\pi T}}\left(2\pi fT-2\pi {\frac {k}{N}}-2\pi M\right)\right)\\&={\frac {1}{T}}\sum _{M=-\infty }^{\infty }\delta \left(f-{\tfrac {k}{NT}}-{\tfrac {M}{T}}\right)\end{aligned}}} <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). "4.2, 8.4". Discrete-time signal processing (2nd ed.). Upper Saddle River, N.J.: Prentice Hall. ISBN 0-13-754920-2. samples of the Fourier transform of an aperiodic sequence x[n] can be thought of as DFS coefficients of a periodic sequence obtained through summing periodic replicas of x[n]. <a href="0-13-754920-2" target="_blank">0-13-754920-2</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Prandoni, Paolo; Vetterli, Martin (2008). Signal Processing for Communications (PDF) (1 ed.). Boca Raton, FL: CRC Press. pp. 72, 76. ISBN 978-1-4200-7046-0. Retrieved 4 October 2020. the DFS coefficients for the periodized signal are a discrete set of values for its DTFT <a href="978-1-4200-7046-0" target="_blank">978-1-4200-7046-0</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"Periodogram power spectral density estimate - MATLAB periodogram". <a href="https://www.mathworks.com/help/signal/ref/periodogram.html" target="_blank">https://www.mathworks.com/help/signal/ref/periodogram.html</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Gumas, Charles Constantine (July 1997). "Window-presum FFT achieves high-dynamic range, resolution". Personal Engineering & Instrumentation News: 58–64. Archived from the original on 2001-02-10.{{cite journal}}: CS1 maint: bot: original URL status unknown (link) <a href="https://web.archive.org/web/20010210052902/http://www.chipcenter.com/dsp/DSP000315F1.html" target="_blank">https://web.archive.org/web/20010210052902/http://www.chipcenter.com/dsp/DSP000315F1.html</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Crochiere, R.E.; Rabiner, L.R. (1983). "7.2". Multirate Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall. pp. 313–326. ISBN 0136051626. <a href="0136051626" target="_blank">0136051626</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Wang, Hong; Lu, Youxin; Wang, Xuegang (16 October 2006). "Channelized Receiver with WOLA Filterbank". 2006 CIE International Conference on Radar. Shanghai, China: IEEE. pp. 1–3. doi:10.1109/ICR.2006.343463. ISBN 0-7803-9582-4. S2CID 42688070. <a href="0-7803-9582-4" target="_blank">0-7803-9582-4</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Lyons, Richard G. (June 2008). "DSP Tricks: Building a practical spectrum analyzer". EE Times. Retrieved 2024-09-19. Note however, that it contains a link labeled weighted overlap-add structure which incorrectly goes to Overlap-add method. <a href="https://www.embedded.com/dsp-tricks-building-a-practical-spectrum-analyzer" target="_blank">https://www.embedded.com/dsp-tricks-building-a-practical-spectrum-analyzer</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Lillington, John (March 2003). "Comparison of Wideband Channelisation Architectures" (PDF). Dallas: International Signal Processing Conference. p. 4 (fig 7). S2CID 31525301. Archived from the original (PDF) on 2019-03-08. Retrieved 2020-09-06. The "Weight Overlap and Add" or WOLA or its subset the "Polyphase DFT", is becoming more established and is certainly very efficient where large, high quality filter banks are required. <a href="https://web.archive.org/web/20190308132844/http://pdfs.semanticscholar.org/f3af/7acf516685ad04b3ebe19eb79db4dc3feb39.pdf" target="_blank">https://web.archive.org/web/20190308132844/http://pdfs.semanticscholar.org/f3af/7acf516685ad04b3ebe19eb79db4dc3feb39.pdf</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Lillington, John. "A Review of Filter Bank Techniques - RF and Digital" (PDF). armms.org. Isle of Wight, UK: Libra Design Associates Ltd. p. 11. Retrieved 2020-09-06. Fortunately, there is a much more elegant solution, as shown in Figure 20 below, known as the Polyphase or WOLA (Weight, Overlap and Add) FFT. <a href="https://www.armms.org/media/uploads/16_lillington_a-review-of-filter-bank-techniques--.pdf" target="_blank">https://www.armms.org/media/uploads/16_lillington_a-review-of-filter-bank-techniques--.pdf</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Hochgürtel, Stefan (2013), "2.5", Efficient implementations of high-resolution wideband FFT-spectrometers and their application to an APEX Galactic Center line survey (PDF), Bonn: Rhenish Friedrich Wilhelms University of Bonn, pp. 26–31, Bibcode:2013PhDT.......427H, retrieved 2024-09-19, To perform M-fold WOLA for an N-point DFT, M·N real input samples aj first multiplied by a window function wj of same size <a href="https://bonndoc.ulb.uni-bonn.de/xmlui/bitstream/handle/20.500.11811/5701/3251.pdf" target="_blank">https://bonndoc.ulb.uni-bonn.de/xmlui/bitstream/handle/20.500.11811/5701/3251.pdf</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>WOLA should not be confused with the Overlap-add method of piecewise convolution. <a href="/wiki/Overlap-add_method" target="_blank">/wiki/Overlap-add_method</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>WOLA example: File:WOLA channelizer example.png <a href="/wiki/File:WOLA_channelizer_example.png" target="_blank">/wiki/File:WOLA_channelizer_example.png</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Lillington, John (March 2003). "Comparison of Wideband Channelisation Architectures" (PDF). Dallas: International Signal Processing Conference. p. 4 (fig 7). S2CID 31525301. Archived from the original (PDF) on 2019-03-08. Retrieved 2020-09-06. The "Weight Overlap and Add" or WOLA or its subset the "Polyphase DFT", is becoming more established and is certainly very efficient where large, high quality filter banks are required. <a href="https://web.archive.org/web/20190308132844/http://pdfs.semanticscholar.org/f3af/7acf516685ad04b3ebe19eb79db4dc3feb39.pdf" target="_blank">https://web.archive.org/web/20190308132844/http://pdfs.semanticscholar.org/f3af/7acf516685ad04b3ebe19eb79db4dc3feb39.pdf</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Lillington, John. "A Review of Filter Bank Techniques - RF and Digital" (PDF). armms.org. Isle of Wight, UK: Libra Design Associates Ltd. p. 11. Retrieved 2020-09-06. Fortunately, there is a much more elegant solution, as shown in Figure 20 below, known as the Polyphase or WOLA (Weight, Overlap and Add) FFT. <a href="https://www.armms.org/media/uploads/16_lillington_a-review-of-filter-bank-techniques--.pdf" target="_blank">https://www.armms.org/media/uploads/16_lillington_a-review-of-filter-bank-techniques--.pdf</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>Chennamangalam, Jayanth (2016-10-18). "The Polyphase Filter Bank Technique". CASPER Group. Retrieved 2016-10-30. <a href="https://casper.berkeley.edu/wiki/The_Polyphase_Filter_Bank_Technique" target="_blank">https://casper.berkeley.edu/wiki/The_Polyphase_Filter_Bank_Technique</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>Dahl, Jason F. (2003-02-06). Time Aliasing Methods of Spectrum Estimation (Ph.D.). Brigham Young University. Retrieved 2016-10-31. <a href="http://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1049&context=etd" target="_blank">http://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1049&context=etd</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). "4.2, 8.4". Discrete-time signal processing (2nd ed.). Upper Saddle River, N.J.: Prentice Hall. ISBN 0-13-754920-2. samples of the Fourier transform of an aperiodic sequence x[n] can be thought of as DFS coefficients of a periodic sequence obtained through summing periodic replicas of x[n]. <a href="0-13-754920-2" target="_blank">0-13-754920-2</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Lin, Yuan-Pei; Vaidyanathan, P.P. (June 1998). "A Kaiser Window Approach for the Design of Prototype Filters of Cosine Modulated Filterbanks" (PDF). IEEE Signal Processing Letters. 5 (6): 132–134. Bibcode:1998ISPL....5..132L. doi:10.1109/97.681427. S2CID 18159105. Retrieved 2017-03-16. <a href="http://authors.library.caltech.edu/6891/1/LINieeespl98.pdf" target="_blank">http://authors.library.caltech.edu/6891/1/LINieeespl98.pdf</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Harris, Frederic J. (2004-05-24). "9". Multirate Signal Processing for Communication Systems. Upper Saddle River, NJ: Prentice Hall PTR. pp. 226–253. ISBN 0131465112. <a href="0131465112" target="_blank">0131465112</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>Harris, Fredric J. (Jan 1978). "On the use of Windows for Harmonic Analysis with the Discrete Fourier Transform" (PDF). Proceedings of the IEEE. 66 (1): 51–83. Bibcode:1978IEEEP..66...51H. CiteSeerX 10.1.1.649.9880. doi:10.1109/PROC.1978.10837. S2CID 426548. <a href="http://web.mit.edu/xiphmont/Public/windows.pdf" target="_blank">http://web.mit.edu/xiphmont/Public/windows.pdf</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>Oppenheim and Schafer,[1] p 60, (2.169), and Prandoni and Vetterli,[2] p 122, (5.21) <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>Rabiner, Lawrence R.; Gold, Bernard (1975). Theory and application of digital signal processing. Englewood Cliffs, NJ: Prentice-Hall, Inc. p. 59 (2.163). ISBN 978-0139141010. <a href="978-0139141010" target="_blank">978-0139141010</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). "4.2, 8.4". Discrete-time signal processing (2nd ed.). Upper Saddle River, N.J.: Prentice Hall. ISBN 0-13-754920-2. samples of the Fourier transform of an aperiodic sequence x[n] can be thought of as DFS coefficients of a periodic sequence obtained through summing periodic replicas of x[n]. <a href="0-13-754920-2" target="_blank">0-13-754920-2</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>This expression is derived as follows:[1]: p.168 ∑ n = − ∞ ∞ s ( n M T ) e − i ω n = 1 M T ∑ k = − ∞ ∞ S ( ω 2 π M T − k M T ) = 1 M T ∑ m = 0 M − 1 ∑ n = − ∞ ∞ S ( ω 2 π M T − m M T − n T ) , where k → m + n M = 1 M ∑ m = 0 M − 1 1 T ∑ n = − ∞ ∞ S ( ( ω − 2 π m ) / M 2 π T − n T ) = 1 M ∑ m = 0 M − 1 S 2 π ( ω − 2 π m M ) {\displaystyle {\begin{aligned}\sum _{n=-\infty }^{\infty }s(nMT)\ e^{-i\omega n}&={\frac {1}{MT}}\sum _{k=-\infty }^{\infty }S\left({\tfrac {\omega }{2\pi MT}}-{\tfrac {k}{MT}}\right)\\&={\frac {1}{MT}}\sum _{m=0}^{M-1}\quad \sum _{n=-\infty }^{\infty }S\left({\tfrac {\omega }{2\pi MT}}-{\tfrac {m}{MT}}-{\tfrac {n}{T}}\right),\quad {\text{where}}\quad k\rightarrow m+nM\\&={\frac {1}{M}}\sum _{m=0}^{M-1}\quad {\frac {1}{T}}\sum _{n=-\infty }^{\infty }S\left({\tfrac {(\omega -2\pi m)/M}{2\pi T}}-{\tfrac {n}{T}}\right)\\&={\frac {1}{M}}\sum _{m=0}^{M-1}\quad S_{2\pi }\left({\tfrac {\omega -2\pi m}{M}}\right)\end{aligned}}} <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). "4.2, 8.4". Discrete-time signal processing (2nd ed.). Upper Saddle River, N.J.: Prentice Hall. ISBN 0-13-754920-2. samples of the Fourier transform of an aperiodic sequence x[n] can be thought of as DFS coefficients of a periodic sequence obtained through summing periodic replicas of x[n]. <a href="0-13-754920-2" target="_blank">0-13-754920-2</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>Proakis, John G.; Manolakis, Dimitri G. (1996). Digital Signal Processing: Principles, Algorithms and Applications (3 ed.). New Jersey: Prentice-Hall International. Bibcode:1996dspp.book.....P. ISBN 9780133942897. sAcfAQAAIAAJ. <a href="9780133942897" target="_blank">9780133942897</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> </ol>