๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient finite-state machine implementation of Huffman decoders

โœ Scribed by Vikram Iyengar; Krishnendu Chakrabarty

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
353 KB
Volume
64
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present an efficient hardware implementation of a Huffman decoding algorithm that is based on the prefix-free property of Huffman codes. The proposed method can be used to reduce tester memory requirements for integrated circuit testing. @

๐Ÿ“œ SIMILAR VOLUMES

The virtual finite-state machine design
The virtual finite-state machine design and implementation paradigm
โœ Alan R. Flora-Holmquist; Edward Morton; James D. O'Grady; Mark G. Staskauskas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 162 KB ๐Ÿ‘ 1 views

Figure 2. VFSM design paradigm overview.

Bounds on the complexity of recurrent ne
Bounds on the complexity of recurrent neural network implementations of finite state machines
โœ Bill G. Horne; Don R. Hush ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 823 KB

In this paper the efficiency of recurrent neural network implementations of m-state finite state machines will be explored. Specifically, it will be shown that the node complexity for the unrestricted case can be bounded above by O(v/-m-). It will also be shown that the node complexity is 0( ~) when