Abstract
A code converter has a network of logic circuits connected in reverse binary tree fashion with logic paths between leaf nodes and a common root node. Characters are compressed from standard codes to variable-length Huffman code by pulse applying connections to the paths from a decoder. An OR-gate is connected to "I" branches of the network to deliver the output code. Characters are decompressed from Huffman to standard codes by connection of the Huffman code to control the clocked logic circuits to deliver a pulse from the root node to one of the inputs of an encoder. A feedback loop connects the root node and the path end nodes to initiate the next conversion. Alternative embodiments have decoder staging to minimize delay and parallel compressed code output.
Document Type
Patent
Patent Number
US 4,853,696
Application Serial Number
07/038,039
Issue Date
8-1-1989
Current Assignee
UCFRF
Assignee at Issuance
UCFRF
College
College of Engineering and Computer Science (CECS)
Department
Computer Science
Allowance Date
2-13-1989
Filing Date
4-13-1987
Assignee at Filing
UCFRF
Filing Type
Nonprovisional Application Record
Donated
no
Recommended Citation
Mukherjee, Amar, "Code Converter for Data Compression/ Decompression" (1989). UCF Patents. 81.
https://stars.library.ucf.edu/patents/81