Title

Low-complexity two instructions set computer for suffix sort in burrow wheeler transform

Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Faculty of Health, Engineering and Science

School

School of Engineering

RAS ID

16487

Comments

This article was originally published as: Kong, J.H., Ang, L.M. & Seng, K.P. Low-complexity two instructions set computer for suffix sort in burrow wheeler transform (2013). In International Conference on Advanced Computer Science Applications and Technologies (ACSAT) (pp. 181-186). Los Alamitos, CA : IEEE Computer Society. Original article available here

Abstract

The Burrow Wheelers Transform (also called the block sorting compression) was referred to as the jewel loss less compression due its effectiveness and is used as the core algorithm in bzip2 compressor. With much attention given, hardware realization of the BWT algorithm has been limited due to the complexity of suffix sorting computation. Given the small hardware-footprint design trend, we propose the use of a reconfigurable FPGA platform and unified computer architecture with minimal hardware components. In this paper, we are presenting a low-complexity two instructions set computer architecture (TISC) for the lexicographical sorting in Burrow Wheelers Transform. The proposed architecture has been implemented and tested using the DK Design Suite software environment, which provides a Handel-C Hardware Descriptive language to ease the design process. A Celoxica RC10 board which houses the Spartan 3 XCS1500L-4 FPGA is used.

DOI

10.1109/ACSAT.2012.61

Access Rights

Not open access

Share

 
COinS