Huffman Compression Map Updates for Faster Character Table Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional techniques for compressing and generating character component tables are inefficient due to the lack of integration between the compression process and character component table generation, leading to increased processing time when dealing with large numbers of document files.
Innovation Solution
A non-transitory computer-readable medium stores an information processing program that uses a Huffman tree to compress character codes by converting them into compression symbols, with a compression symbol map group indicating the presence or absence of character codes in files, and updates bit strings to optimize the compression process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If compression process and character component table generation process are executed separately, then each process can be performed independently, but the processing time is increased
Solution Approach 1:
The patent merges the compression process and character component table generation process into a single integrated operation. During file compression using the Huffman tree, the system simultaneously generates the character component table by collecting character code information from the compressed data, eliminating the need for separate execution of these processes and reducing total processing time.
Solution Approach 2:
The patent enables continuous useful action by performing character component table generation during the compression process itself. Rather than completing compression first and then separately generating the table, the system continuously accumulates character code information throughout compression, ensuring that both tasks progress simultaneously without idle time.
2Adaptability or versatility
If 64,000 kinds of character codes are used for content configured by a huge number of document files, then comprehensive character coverage is achieved, but the character component table size and processing complexity increase
Solution Approach 1:
The patent segments the character code processing by organizing the 64,000 character codes into a structured Huffman tree format. This segmentation allows the system to handle comprehensive character coverage while reducing processing complexity through hierarchical organization and efficient memory access patterns during table generation.
Solution Approach 2:
The patent performs preliminary action by pre-building the Huffman tree structure with all 64,000 character codes before compression begins. This preliminary preparation organizes the character code data in an optimized format that simplifies subsequent table generation during compression, reducing the complexity of handling such a large character set.
Data Source
AI summary
A recording medium stores an information processing program that causes a computer to execute storing a compression symbol map group having a bit string indicating for each character code, presence or absence of the character code in a file group, and a Huffman tree whose leaf corresponding to the character code has a pointer to a compression symbol map of the character code, the Huffman tree converting the character code into a compression symbol of the character code; compressing sequentially and according to the Huffman tree, a character code to be compressed and described in a file of the file group; detecting access to the leaf at the compressing; identifying by a pointer in the accessed leaf, a compression symbol map of the character code to be compressed; and updating a bit that indicates presence or absence of the character code to be compressed, in the identified compression symbol map.