Line Encoder, Scrambler &

Decoder
Name: Abhay Garg (2020BITE041)
Dhananjay Mahajan(2020BITE033)
Pranav Sanotra(2020BITE006)
Submitted to : Dr Iqra Altaf Gilani

1 | Introduction

Line encoding is the process of converting digital data to digital signals and decoding is the process
of converting digital signals into digital data.
The Line encoding schemes and scrambling techniques implemented in this project are:
− N RZ − L
→ − N RZ − I
→ − M anchester
→ − Dif f erentialM anchester
→ − AM I
→

− HDB3
→ − B8ZS
→

2 | Implementation

I have plotted the digital signal With the help of graphics library of Python and implemented the
logicbehind encoding schemes using Python & Matplotlib.

3 | Instructions to run the program

If not already installed, install the Graphics Header file. On running the program, it prompts user to
choose the number of bits to be encoded, choose then it asks the user whether it wants a random or
fixed sequence, If fixed sequence is chosen then it asks the user for the number of bits to be fixed(ie. 4
or 8), After this it will show the data string generated and the longest palindromic subsequence.
Now it asks for the Choice of encoding.

Now the Graph will be shown on the basis of the encoding chosen. When the graph prompt
window is closed it asks the user if decoding is required. Now it generates the decoded data and
finally asks if the process is to be repeated otherwise it exits the code
We would like to thank my Data Communication instructor, Dr. Iqra Altaf Gillani for guiding me to
achallenging project that required a lot of brainstorming and data management. The knowledge and
data provided by her during the class sessions was highly helpful besides the study material available on
various websites. I could successfully complete this project before time.

4 | Assumptions & Limitations

1. The graph extends from -1 & 1.

2. All the endcoding techniques use positive logic except from Manchester and differential
Manchester ie. They use negative logic (GE Thomas).

5 | References
Leetcode – For Palindromic Subsequence ie. Manacher Algorithm O(n).