Sciweavers

3 search results - page 1 / 1
» CAM-Based Huffman Decoding Made Power Efficient
Sort
View
AINA
2005
IEEE
14 years 4 months ago
CAM-Based Huffman Decoding Made Power Efficient
Ternary content addressable (TCAM) is favorable for high-speed search due to its parallel architecture and ability for searching arbitrary-length keys. However, the usage of TCAM ...
Pi-Chung Wang, Chun-Liang Lee, Yuan-Rung Yang, Hun...
DCC
1996
IEEE
14 years 3 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
CASES
2005
ACM
14 years 29 days ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton