Huffman decoder using two priority encoder to reduce circuit scale

A Huffman-code decoder includes a coded data storage section, a code length detector for detecting the code length of an input Huffman code, an address calculator for calculating the address for the coded data for the input Huffman code, a value data storage section for storing a value data obtained...

Full description

Saved in:
Bibliographic Details
Main Author SASAKI TSUNEKI
Format Patent
LanguageEnglish
Published 18.12.2001
Edition7
Subjects
BASIC ELECTRONIC CIRCUITRY
CODE CONVERSION IN GENERAL
CODING
DECODING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
PICTORIAL COMMUNICATION, e.g. TELEVISION
Online AccessGet full text

Cover

More Information
Summary:A Huffman-code decoder includes a coded data storage section, a code length detector for detecting the code length of an input Huffman code, an address calculator for calculating the address for the coded data for the input Huffman code, a value data storage section for storing a value data obtained by subtracting from the minimum code the address thereof, and a subtracter for subtracting the value data from the input Huffman code. Each of the value data storage section, subtracter and code length detector has a maximum of eight bits for the Huffman codes having a single to sixteen bits.
Bibliography:Application Number: US20000598253