Huffman Code Table Generation with a Unified Node Queue
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The circuit scale of devices generating code tables using dynamic Huffman coding increases due to the need to store information of both leaf and intermediate nodes, leading to inefficiencies.
Innovation Solution
A code table generation device that allocates storage areas for leaf and intermediate nodes separately, allowing efficient construction of Huffman trees by selecting nodes based on frequency of occurrence and storing them in queues, reducing the circuit scale.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If separate queues for leaf nodes and intermediate nodes are used, then the Huffman tree construction is accurate and complete, but the circuit scale increases
Solution Approach 1:
The patent combines the leaf node queue and intermediate node queue into a single unified queue structure. This queue stores both types of nodes together, allowing the Huffman tree construction to proceed by repeatedly extracting the two nodes with smallest frequencies regardless of their type. The merging eliminates the need for separate queue circuits while maintaining the correctness of the algorithm.
Solution Approach 2:
The unified queue serves multiple functions: it stores both leaf nodes and intermediate nodes, performs frequency-based sorting, and enables the selection of nodes for tree construction. This multi-functional design replaces what would traditionally require separate dedicated structures for each node type, reducing overall circuit complexity.
2Device complexity
If a unified queue stores both leaf and intermediate nodes, then the circuit scale is reduced, but the management of node selection becomes more complex
Solution Approach 1:
The patent changes the organization parameter from separate queues to a unified queue, and compensates for the increased management complexity by changing the selection criterion to a simple frequency-based comparison. Nodes are selected purely by their frequency values without needing to distinguish between leaf and intermediate node types, simplifying the control logic despite the unified structure.
Data Source
AI summary
According to one embodiment, a code table generation device includes a frequency table generation unit, a frequency sorting unit, and a Huffman tree generation unit. The frequency table generation unit generates a frequency table including entries each including a symbol and a frequency of occurrence, based on a frequency of occurrence for each symbol of input symbols. The frequency sorting unit sorts the entries in the frequency table by frequency of occurrence. The Huffman tree generation unit generates a Huffman tree having leaf nodes by using a queue that includes storage areas in which the sorted entries are respectively stored as the leaf nodes in an initial state, in response to the entries having been sorted.