A new approach (designed to lower computational complexity) to compression of finite binary data, based on the application of “exclusive-or” operation, is presented in the paper. The new concept of an identifying sequence, associated with a particular decomposition scheme, is introduced. A new heuristic algorithm for calculation of the identifying sequences has been developed. Two robust algorithms – for compressing and streaming the sequences (using a priori compiled decomposition tables), and for real time decoding of the compressed streams – were proposed and implemented. The experimental results confirmed that the developed approach gave a data compression effect on an ordinary computer system.
| Identifer | oai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2005~D_20050113_155133-50925 |
| Date | 13 January 2005 |
| Creators | Smolinskas, Mindaugas |
| Contributors | Stulpinas, Raimundas, Targamadzė, Aleksandras, Butleris, Rimantas, Matickas, Jonas Kazimieras, Lenkevičius, Antanas, Kiauleikis, Valentinas, Paradauskas, Bronius, Plukas, Kostas, Valantinas, Jonas, Rubliauskas, Dalius, Kaunas University of Technology |
| Publisher | Lithuanian Academic Libraries Network (LABT), Kaunas University of Technology |
| Source Sets | Lithuanian ETD submission system |
| Language | Lithuanian |
| Detected Language | English |
| Type | Master thesis |
| Format | application/pdf |
| Source | http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050113_155133-50925 |
| Rights | Unrestricted |
Page generated in 0.002 seconds