%0 Electronic Article %A Malek Safieh %A Jürgen Freudenberger %K reversible block sorting transform %K data compression algorithms %K limited context order Burrows–Wheeler transformation %K memory-efficient pipelined decoder %K fast encoding %K fast inverse BWT %K pipelined decoder %K limited context order BWT decoding %X 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. %@ 1751-858X %T Pipelined decoder for the limited context order Burrows–Wheeler transformation %B IET Circuits, Devices & Systems %D January 2019 %V 13 %N 1 %P 31-38 %I Institution of Engineering and Technology %U https://digital-library.theiet.org/;jsessionid=78k9f6hkihd5t.x-iet-live-01content/journals/10.1049/iet-cds.2017.0496 %G EN