Efficient Vlsi Designs For Data Transformation Of Tree-Based Codes

    Authors

    A. Mukherjee; N. Ranganathan;M. Bassiouni

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    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.

    Journal Title

    Ieee Transactions on Circuits and Systems

    Volume

    38

    Issue/Number

    3

    Publication Date

    1-1-1991

    Document Type

    Article

    Language

    English

    First Page

    306

    Last Page

    314

    WOS Identifier

    WOS:A1991FA27800007

    ISSN

    0098-4094

    Share

    COinS