Huffman code [I] is the most well-known and widely used variable-length codes (VLCs) for compressing various kinds of data. Conventional table lookup and/or bit-serial decoding techniques for realizing VLCs are inefficient in memory usage andor compntation'time. In this paper, we investigated some existing memory efficient VLC decoding methods [2, 3, 4, 51 and gave some comments and comparisons among them. We also proposed an SGH-Tree based data structure to implement Aggurwul's approach [5] such that a symbol can be decoded in constant time; moreover, the required memory is much smaller than that of the original approach.