Filters








664 Hits in 5.4 sec

An Efficient Memory Construction Scheme for an Arbitrary Side Growing Huffman Table

Sung-wen Wang, Shang-chih Chuang, Chih-chieh Hsiao, Yi-shin Tung, Ja-ling Wu
2006 2006 IEEE International Conference on Multimedia and Expo  
By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGHtree), we construct a memory efficient Huffman table on the basis of an arbitrary-side  ...  In summary, a novel Huffman table construction scheme is proposed in this paper which provides better performance than existing construction schemes in both decoding speed and memory usage.  ...  To take both memory-efficient LUT and achieve high-speed locating of each symbol into account, we propose a new partitioning method for arbitrary-side growing Huffman table in Section 2.  ... 
doi:10.1109/icme.2006.262589 dblp:conf/icmcs/WangCHTW06 fatcat:s4lwc5yajfbjvp5er5van757o4

Reducing instruction fetch energy with backwards branch control information and buffering

Jude A. Rivers, Sameh Asaad, John-David Wellman, Jaime H. Moreno
2003 Proceedings of the 2003 international symposium on Low power electronics and design - ISLPED '03  
Our experiments show that the DLB approach, on average, results in a factor of 3 reduction in energy consumption compared to a traditional instruction memory design at an area overhead of about 9%.  ...  However, these schemes are limited to straight-line or innermost loops and fail to adequately handle complex loops.  ...  Hence, an instruction fetch scheme is necessary that efficiently, economically, and dynamically exploits instruction fetch redundancy to save energy.  ... 
doi:10.1145/871506.871586 dblp:conf/islped/RiversAWM03 fatcat:wxv5buob2zgnxa5hxa7rqgxqii

Reducing instruction fetch energy with backwards branch control information and buffering

Jude A. Rivers, Sameh Asaad, John-David Wellman, Jaime H. Moreno
2003 Proceedings of the 2003 international symposium on Low power electronics and design - ISLPED '03  
Our experiments show that the DLB approach, on average, results in a factor of 3 reduction in energy consumption compared to a traditional instruction memory design at an area overhead of about 9%.  ...  However, these schemes are limited to straight-line or innermost loops and fail to adequately handle complex loops.  ...  Hence, an instruction fetch scheme is necessary that efficiently, economically, and dynamically exploits instruction fetch redundancy to save energy.  ... 
doi:10.1145/871582.871586 fatcat:7za2qvxiezfwha2qwa7isv55i4

Order-Preserving Key Compression for In-Memory Search Trees [article]

Huanchen Zhang, Xiaoxuan Liu, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo
2020 arXiv   pre-print
We present the High-speed Order-Preserving Encoder (HOPE) for in-memory search trees. HOPE is a fast dictionary-based compressor that encodes arbitrary keys while preserving their order.  ...  Our experiments show that using HOPE allows the search trees to achieve lower query latency (up to 40\% lower) and better memory efficiency (up to 30\% smaller) simultaneously for most string key workloads  ...  These schemes cannot encode arbitrary strings unless they grow the dictionary, but growing to accommodate new entries may require the DBMS to re-encode the entire corpus [19] .  ... 
arXiv:2003.02391v1 fatcat:4k5o6pbznfdezdvcwbxsel5voa

Evaluation and comparison of various indexing schemes in single-channel broadcast communication environment

Jiaofei Zhong, Weili Wu, Xiaofeng Gao, Yan Shi, Xiaodong Yue
2013 Knowledge and Information Systems  
In this paper, we redesigned several most popular indexing schemes for data broadcasting systems, i.e., distributed index, exponential index, hash table, and Huffman tree index.  ...  ., distributed index [10], Huffman tree [11], spatial index [12], hash table [29] , exponential index [27], signature tree [31], but they are constructed under different environments, which brings difficulties  ...  [27] gave an idea of exponential index that shares links in different search tables, which allows clients to start searching at an arbitrary index node.  ... 
doi:10.1007/s10115-013-0643-9 fatcat:hgeuxmzwenhxlhibetk6kxdkku

Huffman-based code compression techniques for embedded processors

Talal Bonny, Jörg Henkel
2010 ACM Transactions on Design Automation of Electronic Systems  
Talal Bonny ii I am also very grateful to Professor Wael Adi for accepting to be my co-examiner and providing valuable feedback.  ...  August-Bebel-Str.68 Karlsruhe Hiermit erkläre ich an Eides statt, dass ich die von mir vorgelegte Arbeit selbstständig verfasst habe, dass ich die verwendeten Quellen, Internet-Quellen und Hilfsmittel  ...  Acknowledgements First and foremost, I would like gratefully and sincerely to thank my advisor Professor Jörg Henkel for enabling and supporting the research presented in this thesis and for offering an  ... 
doi:10.1145/1835420.1835424 fatcat:z25cwe2n3jfqpptg2ggprwbqsy

Optimal Compression for Two-Field Entries in Fixed-Width Memories [article]

Ori Rottenstreich, Yuval Cassuto
2017 arXiv   pre-print
A good practical use for this problem is a table with two-field entries that is stored in a memory of a fixed width L.  ...  With an empirical study we show the success probabilities of the optimal codes for different distributions and memory widths.  ...  We show constructively that this task can be achieved with an efficient algorithm. We denote W i = log 2 (n i ) for i ∈ {1, 2} and W = W 1 + W 2 . Finding an optimal coding scheme when L ≥ W is easy.  ... 
arXiv:1701.02900v1 fatcat:ahmfjf6qbzhehnm5favcienppa

On Palimpsests in Neural Memory: An Information Theory Viewpoint

Lav R. Varshney, Julius Kusuma, Vivek K Goyal
2016 IEEE Transactions on Molecular, Biological and Multi-Scale Communications  
In this paper, we suggest that information-theoretic approaches may inform the fundamental limits in constructing such a memory system.  ...  Moreover, changing information in memory is metabolically costly.  ...  Levenshtein Edit Distance Graph for {0, 1} ∪ {0, 1} 2 ∪ {0, 1} 3 . к 0000 х 0100 1000 0010 0011 1001 0101 Ê 0001 TABLE II HUFFMAN II CODE FOR 4-ARY SOURCE. x ∈ W p(x) f Huffman (x) ℓ Huffman  ... 
doi:10.1109/tmbmc.2016.2640320 dblp:journals/tmbmc/VarshneyKG16 fatcat:5zutgffzazbpbaxcqkeutlha7u

Compressing Forwarding Tables for Datacenter Scalability

Ori Rottenstreich, Marat Radan, Yuval Cassuto, Isaac Keslassy, Carmi Arad, Tal Mizrahi, Yoram Revah, Avinatan Hassidim
2014 IEEE Journal on Selected Areas in Communications  
We also introduce an algorithm for optimal conditional encoding of the second column given an encoding of the first one. In addition, we explain how our architecture can handle table updates.  ...  Unfortunately, such forwarding table sizes would not fit on-chip memory using current implementations. In this paper, we investigate the compressibility of forwarding tables.  ...  We would like to thank Yishay Mansour and Haim Kaplan for their helpful participation and suggestions. This  ... 
doi:10.1109/jsac.2014.140113 fatcat:x6hqepr2xfcxnaj7udiqlf7jwi

Selective use of multiple entropy models in audio coding

Sanjeev Mehrotra, Wei-ge Chen
2008 2008 IEEE 10th Workshop on Multimedia Signal Processing  
This can be used for any entropy coding scheme such as Huffman or arithmetic coding.  ...  The use of multiple entropy models for Huffman or arithmetic coding is widely used to improve the compression efficiency of many algorithms when the source probability distribution varies.  ...  Section III is an example of the algorithm and how a sample Huffman table is constructed.  ... 
doi:10.1109/mmsp.2008.4665208 dblp:conf/mmsp/MehrotraC08 fatcat:zguvlkcem5ffhlkpn5eobggjde

Index compression vs. retrieval time of inverted files for XML documents

Norbert Fuhr, Norbert Gövert
2002 Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02  
We evaluate the efficiency of several variants of these two approaches on two large XML document collections. Results show that very high compression rates for indexes can be achieved.  ...  Second, we develop the new XS tree data structure which contains the structural description of a document in a rather compact form, such that these descriptions can be kept in main memory.  ...  This results from the fact that XS hc uses context-specific Huffman codes, thus the respective XML trees must be constructed at decompression time in order to apply the correct Huffman codes for decompression  ... 
doi:10.1145/584902.584912 fatcat:mfc3pjjyxnfrhk2gc3hyd7fp5m

Index compression vs. retrieval time of inverted files for XML documents

Norbert Fuhr, Norbert Gövert
2002 Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02  
We evaluate the efficiency of several variants of these two approaches on two large XML document collections. Results show that very high compression rates for indexes can be achieved.  ...  Second, we develop the new XS tree data structure which contains the structural description of a document in a rather compact form, such that these descriptions can be kept in main memory.  ...  This results from the fact that XS hc uses context-specific Huffman codes, thus the respective XML trees must be constructed at decompression time in order to apply the correct Huffman codes for decompression  ... 
doi:10.1145/584792.584912 dblp:conf/cikm/FuhrG02 fatcat:dtqlzo75gfdd7nux3eljoucscm

Compressing forwarding tables

Ori Rottenstreich, Marat Radan, Yuval Cassuto, Isaac Keslassy, Carmi Arad, Tal Mizrahi, Yoram Revah, Avinatan Hassidim
2013 2013 Proceedings IEEE INFOCOM  
We also introduce an algorithm for optimal conditional encoding of the second column given an encoding of the first one. In addition, we explain how our architecture can handle table updates.  ...  Unfortunately, such forwarding table sizes can hardly be implemented today in on-chip memory. In this paper, we investigate the compressibility of forwarding tables.  ...  Let C A = (σ 1 , σ 2 ) be an arbitrary FIB table encoding scheme of A.  ... 
doi:10.1109/infcom.2013.6566915 dblp:conf/infocom/RottenstreichRCKAMRH13 fatcat:7zlxqtwuvzdefagatls2ja5wgq

Data Compression [chapter]

Shashi Shekhar, Hui Xiong
2008 Encyclopedia of GIS  
A framework for evaluation and comparison of methods is constructed and applied to the algorithms presented.  ...  This paper surveys a variety of data compression methods spanning almost 40 years of research, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique developed in 1986.  ...  A dynamic Huffman code table for the prefix "an bbb" of message EXAMPLE.  ... 
doi:10.1007/978-0-387-35973-1_239 fatcat:n2zi47ejyfecdfvmk3b2d6cxgi

Application of Huffman data compression algorithm in hashing computation

Lakshmi Narasimha Devulapalli Venkata, Mustafa Atici
2018 Proceedings of the ACMSE 2018 Conference on - ACMSE '18  
Table 5 . 5 1: Character frequency table of Huffman Tree -seed construction • Now, we hash the Huffman compressed codes, which results a 160-bit message digest.  ...  table for Encoded Tree Structure . . . . . . . . . . . . 30 4.2 Character frequency table for Encoded Tree Structure -2 . . . . . . . . . . 30 4.3 Character frequency table of Huffman Tree . . . . . .  ...  Appendix C APPENDIX C: NEW SEED CONSTRUCTION SOURCE 1 #pragma o n c e 2 / * 3 * Header file for sha code 4 * reference: US Secure Hash Algorithm 1 by Network working group 5 * / 6 7 / * This Header will  ... 
doi:10.1145/3190645.3190715 dblp:conf/ACMse/VenkataA18 fatcat:buusdwkacrdqfmuon7wlxuee34
« Previous Showing results 1 — 15 out of 664 results