Results 1 
4 of
4
Universal Lossless Source Coding With the Burrows Wheeler Transform
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2002
"... The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless sourcecoding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWTbased compression schemes ar ..."
Abstract

Cited by 44 (4 self)
 Add to MetaCart
(Show Context)
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless sourcecoding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWTbased compression schemes are widely touted as lowcomplexity algorithms giving lossless coding rates better than those of the ZivLempel codes (commonly known as LZ'77 and LZ'78) and almost as good as those achieved by prediction by partial matching (PPM) algorithms. To date, the coding performance claims have been made primarily on the basis of experimental results. This work gives a theoretical evaluation of BWTbased coding. The main results of this theoretical evaluation include: 1) statistical characterizations of the BWT output on both finite strings and sequences of length , 2) a variety of very simple new techniques for BWTbased lossless source coding, and 3) proofs of the universality and bounds on the rates of convergence of both new and existing BWTbased codes for finitememory and stationary ergodic sources. The end result is a theoretical justification and validation of the experimentally derived conclusions: BWTbased lossless source codes achieve universal lossless coding performance that converges to the optimal coding performance more quickly than the rate of convergence observed in ZivLempel style codes and, for some BWTbased codes, within a constant factor of the optimal rate of convergence for finitememory sources.
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Fountain Codes for Lossless Data Compression
"... Abstract. This paper proposes a universal variablelength lossless compression algorithm based on fountain codes. The compressor concatenates the BurrowsWheeler block sorting transform (BWT) with a fountain encoder, together with the closedloop iterative doping algorithm. The decompressor uses a B ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. This paper proposes a universal variablelength lossless compression algorithm based on fountain codes. The compressor concatenates the BurrowsWheeler block sorting transform (BWT) with a fountain encoder, together with the closedloop iterative doping algorithm. The decompressor uses a Belief Propagation algorithm in conjunction with the iterative doping algorithm and the inverse BWT. Lineartime compression/decompression complexity and competitive performance with respect to stateoftheart compression algorithms are achieved. 1.
Turbo Joint SourceChannel Coding of CycleStationary Sources in the BandwidthLimited Regime
"... Abstract. In this paper we propose a novel onelayer coding/shaping transmission system for the bandwidthlimited regime based on singlelevel codes and sigmamapping [1]. Specifically, we focus on cyclestationary information sources with independent symbols. High spectral efficiencies can be achi ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we propose a novel onelayer coding/shaping transmission system for the bandwidthlimited regime based on singlelevel codes and sigmamapping [1]. Specifically, we focus on cyclestationary information sources with independent symbols. High spectral efficiencies can be achieved by combine at the transmitter a Turbo code with a sigmamapper. Furthermore, the encoded symbols are modulated by using an asymmetric energy allocation technique before entering the aforementioned sigmamapper. The corresponding decoder iterates between the Turbo decoder and the sigmademapper, which exchange progressively refined extrinsic probabilities of the encoded symbols. For the Additive White Gaussian Noise (AWGN) channel, simulation results obtained for very simple Turbo codes show that the proposed system attains low bit error rates at signaltonoise ratios relatively close to the corresponding Shannon limit. These promising results pave the way for future investigations towards reducing the aforementioned energy gap, e.g. by utilizing more powerful Turbo codes.