# Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings

@inproceedings{Banchhor2020GeneralizationsOL, title={Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings}, author={Shashwat Banchhor and Rishikesh R. Gajjala and Yogish Sabharwal and Sandeep Sen}, year={2020} }

In this paper, we study the problem of designing prefix-free encoding schemes having minimum average code length that can be decoded efficiently under a decode cost model that captures memory hierarchy induced cost functions. We also study a special case of this problem that is closely related to the length limited Huffman coding (LLHC) problem; we call this the soft-length limited Huffman coding problem. In this version, there is a penalty associated with each of the n characters of the…

## References

SHOWING 1-10 OF 35 REFERENCES

Efficient algorithms for decode efficient prefix codes

- Computer Science2021 Data Compression Conference (DCC)
- 2021

This work studies the anovel problem of finding a prefix tree having the best decode time under the constraint that the code length does not exceed a certain threshold for a natural class of memory access cost functions that use blocking.

Decode efficient prefix codes

- Computer ScienceArXiv
- 2020

This work introduces and study a novel problem of finding a prefix tree having the best decode time under the constraint that the code length does not exceed a certain threshold for a natural class of memory access cost functions that use blocking (also referred to as lookup tables), i.e., these decoding schemes access multiple prefix tree entries in a single access, using associative memory table look-ups.

Decode-Efficient Prefix Codes for Hierarchical Memory Models

- Computer Science2020 Data Compression Conference (DCC)
- 2020

This work presents an efficient optimal algorithm for finding the prefix tree having the best decode time under the constraint that the code length does not exceed a certain threshold for a natural class of algorithms under the hierarchical memory model.

Deep Compression: Compressing Deep Neural Network with Pruning, Trained Quantization and Huffman Coding

- Computer ScienceICLR
- 2016

This work introduces "deep compression", a three stage pipeline: pruning, trained quantization and Huffman coding, that work together to reduce the storage requirement of neural networks by 35x to 49x without affecting their accuracy.

On the Huffman and Alphabetic Tree Problem with General Cost Functions

- Mathematics, Computer ScienceAlgorithmica
- 2013

Investigating the limits of computational tractability, it is shown that the Huffman Tree Problem in its full generality is inapproximable unless P = NP, no matter if the objective function is the sum of leaf costs or their maximum.

A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art

- Computer ScienceSignal Process.
- 2011

This tutorial paper describes various efficient implementations (published and new unpublished) of the forward and backward modified discrete cosine transform (MDCT) in the MPEG layer III (MP3) audio…

A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2010

A simple dynamic-programming (DP) method that solves the problem with the same time and space bounds and is quite simple and applicable to many other problems modeled by DPs with the Monge property.

Decode efficient prefix codes. CoRR, abs

- 2010

Source Coding for Quasiarithmetic Penalties

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2006

Several cost functions are shown here to yield quasiarithmetic problems with simple redundancy bounds in terms of a generalized entropy, which reduces the computational complexity of a problem involving minimum delay in a queue, allows combinations of previously considered problems to be optimized, and greatly expands the set of problems solvable in quadratic time and linear space.

Huffman coding with unequal letter costs

- Mathematics, Computer ScienceSTOC '02
- 2002

A polynomial-time approximation scheme (PTAS) for the standard Huffman coding problem, in which the letters of the encoding alphabet may have non-uniform lengths, is described.