2010 · 17 citations · 11 references
EngineeringComputer EngineeringComputer ScienceData StructuresField-programmable Gate ArraysReconfigurable ComputingCoding TheoryData CompressionField-programmable Gate Array ArchitectureFpga ArchitectureHardware AccelerationLossy Data CompressionBurrows-wheeler TransformCompressionCompression AlgorithmsCompression TechniquesField-programmable Gate Arrays (Fpgas)Transform
Nowadays, data compression is used in nearly every field of digital applications. Many efforts have been taken to improve the theory of compression algorithms, albeit these approaches are mostly suitable for software implementation. Hardware implementations are sometimes suggested, but in general rarely found. Many approaches rely on some kind of LZ-method, which are generally fast but lack compression rate. This paper focuses on the Burrows-Wheeler Transform (BWT) as it is becoming increasingly important through the many benefits it provides and potentially even more so, if implemented in hardware. Two methods of the forward transform are compared and tested at realistic block sizes. Furthermore a implementation of a bzip2 compression system for Field programmable gate arrays (FPGAs) is described.
11
The Art of Computer Programming
G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations
An analysis of the Burrows—Wheeler transform
Giovanni Manzini · Journal of the ACM · 2001 · 372 citations
A fast block-sorting algorithm for lossless data compression
Maike Schindler · 1997 · 91 citations