Low-Complexity Waveform Coding via Alphabet and Sample-Set Partitioning
نویسندگان
چکیده
We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than rst order entropy even with fast Hu man adaptive codecs. Numerical results with its application for lossy and lossless image compression show the e cacy of the new method, comparable to the best known methods.
منابع مشابه
Optimal Alphabet Partitioning for Semi-Adaptive Coding
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each layer. In this paper we formulate the problem of optimal alphabet partitioning for the design of a two layer semi-adaptive code and give a solution based on dynamic programming. However, the complexity...
متن کاملAlphabet Partitioning Techniques for Semi-Adaptive Huffman Coding of Large Alphabets Alphabet Partitioning Techniques for Semi-Adaptive Huffman Coding of Large Alphabets∗
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each layer. In this paper, we formulate the problem of finding an alphabet partitioning for the design of a two-layer semi-adaptive code as an optimization problem, and give a solution based on dynamic prog...
متن کاملA novel 2kb/s waveform interpolation speech coder based on non-negative matrix factorization
In this paper, a 2kb/s Waveform Interpolation speech coder is proposed based on non-negative matrix factorization (NMF). In characteristic waveforms (CWs) decomposition, band-partitioning initialization constraints were set to basis vectors before NMF was carried out. This decomposition method only requires speech signal from the current frame, and can yield high decomposition quality with low ...
متن کاملOptimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each layer. In this paper we formulate the problem of optimal alphabet partitioning for the design of a two layer semiadaptive code and give a solution based on dynamic programming. However, the complexity ...
متن کاملProbability Interval Partitioning Entropy Codes
A novel approach to entropy coding is described that provides the coding efficiency and simple probability modeling capability of arithmetic coding at the complexity level of Huffman coding. The key element of the proposed approach is given by a partitioning of the unit interval into a small set of disjoint probability intervals for pipelining the coding process along the probability estimates ...
متن کامل