一种基于后缀排序快速实现Burrows-Wheeler变换的方法
doi: 10.11999/JEIT140232
A Fast Algorithm for Burrows-Wheeler Transform Using Suffix Sorting
-
摘要: 近年来，Bzip2压缩算法凭借其在压缩率方面的优势，得到了越来越多的应用，Bzip2的核心算法是Burrows-Wheeler变换(BWT), BWT能有效的将数据中相同的字符聚集到一起，为进一步压缩创造条件。在硬件实现BWT时，常用的基于后缀排序的算法能有效克服BWT消耗存储资源大的问题，该文对基于后缀排序实现BWT的方法进行了详细分析，并且在此基础上提出了一种快速实现BWT的方法后缀段算法。仿真结果表明后缀段算法在处理速度上比传统的基于后缀排序的算法有很大的提高。
-
关键词:
- 信号处理 /
- 数据压缩 /
- Bzip2 /
- Burrows-Wheeler变换 /
- 后缀排序
Abstract: 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.-
Key words:
- Information processing /
- Data compress /
- Bzip2 /
- Burrows-Wheeler Transform (BWT) /
- Suffix sorting
-
计量
- 文章访问数: 1916
- HTML全文浏览量: 104
- PDF下载量: 1207
- 被引次数: 0
下载:
