CAJ | 학술논문

近年来，Bzip2压缩算法凭借其在压缩率方面的优势，得到了越来越多的应用，Bzip2的核心算法是Burrows-Wheeler变换(BWT), BWT能有效的将数据中相同的字符聚集到一起，为进一步压缩创造条件。在硬件实现 BWT 时，常用的基于后缀排序的算法能有效克服 BWT 消耗存储资源大的问题，该文对基于后缀排序实现BWT的方法进行了详细分析，并且在此基础上提出了一种快速实现BWT的方法后缀段算法。仿真结果表明后缀段算法在处理速度上比传统的基于后缀排序的算法有很大的提高。
근년래，Bzip2압축산법빙차기재압축솔방면적우세，득도료월래월다적응용，Bzip2적핵심산법시Burrows-Wheeler변환(BWT), BWT능유효적장수거중상동적자부취집도일기，위진일보압축창조조건。재경건실현 BWT 시，상용적기우후철배서적산법능유효극복 BWT 소모존저자원대적문제，해문대기우후철배서실현BWT적방법진행료상세분석，병차재차기출상제출료일충쾌속실현BWT적방법후철단산법。방진결과표명후철단산법재처리속도상비전통적기우후철배서적산법유흔대적제고。
Bzip2, a lossless compression algorithm, is widely used in recent years because of its high compression ratio. Burrows-Wheeler Transform (BWT) is the key factor in Bzip2. This method can gather the same symbols together. The traditional methods which are based on suffix sorting used in implement of BWT in hardware can solve the problem of memory consumption effectively. Detail analysis of BWT algorithm based on suffix sorting is given and a new methodSuffix segment method is presented in this paper. Experimental results show that the proposed method can much decrease BWT time consumption without increasing memory consumption much.