Abstract
A single-stage Huffman encoder may be built offline to simplify an encoding process and reduce latency and/or complexity associated with encoding. The process for Huffman encoding includes frequency analysis for determining frequencies of symbols in input data, constructing a binary tree where the most frequent symbols are assigned shorter codewords to represent them, and encoding values for the input data using the codewords. A codebook that includes the codewords representing all symbols represented in the binary tree is made available to both the encoder and decoder simultaneously. The values can be encoded by selecting a codebook applicable for a given tensor and directly looking up in the selected codebook. The identification of the applicable codebook can be determined in software or hardware. In a software implementation, the applicable codebook can be specified by the compiler or programmer. Alternatively, in the hardware implementation, the applicable codebook can be determined by selecting the codebook that provides the best compression.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
N/A, "CONVERTING 3-STAGE HUFFMAN ENCODER TO A SINGLE-STAGE ENCODER", Technical Disclosure Commons, (September 10, 2025)
https://www.tdcommons.org/dpubs_series/8577