Data encryption & comp 2
Data encryption & comp 2
But soft, what light through yonder window Step1: Make an intelligent dictionary
breaks?
Step2: Encode the input text data
It is the East, and Iuliet is the Sunne,
Arise faire Sun and kill the enuious The entire process can be summerised as follows.
Moone,
2.1 Encoding Algorithm
Who is already sicke and pale with griefe,
Start encode with argument input file inp
That thou her Maid art far more faire then
A. Read the dictionary and store all words and their codes in a
she
table
Running this text through the star-encoder yields the following
text: B . While inp is not empty
1.Read the characters from inp and form tokens.
B** *of*, **a* **g** *****g* ***d*r ***do*
b*e***? 2. If the token is longer than 1 character, then
It *s *** E**t, **d ***i** *s *** *u**e, 1.Search for the token in the table
End (While)
û©û!ü%;ûNü'Œû!ü"ƒû"û!û˜ÿ. û*û!û˜û5ü"8ü"}ÿ, û"ü2Óÿ;
C. Stop. û"ü%Lû5ûYû!ü"nû#û!ü&“ÿ.
û*û!ü%Ìû#ûNü&ÇûYû!ü"nû#û!ü#Éÿ.
2.2. Dictionary Making Algorithm
û*ûNûAÿ, ü"¿û]û.ü"’ÿ: û"û]û5ü"’ÿ.
Start MakeDict with multiple source files as input
û*ûNü"Qû!ü"’ÿ, û'û1û5û²ÿ: û"ûNü(Rû!ü"’û;û!ü%Lÿ.
1. Extract all words from input files.
û*ûNûóû!ü"’ü%…ÿ, û"û!ü%Lû-ûóü9[ÿ.
2. If a word is already in the table increment the û*û!ü'·û"û!ü#¹ûSû!ûºûvÿ.
number of occurrence by 1, otherwise add it to the
table and set the number occurrence to 1. û*ûNû‚û!ü6 ÿ,
û"ü(Rû!ü#Éû:ûSü"2û!ü6 û;û!ü#Éû:ûSü"‚û!ü6 ÿ: û"û1û5ûeÿ.
3. Sort the table by frequency of occurrences in
descending order. û*ûNûóû!ü6•ü#Wÿ. û*û!ü'·û"û!ü#¹ûSû!ü"ßûvÿ
3. PERFORMANCE ANALYSIS
Calgary corpuses
The performance issues such as Bits Per Character (BPC) and
conversion time are compared for the three cases i.e., simple File File BWT BWT with BWT with
BWT, BWT with Star encoding and BWT with Intelligent Names size *Encode IDBE
Dictionary Based Encoding (IDBE). The results are shown
graphically and prove that BWT with IDBE out performs all Kb BPC Time BPC Time BPC Time
other techniques in compression ratio, speed of compression
(conversion time) and have higher level of security.
bib 108.7 2.11 1 1.93 6 1.69 4
Fig.1.0: BPC & Conversion time comparison of transform
with BWT, BWT with *Encoding and BWT with IDBE for book1 750.8 2.85 11 2.74 18 2.36 11
3. REFERENCES
1. M. Burrows and D. J. Wheeler. “A Block-sorting
Lossless Data Compression Algorithm”, SRC
Research Report 124, Digital Systems Research
Cente
alice29.txt 148.5 2.45 3 2.39 6 2.11 4 6 T. Welch, “A Technique for High-Performance Data
Compression”, IEEE Computer, Vol. 17, No. 6,
Asyoulik.txt 122.2 2.72 2 2.61 7 2.32 4 1984.
cp.html 24.0 2.6 1 2.27 4 2.13 3 7 R. Franceschini, H. Kurse, N. Zhang, R. Iqbal and A.
Mukherjee, “Lossless, Reversible Transformations
fields.c 10.9 2.35 0 2.20 4 2.06 3
that Improve Text Compression Ratios”, submitted
grammar.lsp 3.60 2.88 0 2.67 4 2.44 3 to IEEE Transactions on Multimedia Systems (June
2000).
kennedy.xls 1005. 0.81 10 0.82 17 0.98 17
6 8 F. Awan, and A. Mukherjee, “LIPT: A losskess Text
Transform to Improve Compression”, Proceedings of
Icet10.txt 416.8 2.38 7 2.25 12 1.87 7 International Conference on Information and
plrabn12.txt 470.6 2.80 10 2.69 13 2.30 8
Theory: Coding and computing, IEEE Computer
Society, Las Vegas Nevada, April 2001.
ptt5 501.2 0.85 27 0.85 33 0.86 31
9. N. Motgi and A. Mukherjee, “Network Conscious
sum 37.3 2.80 2 2.75 4 2.89 4 Text Compression Systems (NCTCSys)”,
Proceedings of International Conference on
xrgs.1 4.1 3.51 1 3.32 4 2.93 2
Information and Theory: Coding aand Computing,
IEEE Computer Society, Las Vegas Nevada, April
2001.