Bit-stream huffman coding for data compression

Bit-stream Huffman coding may be used for data compression to quickly and efficiently compress relatively small and large datasets. A symbol used in data compression may not be a byte or 8 bits. Rather it has any number of bits. For a certain dataset, a symbol has a dynamic number of bits according to the data size. A symbol may have less than 8 bits for a small dataset, or more than 8 bits for a large dataset. For rapid processing, a large dataset may be broken into smaller datasets that are fast encoded in parallel. Accordingly, the Huffman encoding inputs from a bit-stream instead of a conventional byte-stream and outputs a bit-stream. In particular, bit-stream Static and Adaptive Huffman codings are presented with extended algorithms. Hardware implementation with parallel Huffman encoders and decoders is also illustrated for fast network data compression.