• search hit 33 of 35
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://ieeexplore.ieee.org/document/8613180
DOI:https://doi.org/10.1049/iet-cds.2017.0496
ISSN:1751-8598
Parent Title (English):IET Circuits, Devices & Systems
Volume:13
Document Type:Article
Language:English
Year of Publication:2019
Release Date:2018/12/21
Issue:1
First Page:31
Last Page:38
Note:
Volltextzugriff für Angehörige der Hochschule Konstanz via Datenbank IEEE Xplore möglich.
Institutes:Institut für Systemdynamik - ISD
Relevance:Peer reviewed Publikation in Thomson-Reuters-Listung
Open Access?:Nein
Licence (English):License LogoLizenzbedingungen IEEE