•Huffman coding today is often used as a "back-end" to other compression methods multimedia codec’s such as JPEG and MP3 have a front-end model and quantization followed by Huffman coding.
•The algorithm accomplishes its goals by allowing symbols to vary in length.
•Shorter codes are assigned to the most frequently used symbols, and longer codes to the symbols which appear less frequently in the string.
•Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code..
•To use Huffman coding a binary tree is constructed whose root node (parent node) has two branches, the left branch and the right branch.
•These branches are assigned the values as 0 (zeros) and 1 (ones).
•The path from the root to a leaf node defines the code word for the particular symbol assigned to this node.
•The algorithm accomplishes its goals by allowing symbols to vary in length.
•Shorter codes are assigned to the most frequently used symbols, and longer codes to the symbols which appear less frequently in the string.
•Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code..
•To use Huffman coding a binary tree is constructed whose root node (parent node) has two branches, the left branch and the right branch.
•These branches are assigned the values as 0 (zeros) and 1 (ones).
•The path from the root to a leaf node defines the code word for the particular symbol assigned to this node.
Comments
Post a Comment