{"title":"面向高速数据压缩的前移和转置混合并行架构","authors":"J. Myoupo, A. Wabbi","doi":"10.1109/PCCC.2000.830303","DOIUrl":null,"url":null,"abstract":"We give linear systolic array architectures for self organising linear lists using two hybrids schemes of move-to-front and transpose heuristics, attempting to incorporate the best of both methodologies. The arrays provide input every clock cycle and have a number of processors equal to the length of the list n. This design is then implemented to build high-speed lossless data compression hardware for data communication and storage that have high compression ratio for both small and large files.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Move-to-front and transpose hybrid parallel architectures for high-speed data compression\",\"authors\":\"J. Myoupo, A. Wabbi\",\"doi\":\"10.1109/PCCC.2000.830303\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give linear systolic array architectures for self organising linear lists using two hybrids schemes of move-to-front and transpose heuristics, attempting to incorporate the best of both methodologies. The arrays provide input every clock cycle and have a number of processors equal to the length of the list n. This design is then implemented to build high-speed lossless data compression hardware for data communication and storage that have high compression ratio for both small and large files.\",\"PeriodicalId\":387201,\"journal\":{\"name\":\"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2000.830303\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2000.830303","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Move-to-front and transpose hybrid parallel architectures for high-speed data compression
We give linear systolic array architectures for self organising linear lists using two hybrids schemes of move-to-front and transpose heuristics, attempting to incorporate the best of both methodologies. The arrays provide input every clock cycle and have a number of processors equal to the length of the list n. This design is then implemented to build high-speed lossless data compression hardware for data communication and storage that have high compression ratio for both small and large files.