|
|
|
| A Fast Algorithm for Burrows-Wheeler Transform Using Suffix Sorting |
| Li Bing Long Bing-jie Liu Yong |
| (College of Integrated Circuit, Southeast University, Nanjing 210000, China) |
|
|
|
|
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.
|
|
Received: 24 February 2014
|
|
|
|
Corresponding Authors:
Long Bing-jie
E-mail: longbj1107@sinacom
|
|
|
|
|
|
|
2015, Vol. 37 
