Baseband Data Transmission
EE456 – Digital Communications
“A First Course in Digital Communications”
by Ha H. Nguyen and E. Shwedyk, Cambridge University Press,
March 2009
Department of Electrical & Computer Engineering
University of Saskatchewan
Saskatoon, SK, Canada, S7N 5A9
[Link]@[Link]
Fall 2008
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Introduction
Bits are mapped into two voltage levels for direct transmission
without any frequency translation.
Various baseband signaling techniques (line codes) were
developed to satisfy typical criteria:
1 Signal interference and noise immunity
2 Signal spectrum
3 Signal synchronization capability
4 Error detection capability
5 Cost and complexity of transmitter and receiver
implementations
Four baseband signaling schemes to be considered:
nonreturn-to-zero-level (NRZ-L), return-to-zero (RZ),
bi-phase-level or Manchester, and delay modulation or Miller.
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Baseband Signaling Schemes I
Binary Data 1 0 1 1 0 0 1 0 1
Clock
Tb
V
(a) NRZ Code 0 Time
(b) NRZ - L 0
−V
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Baseband Signaling Schemes II
(c) RZ Code 0
(d) RZ - L 0
−V
(e) Bi - Phase 0
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Baseband Signaling Schemes III
(f) Bi - Phase - L 0
−V
(g) Miller Code 0
(h) Miller - L 0
−V
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Miller Code
Has at least one transition every two bit interval and there is never
more than two transitions every two bit interval.
Bit “1” is encoded by a transition in the middle of the bit
interval. Depending on the previous bit this transition may be
either upward or downward.
Bit “0” is encoded by a transition at the beginning of the bit
interval if the previous bit is “0”. If the previous bit is “1”,
then there is no transition.
(f) Bi - Phase - L 0
−V
(g) Miller Code 0
EE456 – Digital Communications V Ha H. Nguyen
Baseband Data Transmission
NRZ-L Code
s1 (t ) s 2 (t )
φ1 (t )
V
Tb 1 Tb
0 0 Tb
−V 0 Tb
Choose 0T ⇐ Choose 1T
s1 (t ) s 2 (t )
φ1 (t )
− ENRZ-L 0 ENRZ-L
p
P [error]NRZ-L = Q 2ENRZ-L /N0 . (1)
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
RZ-L Code
φ1 (t ) φ 2 (t )
s1 (t ) s 2 (t )
1 Tb
V
Tb Tb 2 Tb
Tb Tb 2 Tb 0 0
0 0
−1 Tb − 1 Tb
−V −V
φ2 (t )
ERZ-L s 2 (t )
p
Choose 0T
P [error]RZ-L = Q ERZ-L /N0 .
Choose 1T
s1 (t )
0
φ1 (t )
ERZ-L
!"
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Bi-Phase-Level (Biφ-L) Code
s1 (t ) s 2 (t ) φ1 (t )
'()*+' '+,) '
V V 1 Tb
& Tb & Tb -
0 Tb 0 0
−V −V − 1 Tb
#$% ./0
Choose 0T ⇐ 4 Choose 1T
s1 (t ) s 2 (t )
φ1 (t )
− EBiφ -L 0 E Biφ -L
123
q
P [error]Biφ-L =Q 2EBiφ-L /N0 . (2)
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Miller-Level (M-L) I
s1 ( t ) 6 6 s 2 (t ) 6 6
:9;7 789
V V
5 Tb 5
0 Tb 0
−V
s3 ( t ) 6 6 s4 ( t ) 6 6
:9;7 789
Tb 5 5
0 0 Tb
−V <=> −V
φ 2 (t ) φ1 (t )
1 Tb 1 Tb
Tb ? ?
0 0 Tb
@AB
− 1 Tb
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Miller-Level (M-L) II
CDEEFG H
I
φ2 (t )
s 2 (t )
W ^
V ]
U
T
s 3 (t ) s1 (t ) \
[
S Z
S Z
R
Q 0 φ1 (t ) Y
X
s 4 (t )
JKLLMN O
P
_`a
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Miller-Level (M-L) III
φ2 (t ) r2
s 2 (t ) r̂2
0.5E M-L
s 3 (t ) s1 (t ) φ1 (t )
450
0
EM - L r1
s4 ( t )
r̂1
h p i2
P [error]M-L = 1 − 1 − Q EM-L /N0 (3)
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Performance Comparison
−1
10
−2
10
M−L
RZ−L
−3
10
P[error]
NRZ−L and Biφ−L
−4
10
−5
10
−6
10
0 2 4 6 8 10 12 14
E /N (dB)
b 0
ENRZ-L = ERZ-L = EBiφ-L = EM-L = V 2 Tb ≡ Eb (joules/bit). (4)
s !
2Eb
P [error]NRZ-L = P [error]Biφ-L = Q , (5)
N0
s ! s !
Eb Eb
P [error]RZ-L = Q , P [error]M-L ≈ 2Q . (6)
N0 N0
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Optimum Sequence Demodulation for Miller Signaling
Sequence demodulation exploits memory in Miller modulation.
Example: The four Miller signals have unit energy and the
projections of the received signals on to φ1 (t) and φ2 (t) are
n o n o
(1) (1) (2) (2)
r1 = −0.2, r2 = −0.4 , r1 = +0.2, r2 = −0.8 ,
n o n o
(3) (3) (4) (4)
r1 = −0.61, r2 = +0.5 , r1 = −1.1, r2 = +0.1 .
Transmitted signal Distance squared
0 → Tb Tb → 2Tb 2Tb → 3Tb 3Tb → 4Tb
s1 (t) 1.6 1.28 2.8421 4.42
s2 (t) 2.0 3.28 0.6221 2.02
s3 (t) 0.8 2.08 0.4021 0.02
s4 (t) 0.4 0.08 2.6221 2.42
{s4 (t), s4 (t), s3 (t), s3 (t)} is not a valid transmitted sequence!
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Assume that a total of n bits are transmitted. Each n-bit
pattern results in a transmitted signal over 0 ≤ t ≤ nTb .
Denote the entire transmitted signal over the time interval
[0, nTb ] as Si (t), i = 1, 2, . . . , M = 2n .
Write Si (t) = nj=1 Sij (t) where Sij (t) is one of the four
P
possible signals used in Miller code in the bit interval
[(j − 1)Tb , jTb ] and zero elsewhere.
Received signal over [0, nTb ] is r(t) = nj=1 rj (t) where
P
rj (t) = r(t) in the interval [(j − 1)Tb , jTb ] and zero elsewhere.
Distance (squared) from Si (t) to r(t):
Z nTb Xn Z jTb
2 2
di = [r(t) − Si (t)] dt = [rj (t) − Sij (t)]2 dt
0 j=1 (j−1)Tb
n
(j) 2 (j) 2
(j) (j)
X
= r1 − Si1 + r2 − Si2 . (7)
j=1
Direct evaluation of the M = 2n distances is impossible!
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
State Diagram
State of a system: Information from the past we need at the
present time, which together with the present input allows us to
determine the system’s output for any future input.
klmnh oph
bc
1 s2 (t ) 1 s 2 (t )
qnhmnh rpsl it
1 s 4 (t )
0 s1 (t )
be bf
0 s1 (t ) ghihj
0 s 3 (t )
0 s 3 (t ) 1 s 4 (t )
bd
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Trellis Diagram
| {|
{|| ~ {
| {|
z{| }~~~
s1 (t )
s 3 (t )
uvwvxy
⋅⋅⋅
s2 (t )
s4 (t )
0 Tb 2Tb 3Tb 4Tb
r1(1) , r2(1) r1( 2 ) , r2( 2 ) r1(3) , r2(3) r1( 4) , r2( 4 )
− 0.2, − 0.4 + 0.2, − 0.8 − .61, + 0.5 − 1.1, + 0.1
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Viterbi Algorithm
Step 1: Start from the initial state (s1 (t) in our case).
Step 2: In each bit interval, calculate the branch metric, which is the
distance squared between the received signal in that interval
with the signal corresponding to each possible branch. Add
this branch metric to the previous metrics to get the partial
path metric for each partial path up to that bit interval.
Step 3: If there are two partial paths entering the same state, discard
the one that has a larger partial path metric and call the
remaining path the survivor.
Step 4: Extend only the survivor paths to the next interval. Repeat
Steps 2 to 4 till the end of the sequence.
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Example 6.2 I
s1 (t )
s 3 (t )
¡¢
s2 (t )
s4 (t )
0 Tb
n o n o
(1) (1) (2) (2)
r1 = −0.2, r2 = −0.4 , r1 = +0.2, r2 = −0.8 ,
n o n o
(3) (3) (4) (4)
r1 = −0.61, r2 = +0.5 , r1 = −1.1, r2 = +0.1 .
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Example 6.2 II
s1 (t )
¨ ©ª«
ª©«
s 3 (t )
£¤¥¤¦§ ¬ ©ª«
¨©ª
s2 (t )
ª©««
¨©ª«
s4 (t )
0 Tb 2Tb
n o n o
(1) (1) (2) (2)
r1 = −0.2, r2 = −0.4 , r1 = +0.2, r2 = −0.8 ,
n o n o
(3) (3) (4) (4)
r1 = −0.61, r2 = +0.5 , r1 = −1.1, r2 = +0.1 .
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Example 6.2 III
² ³´µ
s1 (t )
¶ ³´µ
s 3 (t )
·¸¸¹º¹»
®¯®°±
¼ ¯®°½ ¾¿
s2 (t )
´³µµ
s4 (t )
0 Tb 2Tb
n o n o
(1) (1) (2) (2)
r1 = −0.2, r2 = −0.4 , r1 = +0.2, r2 = −0.8 ,
n o n o
(3) (3) (4) (4)
r1 = −0.61, r2 = +0.5 , r1 = −1.1, r2 = +0.1 .
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Example 6.2 IV
ÅÆÇÈÈ É
s1 (t )
ÈÆÊËÈ É
s 3 (t )
ÏÐÐÑÒÑÓ
ÀÁÂÁÃÄ
Ô ÂÁÃÕ Ö×
ÉÆÌÍÈ É
s2 (t )
ÎÆÇÍÈ É
s4 (t )
0 Tb 2Tb 3Tb
n o n o
(1) (1) (2) (2)
r1 = −0.2, r2 = −0.4 , r1 = +0.2, r2 = −0.8 ,
n o n o
(3) (3) (4) (4)
r1 = −0.61, r2 = +0.5 , r1 = −1.1, r2 = +0.1 .
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Example 6.2 V
ÝÞßàá â
s1 (t )
âÞãáá â
s 3 (t ) çèèéêéë
ØÙÚÙÛÜ
ì ÚÙÛí îï
ãÞäåá â
s2 (t )
æÞßáá â
s4 (t )
0 Tb 2Tb 3Tb 4Tb
n o n o
(1) (1) (2) (2)
r1 = −0.2, r2 = −0.4 , r1 = +0.2, r2 = −0.8 ,
n o n o
(3) (3) (4) (4)
r1 = −0.61, r2 = +0.5 , r1 = −1.1, r2 = +0.1 .
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Symbol-by-Symbol vs. Sequence Demodulation
0
10
−1
10
−2
10
P[error]
−3
10
−4
10
−5
10
Symbol−by−symbol demodulation (analytical result)
Sequence demodulation (simulation result)
−6
10
0 2 4 6 8 10 12 14
E /N (dB)
b 0
2 dB gain at the error probability of 10−2 and 0.5 dB at 10−6 .
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Spectrum I
SNRZ-L(f ) 1 sin2 (πf Tb )
= (1 − 2P )2 δ(f ) + 4P (1 − P ) . (8)
E Tb (πf Tb )2
2 2
∞
SBiφ (f ) 1 2
X n
= (1 − 2P ) δ f−
E Tb n=−∞
nπ Tb
n6=0
4
sin (πf Tb /2)
+ 4P (1 − P ) . (9)
(πf Tb /2)2
SM-L(f ) 1
= 2 (23 − 2 cos θ − 22 cos 2θ − 12 cos 3θ
E 2θ (17 + 8 cos 8θ)
+5 cos 4θ + 12 cos 5θ + 2 cos 6θ − 8 cos 7θ + 2 cos 8θ),(10)
where θ = πf Tb and P2 = P1 = 0.5.
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Spectrum II
2.5
2
Miller−L
Normalized PSD (S s(f)/E)
1.5
NRZ−L
1
Biφ−L
0.5
0
0 0.5 1 1.5 2
Normalized frequency (fTb)
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Differential NRZ-L Modulation
In differential modulation, the signal transmitted in one bit interval
is relative to the one transmitted in the previous interval.
If the present bit is a “1”, then transmit a level that is
opposite to that of the previous interval.
If the present bit is a “0”, then stay at the same level.
ù úø ñ ó þ
ýþÿ
bk d k = bk ⊕ d k −1 Transmitted
ûüø÷öûô
signal sT (t )
z −1
d k −1
ðóø÷
ðñòòóôóõöñ÷ø ùõúûüóô
If bk = 1 then dk = dk−1 , implying a level change and if bk = 0
then dk = dk−1 , which means no level change.
EE456 – Digital Communications Ha H. Nguyen
Baseband Data Transmission
Demodulation of Differential NRZ-L
t = kTb
r (t ) = sT (t ) + w (t ) 1D
dˆk
Exclusive-OR
bˆk
≥
Tb
∫ ( • ) dt ≤
0
0 rk = ±V + w k 0D
z −1
dˆk −1
Delay
1 Tb
Differential Decoder
t
0 Tb
First determine dk and call this estimate dˆk .
To recover bk , note that dk ⊕ dk−1 = bk ⊕ dk−1 ⊕ dk−1 = bk
The receiver uses dˆk−1 instead of dk−1 .
If dˆk is in error, there will be two errors in the sequence {b̂k }.
EE456 – Digital Communications Ha H. Nguyen