Signals and Systems Review
Signals and Systems Review
T0
0
sgn(t) sgn(t)
! !
t t
! !
t t
⎧t , t > 0 ⎫ t
ramp ( t ) = ⎨ ⎬ = ∫ u (λ ) dλ = t u (t )
⎩0 , t ≤ 0 ⎭ −∞
ramp(t)
1
t
1
g (0) = ∫ δ (t ) g (t ) dt
−∞
∫ g (t )δ (t − t ) dt = g (t )
−∞
0 0
δ ( a ( t − t 0 )) = δ ( t − t 0 )
1
a
This property illustrates that the impulse is different from
ordinary mathematical functions.
δ T ( a ( t − t 0 )) = δ T /a ( t − t 0 ) , n an integer
1
a
8/25/15 M. J. Roberts - All Rights Reserved 10
The Unit Rectangle Function
⎧ 1 , t ≤1/ 2 ⎫ 1
Π ( t ) = rect ( t ) = ⎨ ⎬ = u (t + 1 / 2 ) − u (t − 1 / 2 ) , t ≠
⎩ 0 , t > 1 / 2⎭ 2
t t
1 1 1 1
2 2 2 2
Time shifting, t → t − t 0
4
t -4 4
t
-4 -1
dx/dt dx/dt
4 1
4
t -4 4
t
-4 -1
x(t) x(t)
1 1
-5 5
t 4
t
-1 -1
dx/dt dx/dt
1 1
-5 5
t 4
t
-1 -1
t t
t t
∫ g (t ) dt = 2 ∫ g (t ) dt
−a 0 −a
∫ g (t ) dt = 0
The integral of an odd function, over limits that are
symmetrical about zero, is zero.
8/25/15 M. J. Roberts - All Rights Reserved 20
Periodic Signals
If a function g(t) is periodic, g ( t ) = g ( t + nT ) where n is any integer
and T is a period of the function. The minimum positive value of T
for which g ( t ) = g ( t + T ) is called the fundamental period T0 of the
function. The reciprocal of the fundamental period is the fundamental
frequency f0 = 1 / T0 .
x(t) x(t) x(t)
... ... ... ... ...t
... t t
T0 T0 T0
A function that is not periodic is aperiodic.
∫ x ( t ) dt
2
Ex =
−∞
T T
where T is any period of the signal.
x (t ) x[n] x (t ) x[n]
ω s or fs
8/25/15 M. J. Roberts - All Rights Reserved 25
Sampling and Discrete Time
Real α Complex α
|z| < 1
Re(g[n]) Im(g[n])
-1 < z < 0
0 < z<1 n
n n
|z| > 1
z>1 z < -1 Re(g[n]) Im(g[n])
n
n n
n
∑ Aδ [ n − n ] x [ n ] = A x [ n ]
0 0
n=−∞
u[n]
1
... ...
n
ramp[n]
8
... 4 ...
n
4 8
N
[n]
!
... ...
n
-N N 2N
Time compression
n → Kn
K an integer > 1
h[n] h[n]
2 2
n
n -5 20
g[ n ] = ∑ h[m] -2
g[n]
-10
g[n]
10
n
m=−∞
2 8
n
-5 20
-2 n
-10 10
... ...
n
... ...
n
g [ n ] + g [ −n ] g [ n ] − g [ −n ]
ge [n] = go [n] =
2 2
-N N
n
Sum #2
Sum #1 = Sum #2
Sum #1 = - Sum #2
N N N
∑ g [ n ] = g [ 0 ] + 2∑ g [ n ] ∑ g[n] = 0
n=− N n=1 n=− N
∑ x[n]
2
Ex =
n=−∞
8/25/15
M. J. Roberts - All Rights Reserved
45
Response of LTI Systems
y (t ) = x (t ) ∗ h (t ) = ∫ x ( λ ) h (t − λ ) d λ
−∞
8/25/15
M. J. Roberts - All Rights Reserved
47
The Unit Triangle Function
⎧1− t , t < 1
tri ( t ) = ⎨
⎩0 , t ≥1
*8/25/15
M. J. Roberts - All Rights Reserved
48
Systems Described by
Differential Equations
8/25/15
M. J. Roberts - All Rights Reserved
49
Response of LTI Systems
If the excitation x ( t ) is a phasor or complex sinusoid of
frequency f0 , of the form
x ( t ) = Ax e jφx e j 2 π f0t
then the response y ( t ) is of the form
y ( t ) = H ( f0 ) x ( t ) = H ( f0 ) Ax e jφx e j 2 π f0t .
The response can also be written in the form
y ( t ) = Ay e y e j 2 π f0t where Ay = H ( f0 ) Ax and φy = φx + ! H ( f0 ) .
jφ
8/25/15
M. J. Roberts - All Rights Reserved
51
Convolution Sum Properties
x [ n ] ∗ Aδ [ n − n0 ] = A x [ n − n0 ]
Let y [ n ] = x [ n ] ∗ h [ n ] then
y [ n − n0 ] = x [ n ] ∗ h [ n − n0 ] = x [ n − n0 ] ∗ h [ n ]
y [ n ] − y [ n − 1] = x [ n ] ∗ ( h [ n ] − h [ n − 1]) = ( x [ n ] − x [ n − 1]) ∗ h [ n ]
and the sum of the impulse strengths in y is the product of
the sum of the impulse strengths in x and the sum of the
impulse strengths in h.
8/25/15
M. J. Roberts - All Rights Reserved
52
Systems Described by Difference
Equations
The transfer function is
∑
M −k
b z b0 + b1z −1 + b2 z −2 +!+ bM z − M
H(z) = =
k=0 k
∑ a0 + a1z −1 + a2 z −2 +!+ aN z − N
N −k
a
k=0 k
z
or, alternately,
∑ k=0 k
M −k
b z b0 z M + b1z M −1 +!+ bM −1z + bM
H(z) = = z N −M
∑ a0 z N + a1z N −1 +!+ aN −1z + aN
N −k
k=0
a k z
The transfer function can be written directly from the system
( )
difference equation and vice versa. H e jΩ is the system's
frequency response. It is the transfer function H ( z ) with z
replaced by e jΩ .
8/25/15
M. J. Roberts - All Rights Reserved
53
Continuous-Time Fourier Series
Definition
∞ t 0 +T
1
x (t ) = ∑ Xn e j 2 π nt /T and Xn =
T ∫ x ( t ) e− j 2 π nt /T dt .
n=−∞ t0
8/25/15
M. J. Roberts - All Rights Reserved
54
CTFS of a Real Function
It can be shown that the continuous-time Fourier series (CTFS)
harmonic function of any real-valued function x ( t ) has the property
that Xn = X−* n .
8/25/15
M. J. Roberts - All Rights Reserved
55
The Sinc Function
Let x ( t ) = A rect ( t / w ) ∗ δ T0 ( t ) , w < T0 . Then
sin (π nw / T0 )
x ( t ) = A rect ( t / w ) ∗ δ T0 ( t ) ←⎯⎯
FS
→ Xn = A
T0
πn
sin (π x )
The mathematical form arises frequently enough
πx
sin (π t )
to be given its own name, "sinc". That is sinc ( t ) = .
πt
8/25/15
M. J. Roberts - All Rights Reserved
56
The Uniqueness Property
If we find a Fourier series representation of a signal, it is
unique. That is, no other or alternate Fourier series
representation exists.
Example: Let x ( t ) = 3cos ( 8π t − π / 4 ) + 4 sin ( 4π t )
Using trigonometric identities, this can be rewritten as
x ( t ) = 3 ⎡⎣ cos ( 8π t ) cos (π / 4 ) − sin ( 8π t ) sin (π / 4 ) ⎤⎦ + 4 sin ( 4π t )
3 2
x (t ) = ⎡⎣ cos ( 8π t ) − sin ( 8π t ) ⎤⎦ + 4 sin ( 4π t )
2
8/25/15
M. J. Roberts - All Rights Reserved
57
The Uniqueness Property
3 2 ⎡ e j 8 π t + e− j 8 π t e j 8 π t − e− j 8 π t ⎤ e j 4 π t − e− j 4 π t
x (t ) = ⎢ − ⎥ +4
2 ⎣ 2 j2 ⎦ j2
x (t ) =
3 2
4
(
⎡⎣(1+ j ) e j 8 π t + (1− j ) e− j 8 π t ⎤⎦ − j2 e j 4 π t − e− j 4 π t )
3 2 3 2
x (t ) = (1+ j ) e +
j 8π t
(1− j ) e− j 8π t − j2e j 4 π t + j2e− j 4 π t
4 4
This is THE ( complex ) CTFS representation of x ( t ) in which
∞
3 2
x (t ) = ∑Xe n
j 2 π nf0t
, f0 = 2 , X−2 =
4
(1− j ) , X−1 = j2 , X1 = − j2 ,
n=−∞
3 2
X2 = (1+ j ) and all other CTFS coefficients are zero.
4
8/25/15
M. J. Roberts - All Rights Reserved
58
Some Common CTFS Pairs
1 ←⎯
FS
T
→ δ [ n ] , T arbitrary
⎧(1 / T0 ) , n / m an integer
δ T0 ( t ) ←⎯⎯
FS
mT0
→⎨
⎩0 , otherwise
e j 2 π qt /T0 ←⎯⎯
FS
mT0
→ δ [ n − mq ]
sin ( 2π qt / T0 ) ←⎯⎯
FS
mT0
→ ( j / 2 ) (δ [ n + mq ] − δ [ n − mq ])
cos ( 2π qt / T0 ) ←⎯⎯
FS
mT0
→ (1 / 2 ) (δ [ n − mq ] + δ [ n + mq ])
rect ( t / w ) ∗ δ T0 ( t ) ←⎯⎯
FS
mT0
→ ( w / T0 ) sinc ( wn / mT0 )δ m [ n ]
tri ( t / w ) ∗ δ T0 ( t ) ←⎯⎯
FS
mT0
→ ( 0)
w / T sinc 2
( wn / mT0 )δ m [ n ]
( m an integer )
8/25/15
M. J. Roberts - All Rights Reserved
59
Definition of the CTFT
Forward f form Inverse
∞ ∞
X ( f ) = F ( x ( t )) = ∫ x ( t ) e − j 2 π ft
dt x (t ) = F ( X ( f )) = ∫ X ( f ) e
-1 + j 2 π ft
df
−∞ −∞
X ( jω ) = F ( x ( t )) = x ( t ) = F ( X ( jω )) =
1
∫ x ( t ) e − jω t
dt -1
∫ X ( jω ) e+ jω t dω
−∞
2π −∞
Commonly-used notation:
x ( t ) ←⎯
F
→ X( f ) or x ( t ) ←⎯
F
→ X ( jω )
8/25/15
M. J. Roberts - All Rights Reserved
60
Some CTFT Pairs
()
δ t ←⎯
F
→1
()
e−α t u t ←⎯
F
(
→ 1/ jω + α ) , α >0 ( )
− e−α t u −t ←⎯
F
(
→ 1/ jω + α ) , α <0
te u ( t ) ←⎯→ 1/ ( jω + α ) , α > 0 − te u ( −t ) ←⎯→ 1/ ( jω + α ) , α < 0
−α t F 2 −α t F 2
t e u ( t ) ←⎯→ − t e u ( −t ) ←⎯→
n −α t n! n −α t n!
F
, α >0 F
, α <0
( jω + α ) ( jω + α )
n+1 n+1
ω ω
e−α t sin (ω t ) u ( t ) ←⎯→
F 0
, α >0 − e−α t sin (ω t ) u ( −t ) ←⎯→
F 0
, α <0
( jω + α ) + ω ( jω + α ) + ω
0 2 0 2
2 2
0 0
jω + α jω + α
e−α t cos (ω t ) u ( t ) ←⎯→
F
, α >0 − e−α t cos (ω t ) u ( −t ) ←⎯→
F
, α <0
( jω + α ) + ω ( jω + α ) + ω
0 2 0 2
2 2
0 0
−α t 2α
e ←⎯
F
→ , α >0
ω2 +α2
8/25/15
M. J. Roberts - All Rights Reserved
61
More CTFT Pairs
()
δ t ←⎯
F
→1 1←⎯
F
( )
→δ f
sgn ( t ) ←⎯→ 1/ jπ f
F
u ( t ) ←⎯→ (1/ 2 )δ ( f ) + 1/ j2π f
F
δ ( t ) ←⎯→ f δ ( f ) , f = 1/ T
T0
F
0 f0 0 0
T δ ( t ) ←⎯→ δ ( f ) , T = 1/ f
0 T0
F
f0 0 0
8/25/15
M. J. Roberts - All Rights Reserved
62
Numerical Computation of the CTFT
It can be shown that the DFT can be used to approximate
samples from the CTFT. If the signal x ( t ) is a causal energy
signal and N samples are taken from it over a finite time
beginning at t = 0, at a rate fs then the relationship between the
CTFT of x ( t ) and the DFT of the samples taken from it is
X ( kfs / N ) ≅ Ts e− jπ k/N sinc ( k / N ) X DFT [ k ]
For those harmonic numbers k for which k << N
X ( kfs / N ) ≅ Ts X DFT [ k ]
As the sampling rate and number of samples are increased,
this approximation is improved.
8/25/15
M. J. Roberts - All Rights Reserved
63
The Discrete-Time Fourier Series
The discrete-time Fourier series (DTFS) is similar to the CTFS.
A periodic discrete-time signal can be expressed as
1 n0 +N −1
x[n] = ∑ c x [ k ] e j 2 π kn/N cx [ k ] = ∑
N n=n0
x [ n ] e − j 2 π kn/N
k= N
8/25/15
M. J. Roberts - All Rights Reserved
64
The Discrete Fourier Transform
The discrete Fourier transform (DFT) is almost identical to the DTFS.
A periodic discrete-time signal can be expressed as
n0 + N −1
1
x[n] =
N
∑ X [ k ] e j 2 π kn/N X[ k ] = ∑ x [ n ] e− j 2 π kn/N
k= N n=n0
8/25/15
M. J. Roberts - All Rights Reserved
65
The Discrete Fourier Transform
Because the DTFS and DFT are so similar, and because the DFT is
so widely used in digital signal processing (DSP), we will concentrate
on the DFT realizing we can always form the DTFS from
c x [ k ] = X [ k ] / N.
8/25/15
M. J. Roberts - All Rights Reserved
66
The Discrete Fourier Transform
Notice that in
1
x[n] =
N
∑ X [ k ] e j 2 π kn/N
k= N
8/25/15
M. J. Roberts - All Rights Reserved
67
The Dirichlet Function
drcl(t,4) drcl(t,5)
sin (π Nt ) 1 1
The functional form
N sin (π t ) t t
-2 2 -2 2
appears often in discrete-time
-1 -1
signal analysis and is given the
special name Dirichlet function. drcl(t,7) drcl(t,13)
That is 1 1
sin (π Nt )
drcl ( t, N ) = t t
N sin (π t )
-2 2 -2 2
-1 -1
8/25/15
M. J. Roberts - All Rights Reserved
68
Response of LTI Systems
∫ X( f ) ∫ Y( f ) ∫ H( f ) X ( f ) df
2 2 2 2
theorem Ex = df and Ey = df =
−∞ −∞ −∞
Most real systems do not have simple delay. They have phases
that are not linear functions of frequency.
!H( f ) !H( f )
f f
⎪ (
⎣ )
⎧x1 t − tg ⎡ e j ( 2 π fct +φ0 ) + e− j ( 2 π fct +φ0 ) ⎤ ⎫
⎦ ⎪
y (t ) ≅ ( A / 2 ) ⎨ ⎬
(⎡
⎪⎩+ x 2 t − tg j ⎣ e )
− j ( 2 π fc t + φ 0 )
−e j ( 2 π fc t + φ 0 )
⎤
⎦ ⎪⎭
{ ( ) ( )
y ( t ) ≅ A x1 t − tg cos ( 2π fct + φ0 ) + x 2 t − tg sin ( 2π fct + φ0 ) }
y ( t ) ≅ A {x ( t − t ) cos ( 2π f ( t − t )) + x ( t − t ) sin ( 2π f ( t − t ))}
1 g c d 2 g c d
φ0 ! H ( fc )
where t d = − =− is known as the phase or carrier delay.
2π fc 2π fc
or
tg ≅ −
1 d
2π df
( !H ( f )) , fc − W < f < fc + W
t t
-1
t t
-1
Modulated Carrier
Response
x (t )
Y ( f ) = a1 X ( f ) + a2 X ( f ) ∗ X ( f ) + a3 X ( f ) ∗ X ( f ) ∗ X ( f ) +!
( ) (
+ A1 A2 ⎡⎣ cos (ω 1 − ω 2 ) t + cos (ω 1 + ω 2 ) t ⎤⎦ )
8/25/15 M. J. Roberts - All Rights Reserved 81
Signal Distortion in Transmission
( ) ( )
y ( t ) = A12 / 2 ⎡⎣1 + cos ( 2ω 1t ) ⎤⎦ + A22 / 2 ⎡⎣1 + cos ( 2ω 2t ) ⎤⎦
( ) (
+ A1 A2 ⎡⎣ cos (ω 1 − ω 2 ) t + cos (ω 1 + ω 2 ) t ⎤⎦ )
y ( t ) contains frequencies 2ω 1 , 2ω 2 , ω 1 − ω 2 and ω 1 + ω 2 . The
frequencies ω 1 − ω 2 and ω 1 + ω 2 are called intermodulation
distortion products. When the excitation contains more
frequencies (which it usually does) and the nonlinearity is of
higher order (which it often is), many more intermodulation
distortion products occur. All systems have nonlinearities
and intermodulation disortion will occur. But, by careful design,
it can often be reduced to a negligible level.
(
expressed in dB also. H ( f ) dB = 10 log10 H ( f )
2
) = 20 log
10 ( H ( f ) ).
f
Stop Band Pass Band Stop Band
Minimum Stopband
Attenuation
f
Stop Band
1
illustrated the magnitude frequency response
of a normalized lowpass Butterworth filter 1
2
with a corner frequency of 1 radian/s.)
n=1
n=2
n=8 n=4
ω
-5 -4 -3 -2 -1 1 2 3 4 5
1
2
n=1
n=2
n=8 n=4
ω
-5 -4 -3 -2 -1 1 2 3 4 5
h −1 ( t ) = ∫ h ( λ ) u (t − λ ) d λ = ∫ h ( λ ) d λ
−∞ −∞
(g ( t ) in the book). That is, the step response is the integral of the impulse
response. The impulse response of a unity-gain ideal lowpass filter with
no delay is h ( t ) = 2Bsinc ( 2Bt ) where B is its bandwidth. Its step response
is therefore
t
⎡0 t
⎤
h −1 ( t ) = ∫ 2Bsinc ( 2Bλ ) d λ = 2B ⎢ ∫ sinc ( 2Bλ ) d λ + ∫ sinc ( 2Bλ ) d λ ⎥
−∞ ⎣ −∞ 0 ⎦
This result can be further simplified by using the definition of the sine
integral function
sin (α )
θ θ /π
Si (θ ) ! ∫ dα = π ∫ sinc ( λ ) d λ
0
α 0
1.5 π/2
0.5
Si(t)
-0.5
-1
-1.5 −π/2
-2
-30 -20 -10 0 10 20 30
t
8/25/15 M. J. Roberts - All Rights Reserved 93
Filters and Filtering
⎡0 t
⎤
h −1 ( t ) = 2B ⎢ ∫ sinc ( 2Bλ ) d λ + ∫ sinc ( 2Bλ ) d λ ⎥
⎣ −∞ 0 ⎦
0 2 Bt
Si ( ∞ ) 1 1 1
h −1 ( t ) = + Si ( 2π Bt ) = + Si ( 2π Bt )
π π 2 π
h (t)
0.5
Step response of an Ideal
→ -1
Lowpass Filter with B = 1
0
-0.5
-2 -1.5 -1 -0.5 0 0.5 1 1.5 2
t
8/25/15 M. J. Roberts - All Rights Reserved 95
Filters and Filtering
The response of an ideal lowpass filter to a rectangular pulse of width τ is
y ( t ) = h −1 ( t ) − h −1 ( t − τ ) = ⎡⎣Si ( 2π Bt ) − Si ( 2π B ( t − τ )) ⎤⎦ .
1
π
From the graph (in which B = 1) we see that, to reproduce the
rectangular pulse shape, even very crudely, requires a bandwidth
much greater than 1/τ . If we have a pulse train with pulse widths
τ and spaces between pulses also τ and we 1.5
τ = 1/4
τ = 1/2
want to simply detect whether or not a pulse τ=2
1
y(t)
0.5
hard to resolve.
-0.5
-2 -1 0 1 2 3 4
t
1.5 1.5
|X( f )|
x(t)
0.5 0.5
−0.5
0
−4 −3 −2 −1 0 1 2 3 4 −4 −3 −2 −1 0 1 2 3 4
t (s) f (Hz)
1.5 1.5
1 1
Finite pulse width and
|X( f )|
x(t)
0.5 0.5
0 0
infinite bandwidth −0.5
−4 −3 −2 −1 0 1 2 3 4
−0.5
−4 −3 −2 −1 0 1 2 3 4
t (s) f (Hz)
1.5 1.5
1 1
|X( f )|
Infinite pulse width and
x(t)
0.5 0.5
0 0
t f
T T −W W
2 2
Let the rectangular pulse approximate the general pulse with the
∞ ∞
x (0) 1 x (0)
≥ and 2W ≥
X(0) T X(0)
1 1
which combine to 2W ≥ or W ≥ . This is a handy, practical
T 2T
rule of thumb for the approximate bandwidth of a pulse.
1
δ (t )
πt
e jt − je jt
e− jt je− jt
cos ( t ) sin ( t )
1 2t + 1
rect ( t ) ln
π 2t − 1
sinc ( t ) (π t / 2 ) sinc 2 (t / 2 ) = sin (π t / 2 ) sinc (t / 2 )
1 t
1+ t2 1+ t2
x(t)
~x(t)
0 0
complex envelope −1 −1
1 1
times the signal
h(t)
h(t)
0 0
energy of y ( t ) .
~
−1 −1
1 1
y(t)
y(t)
0 0
~
−1 −1
x(t)
0.5
x(t)
x(t)
−0.5
t (s)
−1
−4 −3 −2 −1 0 1 2 3 4
t (s)
1 1
0.9
0.8
0.5
0.7
0.6
|xp(t)|
x(t)
0 0.5
0.4
0.3
−0.5
0.2
0.1
−1 0
−4 −3 −2 −1 0 1 2 3 4 −4 −3 −2 −1 0 1 2 3 4
t (s) t (s)
y! ( t ) = α ⎢ ∞ ⎥
−∞
⎢ ⎥
⎢− ∫ u (λ − τ / 2) e u (t − λ ) d λ ⎥
− α ( t− λ )
⎢⎣ −∞ ⎥⎦
( ) ( )
y! ( t ) = ⎡⎣ 1− e−α (t+τ /2 ) u ( t + τ / 2 ) − 1− e−α (t−τ /2 ) u ( t − τ / 2 ) ⎤⎦
1
(
y ( t ) = Re y! ( t ) e j 2 π f0t
2
)
1
((( ) ( ) )
y ( t ) = Re 1− e−α (t+τ /2 ) u ( t + τ / 2 ) − 1− e−α (t−τ /2 ) u ( t − τ / 2 ) e j 2 π f0t
2
)
1⎡
( ) ( )
y ( t ) = ⎣ 1− e−α (t+τ /2 ) u ( t + τ / 2 ) − 1− e−α (t−τ /2 ) u ( t − τ / 2 ) ⎤⎦ cos ( 2π f0t )
2
∫ X( f ) df . X ( f )
2
found directly from its Fourier transform, Ex =
−∞
its integral over all frequency yields total average signal power.
Therefore S ( f ) indicates the variation of average signal power as
a function of frequency.
( G ( f )) ⎛
(
X ( f ) ⎞ = F −1 X ( f ) X * ( f ) )
2
−1 −1
F =F
⎝ ⎠
( )
= F −1 X ( f ) ∗ F −1 X * ( f )
!#"#$ !# #"## $
( )
=x t () =x −t( )
∞
So F −1
(G ( f )) = x (t ) ∗ x ( −t ) = ∫ x (τ ) x (t + τ ) dτ .
−∞
φ (τ ) = x (τ ) ∗ x ( −τ ) = ∫ x (t ) x (t + τ ) dt
−∞
which is the signal energy. If the shift τ is small and the value of
φ (τ ) does not change much, we say there is a strong correlation
between x and the shifted version of x for small shifts. So a slowly
changing φ (τ ) indicates that the signal still looks like itself even
when shifted a significant amount. A quickly changing φ (τ ) indicates
that even a small shift makes the signal look very different.
( )
4. F R (τ ) is everywhere non-negative
5. If x ( t ) is periodic then R x (τ ) is also, with the same period
τ →∞
Four Different
Random Signals
with Identical
Autocorrelations
Four Different
Random Signals
with Identical
Autocorrelations