keywords:"Move-to-front transformace" - Search Results - Digital Repository

guest :: login Digital Repository
		Search		Submit		Help		About

Home > Search Results: keywords:"Move-to-front transformace"

Search:

Search Tips :: Advanced Search

Search collections:

Sort by:	Display results:	Output format:

	Acceleration of Data Compression Algorithms on Sony PS3 Platform Breitenbacher, Dominik ; Jaroš, Jiří (referee) ; Šimek, Václav (advisor) This paper presents the use of PlayStation 3 device for accelerating compression algorithms and tries to show the potencial of PlayStation 3 for use on these tasks. For a demonstration was selected compression method based on the Burrows-Wheeler transformation. The output of the transformation is further transformed by using the Move-To-Front transformation and subsequently encoded by the static Huffman encoding. The compression algorithm has been called PS3BWT. It performs compression by using each of tasks and tries to always use the maximum number of avaible processor units, so the compression is carried out as quickly as possible. Detailed record
	Acceleration of Data Compression Algorithms on Sony PS3 Platform Breitenbacher, Dominik ; Jaroš, Jiří (referee) ; Šimek, Václav (advisor) This paper presents the use of PlayStation 3 device for accelerating compression algorithms and tries to show the potencial of PlayStation 3 for use on these tasks. For a demonstration was selected compression method based on the Burrows-Wheeler transformation. The output of the transformation is further transformed by using the Move-To-Front transformation and subsequently encoded by the static Huffman encoding. The compression algorithm has been called PS3BWT. It performs compression by using each of tasks and tries to always use the maximum number of avaible processor units, so the compression is carried out as quickly as possible. Detailed record
	Utilization of Burrows-Wheeler Transformation for Data Compression Sokl, Karel ; Tříska, Vít (referee) ; Košař, Vlastimil (advisor) Everyone can get into a situation when it is necessary to reduce the size of some file. For that purpose there are many compress algorithms. But how to choose the right one? In this work is tested efficiency of some of lossless compression algorithms focusing on Burrows-Wheeler transform. Then results are compared with the program bzip2. Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.

Digital Repository :: :: :: ::
Powered by v1.1.2
Maintained by

This site is also available in the following languages:
Česky English