VLSI algorithms for compressed pattern search using tree based codes

Author

Mukherjee, Amar ; Acharya, Tinku

Author_Institution

Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA

fYear

1995

fDate

24-26 Jul 1995

Firstpage

133

Lastpage

136

Abstract

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. 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

Keywords

Huffman codes; VLSI; application specific integrated circuits; data compression; digital signal processing chips; parallel algorithms; pattern matching; Huffman-type tree-based codes; VLSI algorithms; VLSI implementation; compressed pattern search; compressed text; computation resources; data compression methods; hardware algorithms; internal processor storage; tree based codes; Computer science; Costs; Data compression; Databases; Educational institutions; Hardware; Memory; Pattern matching; Query processing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Application Specific Array Processors, 1995. Proceedings. International Conference on

Conference_Location

Strasbourg

ISSN

1063-6862

Print_ISBN

0-8186-7109-2

Type

conf

DOI

10.1109/ASAP.1995.522915

Filename

522915