Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Decompaction

IP.com Disclosure Number: IPCOM000041646D
Original Publication Date: 1984-Feb-01
Included in the Prior Art Database: 2005-Feb-02

Publishing Venue

IBM

Related People

Authors:
Peake, JW [+details]

Abstract

This article describes a method for decoding minimum redundancy Huffman codes used in the compaction of character and image data. The method uses Programmable Logic Arrays (PLAs) to reduce the complexity and improve performance over other decoding methods. Compaction is used to decrease the amount of data storage required for character or image data. Each character or image is represented by a string of data bits formed by concatenating variable length codewords (Huffman minimum redundancy codes) that describes how the data is to be reconstructed to form the original character or image. Although compaction reduces the amount of storage required to contain this type of data, it requires reconstruction. Reconstruction or decompaction has three requirements.