A Simulation for Real Time Data Compression

  • Authors:
  • Toan L. P. Pham

  • Affiliations:
  • -

  • Venue:
  • ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents one new basic step in real time data compression. The data under compression are random sequence of variable Y which at time t: y0, y1,..., yt have occurred. Y - random integer - {0, 1, N-1}. So, at time t, if we produce YA to be really a subset to Y so that yt+1 in YA then we can write or send the index of yt+1 in YA instead of yt+1 . To do it we create a function F, which learned from some recent past Y by the fixed rules, to map a known set onto Y. The known set is the set known by both sender and receiver, and the function F is automatically created the same at both sides.Based on this scheme we roughly developed and experienced an algorithm for many segments of .com or .exe file (MS DOS File Format) in 80x86 systems to see we have compression ratio 10:7,10:4 in real time. (The segment of pure codes not including data).