Premodulation pulse shaping filter used to filter NRZ data

- converts full response message signal into partial

response scheme

full response baseband symbols occupy T
b

partial response transmitted symbols span several T
b


Gaussian Pulse Shaping
2
t
h
G
(t)
2
s
T
2
s
T

2
3
s
T

2
3
s
T
t
h
G
(t)
2
s
T
2
s
T

2
3
s
T

2
3
s
T
2
s
T
2
s
T

2
3
s
T

2
3
s
T
o = 0.5
o = 0.75
o = 1.0
o = 2.0
Gaussian Pulse Shaping
Impulse response of pre-modulation Gaussian filter :
h
G
(t) =
|
|
.
|

\
|

2
2
exp
o
t
o
t
o is related to B
3dB
by:
B
B
5887 . 0
2
2 ln
=
o =
transfer function of pre-modulation Gaussian Filter is given by
H
G
(f) =
( )
2 2
exp f o
Gaussian Pulse Shaping
Advantages:

power efficiency - from constant envelope (non-linear amplifiers)
excellent spectral efficiency
Disadvantages:

pre-modulation filtering introduces ISI into transmitted signal

if B
3db
T
b
> 0.5 degradation is not severe
B
3dB
= 3dB bandwidth of Gaussian Pulse Shaping Filter
T
b
= bit duration = baseband symbol duration

irreducible BER caused by partial response signaling is the
cost for spectral efficiency & constant envelope
Gaussian Pulse Shaping
5
-4T -3T -2T -T 0 T 2T 3T 4T
h
RC
(t)
1/T
s
-4T -3T -2T -T 0 T 2T 3T 4T
h
RC
(t)
1/T
s
-4T -3T -2T -T 0 T 2T 3T 4T
h
RC
(t)
1/T
s
Baseband Gaussian Filter
impulse response plotted for
different B
3dB
T
s

Baseband RC Filter
impulse response plotted
for 0 s o s1
o = 0
o = 0.5
o = 1
t
h
G
(t)
2
s
T
2
s
T

2
3
s
T

2
3
s
T
t
h
G
(t)
2
s
T
2
s
T

2
3
s
T

2
3
s
T
2
s
T
2
s
T

2
3
s
T

2
3
s
T
o = 0.5
o = 0.75
o = 1.0
o = 2.0
Baseband M-ary PAM
Transmission
In an M-ary system, the information source emits a sequence of
symbols from an alphabet that consists of M symbols.
Each symbol contains log
2
(M) bits.
The pulse-amplitude modulator produces one of M possible
amplitude levels with M > 2.


Gray encoding
Approach to high speed transmission
Combination of two basic signal-processing operation
Discrete PAM
Linear modulation scheme
The number of detectable amplitude levels is often
limited by ISI
Residual distortion due to ISI : limiting factor on data rate
of the system
Baseband M-ary PAM
Transmission
Eye Pattern
Experimental tool for an evaluation in an insightful manner
Synchronized superposition of all the signal of interest viewed within a
particular signaling interval
Eye opening : interior region of the eye pattern



Eye Pattern
In the case of an M-ary system, the eye pattern contains (M-1) eye opening,
where M is the number of discreteamplitude levels
CORRELATIVE CODING
Ease the burden on the pulse shaping filters

Deliberately introduces some amounts of ISI into the
transmitted signal in a simple and controlled manner.

The amount of ISI added at transmitter is subtracted
out in the receiver , hence canceling the effect.

The Nyquist filter operation with minimum
bandwidth is therefore replaced by this technique.

Duobinary Signaling

By adding intersymbol interference to the transmitted signal
in a controlled manner, it is possible to achieve a signaling
rate equal to Nyquist rate of 2W symbols per second in a
channel of bandwidth W Hz.

Such schemes are called correlative-level coding or
partial-response signaling schemes.

Duobinary signaling is a specific example of correlative-level
coding.
Focus of developments of duobinary signaling are on optical
communications.
Since a known intersymbol interference is introduced into the
transmitted signal, its effect can be interpreted at the receiver
in a deterministic way.

Duobinary Signaling
Information source
Consider a logic binary input sequence {b
k
} consisting of
uncorrelated binary symbols 1 and 0, each having duration T
b
.
The corresponding pulse-amplitude modulator output
1 1,

0 1,
k
k
k
if symbol b is
a
if symbol b is
+
=

Introduce ISI into the

transmitted signal
1 k k k
c a a

= +
Nyquists Criterion
Ideal Nyquist channel
The simplest way of satisfying Nyquists criterion is to
specify the frequency P(f) to be in the form of a rectangular
function, as shown by
1 2 ,
( )
0,
1
rect
2 2
1

2 2
b
b
W f W W
P f
f W
f
W W
R
where W
T
< <

=

>

| |
=
|
\ .
= =
sin(2 )
( )
2
sinc(2 )
Wt
p t
Wt
Wt
t
t
=
=
Duobinary Signaling
An ideal delay element, producing a delay of T
b
seconds,
has the frequency response exp(j2tfT
b
)
Hence, the overall frequency response of this filter
connected in cascade with an ideal Nyquist channel is
| |
| |
( ) ( ) 1 exp( 2 )
( ) exp( ) exp( ) exp( )
2 cos( ) exp( )
2cos( ) exp( ), 1 2

0,
( )
I Nyquist b
Nyquist b b b
b b
b
N
b
yquist
b
H f H f j fT
H f j fT j
H
fT j fT
fT j fT
fT j fT f T
otherw e
f
is
t
t t t
t t
t t
= +
= +
=
s
=

1, 1 2
( )
0,
b
Nyquist
f T
H f
otherwise
s
=

Duobinary Signaling
Frequency response of the duo-binary conversion filter
An advantage of this frequency response is that it can be
easily approximated, in practice, by virtue of the fact that
there is continuity at the band edges.
Ideal Nyquist channel bandwidth
Duobinary Signaling
Impulse response of the duobinary conversion filter
| |
| |
2
sin ( ) sin( )
( )
( )
sin sin( )

( )
sin( )

( )
b b b
I
b b b
b b
b b b
b b
b
t T T t T
h t
t T t T T
t T t T
t T t T T
T t T
t T t
t t
t t
t t
t t
t
t

= +

No ISI is introduced when

detecting the previous symbol
Serious ISI is introduced when
detecting the next symbol
Duobinary Signaling
Detection of duobinary signaling
The original two-level sequence {a
k
} may be detected from the
duobinary-coded sequence {c
k
} by invoking the use of


Let represent the estimate of the original pulse a
k
as
conceived by the receiver at time t = kT
b
.
Then, subtracting the previous estimate from c
k
,


This technique of using a stored estimate of the previous symbol
is called decision feedback.
A major drawback of this detection procedure

k
a
1 k k k
c a a

= +
1

k
a

k
a
1

k k
c a

=
(error propagation) - once errors are made,
they tend to propagate through the output.
Precoded Duobinary Signaling
A practical means of avoiding the error-propagation phenomenon is
to use precoding before the duobinary coding.
The precoding operation performed on the binary data sequence
{b
k
} converts it into another binary sequence {d
k
} defined by






Essentially, the above-mentioned operation is a differential
encoding.
The precoded binary sequence {d
k
} is applied to a pulse-amplitude
modulator, producing a corresponding two-level sequence {a
k
},
and then applied it to the duobinary coder.
1 k k k
d b d

=
1
1 1

0
k
k
k
symbol if either symbol or symbol is
d
symbol oth
b d
erwise

Precoded Duobinary Signaling

Detection of the precoded duobinary signaling
if data symbol is 1 0,

if data symbol is 0 2,
k
k
k
b
c
b

Error
propagation ?
Example
Consider the binary data sequence 0010110.
To proceed with the precoding of this sequence, which
involves feeding the precoder output back to the input, an
extra bit is added to the precoder output.
This extra bit is chosen arbitrarily to be 1.
Duobinary Signaling
The duobinary technique has a correlation span of 1
binary digit.
It is a straightforward matter to generalize this technique to
other schemes, which is known as correlative-level
coding or partial-response signaling schemes.
Specially, different classes of partial-response signaling
schemes may be achieved by using a weighted linear
combination of N ideal Nyquist (sinc) pulses, as shown by




An appropriate choice of the tap-weights results in a variety
of spectral shapes designed to suit individual applications.
1
0
( ) sinc
n
N
n
b
t
h t n
T
w

=
| |
=
|
\ .

For example, in the duobinary case (class

I partial response, we have w
0
= +1, w
1
=
+1 and w
n
= 0 for n > 2
Generalized form of
Correlative Coding
Modified duobinary signaling
There is a DC component existing in the duobinary signal.
This is considered to be an undesired feature in some
applications, since many communications channels cannot
transmit DC component.
The output of the modified duobinary conversion filter is
related to the input two-level sequence {a
k
} at the pulse-
amplitude modulator outputs as follows:



Here, again, a three-level signal is generated.
With a
k
= 1, c
k
takes on one of three values: +2, 0, and 2.
2 k k k
c a a

=
Precoded Modified Duobinary Signaling
| |
( ) ( ) 1 exp( 4 )
2 ( )sin(2 ) exp( 2 )
IV Nyquist b
Nyquist b b
H f H f j fT
jH f fT j fT
t
t t
=
=
2 k k k
d b d

=
2
1 1

0
k
k
k
symbol if either symbol or symbol is
d
symbol oth
b d
erwise

( )
2 sin(2 ) exp( 2 ), 1 2

0,
IV
b b b
H f
j fT j fT f T
otherwise
t t s
=

Precoded Modified Duobinary Signaling

| |
| |
2
sin ( 2 )
sin( )
( )
( 2 )
sin
sin( )

( 2 )
2 sin( )

(2 )
b b
b
IV
b b b
b
b
b b b
b b
b
t T T
t T
h t
t T t T T
t T
t T
t T t T T
T t T
t T t
t
t
t t
t
t
t t
t
t

Precoded Modified Duobinary Signaling

Detection of the precoded modified duobinary signaling

if data symbol is 0 0,

if data symbol is 1 2,
k
k
k
b
c
b

Precoded Modified Duobinary Signaling

Example

The binary data 001101001 are applied to the input of a
duobinary system.

a) Construct the duobinary coder output and
corresponding receiver output, without a precoder.

b) Suppose that due to error during transmission, the level
at the receiver input produced by the second digit is
reduced to zero. Construct the new receiver output.

c) Repeat above two cases with use of precoder .
b
^
k
b
^
k
Input Sequence {b
k
} 0 0 1 1 0 1 0 0 1
Polar Voltage
Representation
-1 -1 +1 +1 -1 +1 -1 -1 +1
c
k
= b
k
+ b
k-1
-2 0 2 0 0 0 -2 0
a
k
= c
k
a
k-1
-1 -1 +1 +1 -1 +1 -1 -1 +1
Decoded 0 0 1 1 0 1 0 0 1
If error occurs in second position, c
k
received is 0 instead of -2V
Received C
k
-2 2 2 0 0 0 -2 0
polar form

a
k
= c
k
a
k-1

Decoded
-1 -1


0
3


1
-1


0
1


1
-1


0
1


1
-3


0
3


1
without a precoder
^ ^
^ ^
Input Sequence {b
k
} 0 0 1 1 0 1 0 0 1
Precodeed sequence
{d
k
} = b
k
d
k
-1
1 1 1 0 1 1 0 0 0 1
Polar Representation +1 +1 +1 -1 +1 +1 -1 -1 -1 +1
Duobinary coded sequence
c
k
= a
k
+ a
k-1

2 2 0 0 2 0 -2 -2 0
Decision b
k

c
k
> 1 symbol 0
c
k
< 1 symbol 1
0 0 1 1 0 1 0 0 1
If error occurs in 2
nd
position then voltage level of c
k
= 0 , then
Received c
k
2 0 0 0 2 0 -2 -2 0
Decision for b
k
c
k
> 1 symbol 0
c
k
< 1 symbol 1


0 1 1 1 0 1 0 0 1
With a precoder(start bit 1)
Input Sequence {b
k
} 0 0 1 1 0 1 0 0 1
Precodeed sequence
{d
k
} = b
k
d
k
-1
0 0 0 1 0 0 1 1 1 0
Polar Representation -1 -1 -1 +1 -1 -1 +1 +1 +1 -1
Duobinary coded sequence
c
k
= a
k
+ a
k-1

-2 -2 0 0 -2 0 +2 +2 0
Decision b
k

c
k
> 1 symbol 0
c
k
< 1 symbol 1
0 0 1 1 0 1 0 0 1
If error occurs in 2
nd
position then voltage level of c
k
= 0 , then
Received c
k
-2 0 0 0 -2 0 +2 +2 0
Decision for b
k
c
k
> 1 symbol 0
c
k
< 1 symbol 1


0 1 1 1 0 1 0 0 1
With a precoder(start bit 0)
Example : Consider binary sequence {b
k
}= {01101101} applied to input
of a precoded modified duobinary filter. Determine receiver output and
compare with original {b
k
}.

Binary sequence {b
k
} 0 1 1 0 1 1 0 1
Precoded sequence
d
k
= b
k
d
k-2
1
(d
k-2
)
1
(d
k-1
)
1 0 0 0 1 1 1 0
Polar Representation +1 +1 +1 -1 -1 -1 +1 +1 +1 -1
Transmitted output
c
k
= a
k
a
k-2

0 -2 -2 0 +2 +2 0 -2
Received Sequence
decision < 1V 0
> 1V 1
0 -2 -2 0 2 2 0 -2
Decoded
0 1 1 0 1 1 0 1
k C
k C
b
^
k
Binary sequence {b
k
} 0 1 1 0 1 1 0 1
Precoded sequence
d
k
= b
k
d
k-2
0
(d
k-2
)
0
(d
k-1
)
0 1 1 1 0 0 0 1
Polar Representation -1 -1 -1 +1 +1 +1 -1 -1 -1 +1
Transmitted output
c
k
= a
k
a
k-2

0 +2 2 0 -2 -2 0 2
Received Sequence
decision < 1V 0
> 1V 1
0 +2 2 0 -2 -2 0 2
Decoded
0 1 1 0 1 1 0 1
Consider binary sequence {b
k
}= {01101101}
k C
k C
b
^
k
Example

The binary data 011100101 are applied to the input of a
modified duobinary system.

a) Construct the modified duobinary coder output and
corresponding receiver output, without a precoder.

b) Suppose that due to error during transmission, the level
at the receiver input produced by the third digit is
reduced to zero. Construct the new receiver output.

c) Repeat above two cases with use of precoder .
Modified duobinary coder output and corresponding
receiver output, without a precoder
Binary sequence
{b
k
}
0 1 1 1 0 0 1 0 1
Polar Representation +1 +1 -1 +1 +1 +1 -1 -1 +1 -1 +1
Transmitted output
c
k
= b
k
b
k-2

-2 0 +2 0 -2 -2 2 0 0
Received Sequence -2 0 +2 0 -2 -2 2 0 0
Decision
b
k
= c
k
+b
k-2

+1 +1 -1 +1 +1 +1 -1 -1 +1 -1 +1
Decoded 0 1 1 1 0 0 1 0 1
b
^
k

If error occurs in 3
rd
position then voltage level of c
k
= 0 , then
Received c
k
-2 0 0 0 -2 -2 2 0 0
Decision for b
k
b
k
= c
k
+b
k-2



+1 +1 -1 +1 -1 +1 -3 -1 -1 -1 -1
Decoded
0 1 0 1 0 0 0 0 0
Binary sequence
{b
k
}
0 1 1 1 0 0 1 0 1
Precoded sequence
a
k
= b
k
a
k-2
1
(a
k-2
)
1
(a
k-1
)
1 0 0 1 0 1 1 1 0
Polar
Representation
+1 +1 +1 -1 -1 +1 -1 +1 +1 +1 -1
Transmitted output
c
k
= a
k
a
k-2

0 -2 -2 2 0 0 2 0 0
Received Sequence
decision
< 1V 0

> 1V 1
0 -2 -2 2 0 0 2 0 0
Decoded 0 1 1 1 0 0 1 0 1
k C
k C
Modified duobinary coder output and corresponding receiver
output, with a precoder









If error occurs in 3
rd
position then voltage level of c
k
= 0 , then
Received c
k
0 -2 0 2 0 0 2 0 0
Decision for b
k
c
k
> 1 symbol 0
c
k
< 1 symbol 1


0 1 0 1 0 0 1 0 1
Comparison of Binary with
Duobinary Signaling
Binary signaling assumes the transmitted pulse amplitude are
independent of one another
Duobinary signaling introduces correlation between pulse
amplitudes
Duobinary technique achieve zero ISI signal transmission using
a smaller system bandwidth
Duobinary coding requires three levels, compared with the usual
two levels for binary coding
Duobinary signaling requires more power than binary signaling
(~2.5 dB greater SNR than binary signaling)