AN EFFICIENT FINITE-STATE MACHINE IMPLEMENTATION OF HUFFMAN DECODERS

Authors
IYENGAR V CHAKRABARTY K
Citation
V. Iyengar et K. Chakrabarty, AN EFFICIENT FINITE-STATE MACHINE IMPLEMENTATION OF HUFFMAN DECODERS, Information processing letters, 64(6), 1997, pp. 271-275
Citations number
10
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
64
Issue
6
Year of publication
1997
Pages
271 - 275
Database
ISI
SICI code
0020-0190(1997)64:6<271:AEFMIO>2.0.ZU;2-Z
Abstract
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 f or integrated circuit testing. (C) 1997 Elsevier Science B.V.