Weimin Wu, Huijiang Guo, Hu Yi, Jingbao Fan, Wang Huan
{"title":"改进的Deflate算法","authors":"Weimin Wu, Huijiang Guo, Hu Yi, Jingbao Fan, Wang Huan","doi":"10.1109/ICIEA.2008.4582783","DOIUrl":null,"url":null,"abstract":"The Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to tThe Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to the rapid increase of the data.he rapid increase of the data.","PeriodicalId":309894,"journal":{"name":"2008 3rd IEEE Conference on Industrial Electronics and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Improvable Deflate Algorithm\",\"authors\":\"Weimin Wu, Huijiang Guo, Hu Yi, Jingbao Fan, Wang Huan\",\"doi\":\"10.1109/ICIEA.2008.4582783\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to tThe Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to the rapid increase of the data.he rapid increase of the data.\",\"PeriodicalId\":309894,\"journal\":{\"name\":\"2008 3rd IEEE Conference on Industrial Electronics and Applications\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 3rd IEEE Conference on Industrial Electronics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIEA.2008.4582783\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 3rd IEEE Conference on Industrial Electronics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEA.2008.4582783","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to tThe Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to the rapid increase of the data.he rapid increase of the data.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
