Document Type
Thesis
Date of Award
5-31-1987
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical Engineering
First Advisor
Yeheskel Bar-Ness
Second Advisor
Sol Rosenstark
Third Advisor
Jacob Klapper
Abstract
Generally it is difficult to compress data, from statistically unknown sources, with significant compression ratio. To achieve this, the compression scheme should have an ability to gather context information of the source, adaptively. For better compression, it is desirable to separate the context gathering scheme from coding itself. Arithmetic code is very flexible and can accept any kind of context gathering scheme which can generate probabilities. One context gathering algorithm which generates Markov type probability adaptively is studied and implemented in software using Arithmetic code. This scheme performs well and results in compression ratio better than any existing algorithms such as the Lempel-Ziv algorithm.
Recommended Citation
Choi, Seokrim, "A data compression system using arithmetic code" (1987). Theses. 3088.
https://digitalcommons.njit.edu/theses/3088
