Adaptive variable-to-variable length codes
P.R. Stubley · 2002
In the last several years, adaptive codes for fixed-to-variable length and variable-to-fixed length codes have been described. This paper examines two methods for implementing adaptive variable-to-variable length codes, which have not been considered before due to the difficulty of designing optimum variable-to-variable length codes. The two adaptive methods are based on dual-tree codes, where a source tree parses the input sequence into source words and a code tree assigns each source word a code word. One adaptive method uses a single dual-tree code, and uses an algorithm which requires a complex logic circuit to adjust the shape of the source and code trees. The second method, called state-tree codes, uses a fixed pool of dual-tree codes and a state machine to select which dual-tree code is used. State-tree codes require more memory than the first method, but only a trivial logic circuit is needed to implement the codes, which will result in a very fast circuit.>
Cited by 5 works. doi:10.1109/dcc.1994.305917
Authors
References
- A Method for the Construction of Minimum-Redundancy Codes
- An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder
- Synthesis of noiseless compression codes
- On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
- Variable-length-to-variable length source coding: a greedy step-by-step algorithm
- Divergence and the construction of variable-to-variable-length lossless codes by source-word extensions
- Multialphabet arithmetic coding at 16 MBytes/sec