open access

https://hdl.handle.net/2115/46943

An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree

英語

2010-03-24

IEEE

2010 Data Compression Conference (DCC)

219-228

Almost Instantaneous VF code proposed by Yamamoto and Yokoo in 2001, which is one of the variable-length-to-fixed-length codes, uses a set of parse trees and achieves a good compression ratio. However, it needs much time and space for both encoding and decoding than an ordinary VF code does. In this paper, we proved that we can multiplex the set of parse trees into a compact single tree and simulate the original encoding and decoding procedures. Our technique reduces the total number of nodes into O(2ℓk - k2), while it is originally O(2ℓk), where ℓ and k are the codeword length and the alphabet size, respectively. The experimental results showed that we could encode and decode over three times faster for natural language texts by using this technique.

会議発表論文

Accepted Manuscript

© 2010 IEEE. Reprinted, with permission, from Yoshida, S., Kida, T., An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree, 2010 Data Compression Conference (DCC), Mar. 2010. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Hokkaido University products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

1068-0314