Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Primer on Compression in the Memory HierarchyCompression Algorithms

A Primer on Compression in the Memory Hierarchy: Compression Algorithms [In information theory, the entropy of a source input is the amount of information contained in that data [126]. Entropy determines the number of bits needed to optimally represent the original source data. Therefore, entropy sets an upper bound on the potential for compression. Low entropy suggests that data can be represented with fewer bits. Although computer designers try to use efficient coding for different data types, the memory footprints of many applications still have low entropy.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Primer on Compression in the Memory HierarchyCompression Algorithms

Download PDF
16 pages

Loading next page...
 
/lp/springer-journals/a-primer-on-compression-in-the-memory-hierarchy-compression-algorithms-Bh809KvfCB
Publisher
Springer International Publishing
Copyright
© Springer Nature Switzerland AG 2016
ISBN
978-3-031-00623-4
Pages
3 –19
DOI
10.1007/978-3-031-01751-3_2
Publisher site
See Chapter on Publisher Site

Abstract

[In information theory, the entropy of a source input is the amount of information contained in that data [126]. Entropy determines the number of bits needed to optimally represent the original source data. Therefore, entropy sets an upper bound on the potential for compression. Low entropy suggests that data can be represented with fewer bits. Although computer designers try to use efficient coding for different data types, the memory footprints of many applications still have low entropy.]

Published: Jan 1, 2016

There are no references for this article.