Research Article
Fast Algorithm of Truncated Burrows-Wheeler Transform Coding for Data Compression of Sensors
Table 1
Comparison of typical BWT algorithms.
| BWT algorithm | Software | Time complexity | Space complexity | Memory usage | Advantages | Weaknesses |
| Traditional BWT | bzip2 | O(N2lbN) | O(N) | 2.5N | Simple for general usage | Small block size; low compression ratio; weak big data support | BWT with SA-IS | BWA | O(N) | O(N) | 5.37N | Well known fastest standard BWT | Slower encoding than CZ-BWT; complex implementation; difficult hardware design | BWT with GSACA | GitHub: gsaca | O(N) | O(N) | 16N | The first linear nonrecursive SA algorithm for BWT | Slower encoding and more memory consumption than SA-IS and CZ-BWT | CZ-BWT | ComZip | O(N) | O(N) | 4N | Faster than BWT with SA-IS; simple hardware design | Slower decoding than standard BWT; need larger block size for higher compression ratio |
|
|