• search hit 8 of 19
Back to Result List

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 requirements and enable fast encoding. However, the decoding of the limited context order BWT is typically much slower than the encoding. The proposed decoder pipeline provides a fast inverse BWT by splitting the decoding into several processing stages which are executed in parallel.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Malek Safieh, Jürgen FreudenbergerORCiDGND
URL:https://digital-library.theiet.org/content/journals/10.1049/iet-cds.2017.0496
DOI:https://doi.org/10.1049/iet-cds.2017.0496
ISSN:1751-8598
Parent Title (English):IET Circuits, Devices & Systems
Document Type:Article
Language:English
Year of Publication:2018
Release Date:2018/12/21
First Page:1
Last Page:8
Institutes:Institut für Systemdynamik - ISD
Open Access?:Nein
Relevance:Peer reviewed Publikation in Thomson-Reuters-Listung