Font Size: a A A

Design And Implementation Of Parallel Compression Algorithm Based On Approximate Pattern Matching

Posted on:2021-03-20Degree:MasterType:Thesis
Country:ChinaCandidate:A R WangFull Text:PDF
GTID:2428330629452669Subject:Computer system architecture
Abstract/Summary:PDF Full Text Request
With the rapid development of Internet technologies,the storage and transmission of network data is facing severe challenges.The improvement of data processing algorithms is also difficult.Data compression is widely used as the basis technology of others.Compression with high performance is a very significant topic in solving the application problems of data.In this paper,we propose a novel text compression algorithm-parallel compression algorithm based on approximate pattern matching.The new algorithm reduces the compression rate of the code on the basis of parallel performance.In this paper,two important parts of the algorithm are studied in detail: the parallel e PLZ77 algorithm to remove redundancy and the parallel Varint algorithm to encode.The first part of the work is to propose parallel ePLZ77 compression coding.The e PLZ77 compression coding is different from the exact matching function which used in the original LZ77 algorithm.The new algorithm introduces an approximate pattern matching function and combines the parallel LZ77 algorithm to remove redundant of the source data.The concept of "approximate pattern matching function" means that to enable an unencoded string to match a longer encoded string on the original basis,characters can be restored,deleted,replaced or exchanged.The parallel e PLZ77 algorithm reduces the compression rate based on the traditional parallel LZ77 algorithm.Innovation: Combining the concept of approximate pattern matching with data compression algorithms to reduce the compression rate of LZ77 encoding.The second part of the work is to combine the parallel compression algorithm of e PLZ77 with the parallel Varint coding algorithm.Realize a complete parallel compression algorithm flow based on approximate pattern matching.Innovation: The algorithm is overall parallel and has a faster compression speed.The new algorithm has certain advantages in compression rate and compression time.In order to verify the performance of the new algorithm,this paper uses multiple sets of comparative experiments to evaluate the algorithm.The existing serial LZ77 algorithm,Deflate algorithm and improved e PLZ77_Varint algorithm are used to compare the compression rate and compression time.In compression performance,the compression rate of e PLZ77 algorithm is completely better than the traditional LZ77 algorithm.In terms of time performance,compared with existing serial algorithms,the parallel implementation have higher speed on compression.Experimental results show that the new algorithm has good practical performance and application performance.
Keywords/Search Tags:Compression Algorithm, Parallel Coding, LZ77 Coding, Varint Coding
PDF Full Text Request
Related items