0% found this document useful (0 votes)
45 views

Line Coding: Unnikrishnan B Sde RTTC TVM

Line coding is the process of converting binary data into a digital signal. It involves choosing pulse patterns to represent 1s and 0s. Different line coding schemes include unipolar, polar, Manchester, and bipolar codes. Bipolar codes like HDB3 add transitions to ensure synchronization despite long runs of zeros. Line coding aims to make the digital signal self-clocking and minimize DC components for reliable transmission.
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views

Line Coding: Unnikrishnan B Sde RTTC TVM

Line coding is the process of converting binary data into a digital signal. It involves choosing pulse patterns to represent 1s and 0s. Different line coding schemes include unipolar, polar, Manchester, and bipolar codes. Bipolar codes like HDB3 add transitions to ensure synchronization despite long runs of zeros. Line coding aims to make the digital signal self-clocking and minimize DC components for reliable transmission.
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 52

Line Coding

Unnikrishnan B
SDE RTTC TVM
Figure 4.1 Line coding and decoding
Figure 4.1 Line coding
Figure 4.2 Signal element versus data element

Line coding is the process of converting


binary data, a sequence of bits to a digital
signal.
Definitions of the components/Keywords:
5
3
2
4
1
Binary data can be transmitted using a number of different
types of pulses. The choice of a particular pair of pulses to
represent the symbols 1 and 0 is called Line Coding.
Master Layout
5
3
2
4
1
0 1 1 0 1 1 1 0 1 0 1
nput
!ata
!igital
"ignal
Step 1:
1
5
3
2
4
unipolar #$% &#on $eturn to %ero'
Instruction for the animator Text to be displayed in the orkin! area "DT#
( The first fig should appear then the
second fig should appear.
( In parallel to the figures the text
should be displayed.
( Bit 0 is mapped to amplitude close to zero
( Bit 1 is mapped to a positive amplitude
( D! component is present
$epresentation of 0 $epresentation of 1
Step 2:
1
5
3
2
4
)olar #$% &#on $eturn to %ero'
Instruction for the animator Text to be displayed in the orkin! area "DT#
( The first fig should appear then the
second fig should appear.
( In parallel to the figures the text
should be displayed.
( Bit 0 is mapped to a negative amplitude
( Bit 1 is mapped to a positive amplitude
( D! component is present
$epresentation of 0 $epresentation of 1
Step 3:
1
5
3
2
4
)olar $% &$eturn to %ero'
Instruction for the animator Text to be displayed in the orkin! area "DT#
( The first fig should appear then the
second fig should appear.
( In parallel to the figures the text
should be displayed.
( bit " is mapped to a negative amplitude # for the first half of the
symbol duration followed by a zero amplitude for the second half of
the symbol duration.
bit $ is mapped to a positive amplitude % for the first half of the
bit duration followed by a zero amplitude for the second half of the bit
duration.
$epresentation of 0 $epresentation of 1
Step 5:
1
5
3
2
4
Manchester coding
Instruction for the animator Text to be displayed in the orkin! area "DT#
( The first fig should appear then the
second fig should appear.
( In parallel to the figures the text
should be displayed.
&it " is sent by having a mid'bit transition from high to low.
(&it $ is sent by having a mid'bit transition from low to high.
$epresentation of 0 $epresentation of 1
The corresponding *aveforms should be sho*n in the demo part *hen a
particular line code is selected.
+igh !ensity Bipolar &+!Bn'

modified bipolar codes *hich guarantee


transitions despite runs of ,eros.

thus substitute runs of more than n ,eros


an alternative name is Bn%"

in this case substitute runs of n or more


,eros

+!B- is a popular code

note +!B- is equivalent to B.%"

#eed for line codes

Type of Line codes

!ifferent Line codes


Return-to-zero

Return-to-zero (RZ) describes a line code


used in telecommunications sinals in !"ic"
t"e sinal drops (returns) to zero bet!een
eac" pulse# T"is ta$es place e%en i& a
number o& consecuti%e '(s or 1(s occur in t"e
sinal# T"e sinal is sel&-cloc$in# T"is
means t"at a separate cloc$ does not need to
be sent alonside t"e sinal) but su&&ers &rom
usin t!ice t"e band!idt" to ac"ie%e t"e
same data-rate as compared to non-return-
to-zero &ormat#
RZ and NRZ
AMI
AMI

*nipolar encodin is a line code. / positive voltage represents


a binary 1, and ,ero volts indicates a binary 0. t is the simplest line
code, directly encoding the bitstream, and is analogous to on0off
1eying in modulation.

ts dra*bac1s are that it is not self0cloc1ing and it has a


significant !C component, *hich can be halved by using return0to0
,ero, *here the signal returns to ,ero in the middle of the bit period.
2ith a 304 duty cycle each rectangular pulse is only at a positive
voltage for half of the bit period. This is ideal if one symbol is sent
much more often than the other and po*er considerations are
necessary, and also ma1es the signal self0cloc1ing.

Traditionally, a unipolar scheme *as designed as a non0return0to0


,ero &#$%' scheme, in *hich the positive voltage defines bit 1 and
the ,ero voltage defines bit 0. t is called #$% because the signal
does not return to ,ero at the middle of the bit.
coded mar$ in%ersion (+,I)

n telecommunication, coded mar$ in%ersion


(+,I) is a non0return0to0,ero &#$%' line code. t
encodes zero bits as a half bit time of ,ero
follo*ed by a half bit time of one, and *hile one
bits are encoded as a full bit time of a constant
level. The level used for one bits alternates each
time one is coded.

+,I doubles the bitstream frequency, *hen


compared to its simple #$% equivalent, but
allo*s easy and reliable cloc1 recovery.
+,I
Non Return To Zero (NRZ)
HDB3 substitution rules
+!B- Coding $ules
)olarity of the
preceding pulse
#umber of Bipolar &ones')ulses
since last substitution
5dd 6ven
0 0000 7007
7 0007 0000
MULTIPLEXIN TE!HNI"UE
Figure 4.1 Line coding
Figure 4.2 Signal level versus data level
Figure 4.3 DC component
Example 1
Example 1
A signal has two data levels with a pulse duration of 1
ms. We calculate the pulse rate and bit rate as follows:
Pulse Rate = 1/ 10
Pulse Rate = 1/ 10
-3 -3
= 1000 pulses/s
= 1000 pulses/s
Bit Rate = Pulse Rate x log
Bit Rate = Pulse Rate x log
2 2
L = 1000 x log
L = 1000 x log
2 2
2 = 1000 bps
2 = 1000 bps
Example 2
Example 2
A signal has four data levels with a pulse duration of 1
ms. We calculate the pulse rate and bit rate as follows:
Pulse Rate = = 1000 pulses/s
Pulse Rate = = 1000 pulses/s
Bit Rate = PulseRate x log
Bit Rate = PulseRate x log
2 2
L = 1000 x log
L = 1000 x log
2 2
4 = 2000 bps
4 = 2000 bps
Figure 4.4 Lack of synchronization
Example 3
Example 3
In a digital transmission, the receiver clock is 0.1 percent
faster than the sender clock. How many extra bits per
second does the receiver receive if the data rate is 1
Kbps? How many if the data rate is 1 Mbps?
Solution
Solution
At 1 Kbps:
1000 bits sent 1001 bits reei!e"1 extra bps
At 1 #bps:
1$000$000 bits sent 1$001$000 bits reei!e"1000 extra bps
Figure 4.5 Line coding schemes
nipolar encoding uses only one
voltage level!
%ote:
%ote:
Figure 4.6 nipolar encoding
"olar encoding uses t#o voltage levels
"olar encoding uses t#o voltage levels
$positive and negative%!
$positive and negative%!
%ote:
%ote:
Figure 4.7 &ypes of polar encoding
'n ()*+L the level of the signal is
'n ()*+L the level of the signal is
dependent upon the state of the ,it!
dependent upon the state of the ,it!
%ote:
%ote:
'n ()*+' the signal is inverted if a 1 is
'n ()*+' the signal is inverted if a 1 is
encountered!
encountered!
%ote:
%ote:
Figure 4.8 ()*+L and ()*+' encoding
Figure 4.9 )* encoding
- good encoded digital signal must
- good encoded digital signal must
contain a provision for
contain a provision for
synchronization!
synchronization!
%ote:
%ote:
Figure 4.10 .anchester encoding
'n .anchester encoding/ the
'n .anchester encoding/ the
transition at the middle of the ,it is
transition at the middle of the ,it is
used for ,oth synchronization and ,it
used for ,oth synchronization and ,it
representation!
representation!
%ote:
%ote:
Figure 4.11 Differential .anchester encoding
'n differential .anchester encoding/
'n differential .anchester encoding/
the transition at the middle of the ,it is
the transition at the middle of the ,it is
used only for synchronization!
used only for synchronization!
&he ,it representation is defined ,y the
&he ,it representation is defined ,y the
inversion or noninversion at the
inversion or noninversion at the
,eginning of the ,it!
,eginning of the ,it!
%ote:
%ote:
'n ,ipolar encoding/ #e use three
'n ,ipolar encoding/ #e use three
levels0 positive/ zero/
levels0 positive/ zero/
and negative!
and negative!
%ote:
%ote:
Figure 4.12 1ipolar -.' encoding
Figure 4.13 2112
Figure 4.14 .L&+3 signal

You might also like