Title

Vlsi Algorithms For Compressed Pattern Search Using Tree Based Codes

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

Publication Date

1-1-1995

Publication Title

Proceedings of the International Conference on Application Specific Array Processors

Number of Pages

133-136

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

0029218099 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0029218099

This document is currently not available here.

Share

COinS