Title

Efficient Vlsi Designs For Data Transformation Of Tree-Based Codes

Abstract

In this paper, we propose a new class of VLSI architectures for data transformation of tree-based codes. We concentrate on transformation functions used for data compression and decompression. We present two algorithms: A sequential algorithm that generates the code bits serially one bit per machine cycle, and a parallel algorithm that generates the entire code bits of a symbol in one machine cycle. The algorithms use the principle of propagation of a token in a reverse binary tree constructed from the original codes. The design approaches are applicable to any binary codes, although the static Huffman code is used as an illustration. A new hardware algorithm for generating adaptive Huffman codes is proposed and a VLSI architecture for implementing the algorithm is described. The high speed of the new algorithms ensures that data transformation is done on the fly, as data are being transferred from/to high-speed I/O communication devices. © 1991 IEEE

Publication Date

1-1-1991

Publication Title

IEEE Transactions on Circuits and Systems

Volume

38

Issue

3

Number of Pages

306-314

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/31.101323

Socpus ID

0026128885 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS