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

An efficient implementation of static string pattern matching machines

โœ Scribed by Aoe, J.-I.


Book ID
111879152
Publisher
IEEE
Year
1989
Tongue
English
Weight
528 KB
Volume
15
Category
Article
ISSN
0098-5589

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An efficient finite-state machine implem
โœ Vikram Iyengar; Krishnendu Chakrabarty ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 353 KB

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. @