© 1993 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
A New Locally Adaptive Data Compression Scheme using Multilist Structure
Graduate School of Resources Management, National Defence Management College, PO Box 90046-17, Chung-Ho, Taipei, Taiwan, China
A new locally adaptive data compression scheme has been proposed in this paper. The proposed scheme may be viewed as an extension of the previous work by Bentley et al. in 1986. It is developed by the application of multilist structure and separate treatments for different types of data. Improving the overall performance of the method provided by Bentley et al. is its objective. The multilist structure aids in shortening the length of a transmitted code word and the treatment of numeric data aids in compression effect improvement. The feasibility of the proposed scheme has been validated by several experimental results and some theoretic analyses. The availability of various prefix coding methods developed by Järnvall have finally been tested here. The incorporation of G1 prefix code in the proposed compression scheme works well in performance promotion.
Received January 25, 1992. revised January 15, 1993.
* Graduate School of Resources Management, National Defense Management College, PO Box 90046-17, Chung-Ho, Taipei, Taiwan, ROC