{"title":"高速数据压缩的并行算法","authors":"W. Penzhorn","doi":"10.1109/COMSIG.1992.274290","DOIUrl":null,"url":null,"abstract":"The Lempel-Ziv algorithm is a very efficient universal data compression technique, based upon an incremental parsing technique which maintains codebooks of parsed phrases at the transmitter and at the receiver. In an attempt to increase speed the algorithm has been parallelised to run on two processors. This requires the maintaining of two independent sets of codebooks. The algorithm was applied to the compression of various text files, and graphs illustrating these results are included.<<ETX>>","PeriodicalId":342857,"journal":{"name":"Proceedings of the 1992 South African Symposium on Communications and Signal Processing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A parallel algorithm for high-speed data compression\",\"authors\":\"W. Penzhorn\",\"doi\":\"10.1109/COMSIG.1992.274290\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Lempel-Ziv algorithm is a very efficient universal data compression technique, based upon an incremental parsing technique which maintains codebooks of parsed phrases at the transmitter and at the receiver. In an attempt to increase speed the algorithm has been parallelised to run on two processors. This requires the maintaining of two independent sets of codebooks. The algorithm was applied to the compression of various text files, and graphs illustrating these results are included.<<ETX>>\",\"PeriodicalId\":342857,\"journal\":{\"name\":\"Proceedings of the 1992 South African Symposium on Communications and Signal Processing\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1992 South African Symposium on Communications and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSIG.1992.274290\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1992 South African Symposium on Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSIG.1992.274290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A parallel algorithm for high-speed data compression
The Lempel-Ziv algorithm is a very efficient universal data compression technique, based upon an incremental parsing technique which maintains codebooks of parsed phrases at the transmitter and at the receiver. In an attempt to increase speed the algorithm has been parallelised to run on two processors. This requires the maintaining of two independent sets of codebooks. The algorithm was applied to the compression of various text files, and graphs illustrating these results are included.<>