Min := 0 Max := 10 Inc := 0.2 x := Min , Min + Inc .. Max s := .

3 K := 1
i := Min .. Max ε ≡ .001 σ := .5 f ( x ) := cos( 2 ⋅ π ⋅ s⋅ x )
j := 0 .. 3 ⋅ Max + 16
y := Min , Min + Inc .. 3 ⋅ Max
  x− τ  
2
− .5⋅ 

S( x , τ , σ ) := if ( x − τ < 2.5) , K⋅ e  σ  , 0 1
 K := K = 0.787
S( 0 , 0 , σ ) + 2 ⋅ S( 0 , 1 , σ )

======================================================================================
3X Sinc Resampling with Gaussian Interpolation
Ken Castleman f_03-12.MCD
Jan. 27, 1991

Suppose we have a signal f ( x ) := cos( 2 ⋅ π ⋅ s⋅ x )

1
s = 0.3

which is sampled A := f ( i)
i
f ( x) 0

and interpolated by
1
2 0 1 2 3 4 5 6 7 8 9 10
 x− τ 
− .5⋅  x
S( x , τ , σ ) := K⋅ e  σ  1.5

K = 0.787 σ = 0.5
Ai
h ( i , x ) := A ⋅ S( x , i , σ )
0
i

The interpolated function is

g ( x ) :=
∑ h( i , x) 1.5
0 1 2 3 4 5 6 7 8 9 10
i
i
1

which differs somewhat from

the origonal function in both g( x) 0
amplitude and waveshape.

1
0 1 2 3 4 5 6 7 8 9 10
x
Figure 3-11
Even though the function is oversampled (s = 0.3 cycles per sample), interpolation
with a Gaussian interpolation function (display spot) does not give a good
reconstruction.

3X Resampling

We can improve the interpolation process by resampling the function at a 3X higher

sampling density. The hard way to do this is to perform the origonal sampling at a
higher sampling frequency. An easier way is to create two new sample points between
each pair of existing sample points by interpolating them with sin(x)/x. Since the
function is oversampled to begin with, the result is the same.
B := 0 B := A
j 3⋅ i i
1.5
sin( π ⋅ x )
p ( x ) := p ( .333) = 0.827
π⋅x
p ( .667) = 0.413
p ( 1.333 ) = −0.207 Bj 0
p ( 1.667 ) = −0.165

The interpolation coefficients must be

normalized to sum to 1.0 so that areas of
constant amplitude will be preserved. 1.5
0 3 6 9 12 15 18 21 24 27 30 33 36
j
Sum := p ( .333) + p ( 1.33) + p ( 2.33) + p ( .667) + p ( 1.667 ) + p ( 2.667 )
p ( 2.333 ) p ( 1.333 ) p ( 0.333 )
C1 := C2 := C3 := Sum = 1.09
Sum Sum Sum

p ( .667) p ( 1.667 ) p ( 2.667 )

C4 := C5 := C6 :=
Sum Sum Sum

Interpolation fills in the new "synthetic" sample points.

k := 7 , 10 .. 31

B := C1⋅ B + C2⋅ B + C3⋅ B + C4⋅ B + C5⋅ B + C6⋅ B

k k− 7 k− 4 k− 1 k+ 2 k+ 5 k+ 8

k := 8 , 11 .. 32

B := C6⋅ B + C5⋅ B + C4⋅ B + C3⋅ B + C2⋅ B + C1⋅ B

k k− 8 k− 5 k− 2 k+ 1 k+ 4 k+ 7

B := B B := B B := B B := B
4 14 5 15 1 11 2 12

h ( j , y ) := B ⋅ S( y , j , σ )
j
g ( y ) :=
∑ h( j , y)
j

1 1

Bj g( y)
0 0
0 0

1 1

0 5 10 15 20 25 30 0 5 10 15 20 25 30
j y

{a} (b)
Figure 3-12

(a) Notice how this sampled function looks easier to interpolate.

(b) Notice how this interpolated function more closely resembles the origonal
waveshape.