Pipelined decoder for the limited context order Burrows–Wheeler transformation

The Burrows–Wheeler transformation (BWT) is a reversible block sorting transform that is an integral part of many data compression algorithms. This work proposes a memory-efficient pipelined decoder for the BWT. In particular, the authors consider the limited context order BWT that has low memory re...

Full description

Saved in:

Bibliographic Details
Published in:	IET circuits, devices & systems Vol. 13; no. 1; pp. 31 - 38
Main Authors:	Safieh, Malek, Freudenberger, Jürgen
Format:	Journal Article
Language:	English
Published:	Stevenage The Institution of Engineering and Technology 01.01.2019 John Wiley & Sons, Inc
Subjects:	Algorithms Burrows-Wheeler transform Coding Context Data compression data compression algorithms Decoding fast encoding fast inverse BWT Field programmable gate arrays inverse transforms limited context order Burrows–Wheeler transformation limited context order BWT decoding memory-efficient pipelined decoder pipelined decoder Research Article reversible block sorting transform sorting Sorting algorithms pipelined decoder data compression memory-efficient pipelined decoder limited context order BWT decoding fast encoding sorting limited context order Burrows–Wheeler transformation reversible block sorting transform inverse transforms data compression algorithms fast inverse BWT decoding
ISSN:	1751-858X, 1751-8598, 1751-8598
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!