AIT Associated Repository of Academic Resources >
A.研究報告 >
A1 愛知工業大学研究報告 >
3.愛知工業大学研究報告 .B(1976-2007) >
33号 >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11133/1054
|
Title: | 動的ハフマン符号を同期させた動的辞書法による1パスデータ圧縮 |
Other Titles: | ドウテキ ハフマン フゴウ オ ドウキサセタ ドウテキ ジショホウ ニヨル 1パス データ アッシュク A One-Pass Data Compression by Dynamic Dictionary Method Synchronized with Dynamic Huffman Codes |
Authors: | 伊藤, 雅 ITOH, Masaru |
Issue Date: | 31-Mar-1998 |
Publisher: | 愛知工業大学 |
Abstract: | This paper proposes a new data compression algorithm. In the dynamic dictionary method, when building the dictionary from an original file, a large number of single characters appear. Each character is usually put into a file with fixed-length bits. The performance of compression ratio can be improved by using the dynamic Huffman codes which is assigned to a part of this output procedure. The features of our algorithm are that it is a one-pass data compression and that it is reversible coding. It is necessary that both dictionary tree and dynamic Huffman tree must be synchronously updated, when encoding a sequential of characters from input file to output one. The algorithm utilizes LRU (Least Recently Used) queue for deleting a dictionary item when the dictionary is full. |
URI: | http://hdl.handle.net/11133/1054 |
Appears in Collections: | 33号
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|