loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95)
VLSI Algorithms for Compressed Pattern Search Using Tree Based Codes
Strasbourg, France
July 24-July 26
ISBN: 0-8186-7109-2
ASCII Text
x 
 
Amar Mukherjee, Tinku Acharya, "VLSI Algorithms for Compressed Pattern Search Using Tree Based Codes," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 133, 1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95), 1995.
 
 
BibTex
x
 
@article{ 10.1109/ASAP.1995.522915,
author = {Amar Mukherjee and Tinku Acharya},
title = {VLSI Algorithms for Compressed Pattern Search Using Tree Based Codes},
journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on},
volume = {0},
year = {1995},
issn = {1063-6862},
pages = {133},
doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.1995.522915},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
TI - VLSI Algorithms for Compressed Pattern Search Using Tree Based Codes
SN - 1063-6862
SP
EP
A1 - Amar Mukherjee,
A1 - Tinku Acharya,
PY - 1995
KW - compressed pattern matching
KW - data compression
KW - VLSI architecture
KW - Huffman code
KW - decompression
VL - 0
JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
ER -
 
Amar Mukherjee, University of Central Florida
Tinku Acharya, University of Maryland
Data compression methods are used to reduce the redundancy in data representation in order to decrease the data storage requirements and communication costs. In order to exploit the benefits of data compression to conserve internal processor storage and computation resources, it is desirable to perform operations on compressed data without decompressing it. In this paper we present hardware algorithms and VLSI implementation of a chip to search a compressed text with respect to keys or patterns in compressed form using Huffman-type tree-based codes.
Index Terms:
compressed pattern matching, data compression, VLSI architecture, Huffman code, decompression
Citation:
Amar Mukherjee, Tinku Acharya, "VLSI Algorithms for Compressed Pattern Search Using Tree Based Codes," asap, pp.133, 1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.