{"id":25056,"date":"2017-05-27T18:37:10","date_gmt":"2017-05-27T13:07:10","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25056"},"modified":"2017-05-27T18:37:10","modified_gmt":"2017-05-27T13:07:10","slug":"huffman-coding","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/huffman-coding\/","title":{"rendered":"Huffman Coding"},"content":{"rendered":"

Huffman coding is a lossless data compression algorithm. The idea is to assign variable-legth codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters.<\/span> The most frequent character gets the smallest code and the least frequent character gets the largest code.<\/p>\n

The variable-length codes assigned to input characters are Prefix Codes<\/a>, means the codes (bit sequences) are assigned in such a way that the code assigned to one character is not prefix of code assigned to any other character. This is how Huffman Coding makes sure that there is no ambiguity when decoding the generated bit stream.<\/p>\n

Let us understand prefix codes with a counter example. Let there be four characters a, b, c and d, and their corresponding variable length codes be 00, 01, 0 and 1. This coding leads to ambiguity because code assigned to c is prefix of codes assigned to a and b. If the compressed bit stream is 0001, the de-compressed output may be \u201ccccd\u201d or \u201cccb\u201d or \u201cacd\u201d or \u201cab\u201d.<\/p>\n

See this for applications of Huffman Coding.<\/p>\n

There are mainly two major parts in Huffman Coding<\/p>\n

    \n
  1. Build a Huffman Tree from input characters.<\/li>\n
  2. Traverse the Huffman Tree and assign codes to characters.<\/li>\n<\/ol>\n[ad type=”banner”]\n

    Steps to build Huffman Tree<\/strong>
    \nInput is array of unique characters along with their frequency of occurrences and output is Huffman Tree.<\/h4>\n

    1.<\/strong> Create a leaf node for each unique character and build a min heap of all leaf nodes (Min Heap is used as a priority queue. The value of frequency field is used to compare two nodes in min heap. Initially, the least frequent character is at root)<\/p>\n

    2.<\/strong> Extract two nodes with the minimum frequency from the min heap.<\/p>\n

    3.<\/strong> Create a new internal node with frequency equal to the sum of the two nodes frequencies. Make the first extracted node as its left child and the other extracted node as its right child. Add this node to the min heap.<\/p>\n

    4.<\/strong> Repeat steps#2 and #3 until the heap contains only one node. The remaining node is the root node and the tree is complete.<\/p>\n

    Let us understand the algorithm with an example:<\/p>\n

    character   Frequency\r\n    a\t        5\r\n    b           9\r\n    c           12\r\n    d           13\r\n    e           16\r\n    f           45<\/pre>\n
    Step 1.<\/strong> Build a min heap that contains 6 nodes where each node represents root of a tree with single node.<\/p>\n
    Step 2<\/strong> Extract two minimum frequency nodes from min heap. Add a new internal node with frequency 5 + 9 = 14.<\/p>\n
    \"Huffman
    \nNow min heap contains 5 nodes where 4 nodes are roots of trees with single element each, and one heap node is root of tree with 3 elements<\/p>\n[ad type=”banner”]\n
    character           Frequency\r\n       c               12\r\n       d               13\r\n Internal Node         14\r\n       e               16\r\n       f                45\r\n<\/pre>\n
    Step 3:<\/strong> Extract two minimum frequency nodes from heap. Add a new internal node with frequency 12 + 13 = 25<\/p>\n
    \"Huffman<\/p>\n
    Now min heap contains 4 nodes where 2 nodes are roots of trees with single element each, and two heap nodes are root of tree with more than one nodes.<\/p>\n
    character           Frequency\r\nInternal Node          14\r\n       e               16\r\nInternal Node          25\r\n       f               45\r\n<\/pre>\n
    Step 4:<\/strong> Extract two minimum frequency nodes. Add a new internal node with frequency 14 + 16 = 30
    \n\"Huffman
    \nNow min heap contains 3 nodes.<\/p>\n
    character          Frequency\r\nInternal Node         25\r\nInternal Node         30\r\n      f               45<\/pre>\n
    Step 5:<\/strong> Extract two minimum frequency nodes. Add a new internal node with frequency 25 + 30 = 55
    \n\"Huffman
    \nNow min heap contains 2 nodes.<\/p>\n
    character     Frequency\r\n       f         45\r\nInternal Node    55<\/pre>\n
    Step 6:<\/strong> Extract two minimum frequency nodes. Add a new internal node with frequency 45 + 55 = 100
    \n\"Huffman
    \nNow min heap contains only one node.<\/p>\n
    character      Frequency\r\nInternal Node    100<\/pre>\n
    Since the heap contains only one node, the algorithm stops here.<\/p>\n
    Steps to print codes from Huffman Tree:<\/strong>
    \nTraverse the tree formed starting from the root. Maintain an auxiliary array. While moving to the left child, write 0 to the array. While moving to the right child, write 1 to the array. Print the array when a leaf node is encountered.<\/p>\n
    \"HuffmanThe codes are as follows:<\/p>\n
    character   code-word\r\n    f          0\r\n    c          100\r\n    d          101\r\n    a          1100\r\n    b          1101\r\n    e          111<\/pre>\n
    [ad type=”banner”]<\/h4>\n
    C Programming<\/strong><\/h4>\n
     
     C<\/span> <\/div> 
    \/\/ C program for Huffman Coding#include <stdio.h>#include <stdlib.h> \/\/ This constant can be avoided by explicitly calculating height of Huffman Tree#define MAX_TREE_HT 100 \/\/ A Huffman tree nodestruct MinHeapNode{    char data;  \/\/ One of the input characters    unsigned freq;  \/\/ Frequency of the character    struct MinHeapNode *left, *right; \/\/ Left and right child of this node}; \/\/ A Min Heap:  Collection of min heap (or Hufmman tree) nodesstruct MinHeap{    unsigned size;    \/\/ Current size of min heap    unsigned capacity;   \/\/ capacity of min heap    struct MinHeapNode **array;  \/\/ Attay of minheap node pointers}; \/\/ A utility function allocate a new min heap node with given character\/\/ and frequency of the characterstruct MinHeapNode* newNode(char data, unsigned freq){    struct MinHeapNode* temp =          (struct MinHeapNode*) malloc(sizeof(struct MinHeapNode));    temp->left = temp->right = NULL;    temp->data = data;    temp->freq = freq;    return temp;} \/\/ A utility function to create a min heap of given capacitystruct MinHeap* createMinHeap(unsigned capacity){    struct MinHeap* minHeap =         (struct MinHeap*) malloc(sizeof(struct MinHeap));    minHeap->size = 0;  \/\/ current size is 0    minHeap->capacity = capacity;    minHeap->array =     (struct MinHeapNode**)malloc(minHeap->capacity * sizeof(struct MinHeapNode*));    return minHeap;} \/\/ A utility function to swap two min heap nodesvoid swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b){    struct MinHeapNode* t = *a;    *a = *b;    *b = t;} \/\/ The standard minHeapify function.void minHeapify(struct MinHeap* minHeap, int idx){    int smallest = idx;    int left = 2 * idx + 1;    int right = 2 * idx + 2;     if (left < minHeap->size &&        minHeap->array[left]->freq < minHeap->array[smallest]->freq)      smallest = left;     if (right < minHeap->size &&        minHeap->array[right]->freq < minHeap->array[smallest]->freq)      smallest = right;     if (smallest != idx)    {        swapMinHeapNode(&minHeap->array[smallest], &minHeap->array[idx]);        minHeapify(minHeap, smallest);    }} \/\/ A utility function to check if size of heap is 1 or notint isSizeOne(struct MinHeap* minHeap){    return (minHeap->size == 1);} \/\/ A standard function to extract minimum value node from heapstruct MinHeapNode* extractMin(struct MinHeap* minHeap){    struct MinHeapNode* temp = minHeap->array[0];    minHeap->array[0] = minHeap->array[minHeap->size - 1];    --minHeap->size;    minHeapify(minHeap, 0);    return temp;} \/\/ A utility function to insert a new node to Min Heapvoid insertMinHeap(struct MinHeap* minHeap, struct MinHeapNode* minHeapNode){    ++minHeap->size;    int i = minHeap->size - 1;    while (i && minHeapNode->freq < minHeap->array[(i - 1)\/2]->freq)    {        minHeap->array[i] = minHeap->array[(i - 1)\/2];        i = (i - 1)\/2;    }    minHeap->array[i] = minHeapNode;} \/\/ A standard funvtion to build min heapvoid buildMinHeap(struct MinHeap* minHeap){    int n = minHeap->size - 1;    int i;    for (i = (n - 1) \/ 2; i >= 0; --i)        minHeapify(minHeap, i);} \/\/ A utility function to print an array of size nvoid printArr(int arr[], int n){    int i;    for (i = 0; i < n; ++i)        printf("%d", arr[i]);    printf("\\n");} \/\/ Utility function to check if this node is leafint isLeaf(struct MinHeapNode* root){    return !(root->left) && !(root->right) ;} \/\/ Creates a min heap of capacity equal to size and inserts all character of \/\/ data[] in min heap. Initially size of min heap is equal to capacitystruct MinHeap* createAndBuildMinHeap(char data[], int freq[], int size){    struct MinHeap* minHeap = createMinHeap(size);    for (int i = 0; i < size; ++i)        minHeap->array[i] = newNode(data[i], freq[i]);    minHeap->size = size;    buildMinHeap(minHeap);    return minHeap;} \/\/ The main function that builds Huffman treestruct MinHeapNode* buildHuffmanTree(char data[], int freq[], int size){    struct MinHeapNode *left, *right, *top;     \/\/ Step 1: Create a min heap of capacity equal to size.  Initially, there are    \/\/ modes equal to size.    struct MinHeap* minHeap = createAndBuildMinHeap(data, freq, size);     \/\/ Iterate while size of heap doesn't become 1    while (!isSizeOne(minHeap))    {        \/\/ Step 2: Extract the two minimum freq items from min heap        left = extractMin(minHeap);        right = extractMin(minHeap);         \/\/ Step 3:  Create a new internal node with frequency equal to the        \/\/ sum of the two nodes frequencies. Make the two extracted node as        \/\/ left and right children of this new node. Add this node to the min heap        \/\/ '$' is a special value for internal nodes, not used        top = newNode('$', left->freq + right->freq);        top->left = left;        top->right = right;        insertMinHeap(minHeap, top);    }     \/\/ Step 4: The remaining node is the root node and the tree is complete.    return extractMin(minHeap);} \/\/ Prints huffman codes from the root of Huffman Tree.  It uses arr[] to\/\/ store codesvoid printCodes(struct MinHeapNode* root, int arr[], int top){    \/\/ Assign 0 to left edge and recur    if (root->left)    {        arr[top] = 0;        printCodes(root->left, arr, top + 1);    }     \/\/ Assign 1 to right edge and recur    if (root->right)    {        arr[top] = 1;        printCodes(root->right, arr, top + 1);    }     \/\/ If this is a leaf node, then it contains one of the input    \/\/ characters, print the character and its code from arr[]    if (isLeaf(root))    {        printf("%c: ", root->data);        printArr(arr, top);    }} \/\/ The main function that builds a Huffman Tree and print codes by traversing\/\/ the built Huffman Treevoid HuffmanCodes(char data[], int freq[], int size){   \/\/  Construct Huffman Tree   struct MinHeapNode* root = buildHuffmanTree(data, freq, size);    \/\/ Print Huffman codes using the Huffman tree built above   int arr[MAX_TREE_HT], top = 0;   printCodes(root, arr, top);} \/\/ Driver program to test above functionsint main(){    char arr[] = {'a', 'b', 'c', 'd', 'e', 'f'};    int freq[] = {5, 9, 12, 13, 16, 45};    int size = sizeof(arr)\/sizeof(arr[0]);    HuffmanCodes(arr, freq, size);    return 0;}<\/code><\/pre> <\/div>\n
    \n
    \n
    \n
    C++\u00a0<\/strong>Programming<\/strong><\/h4>\n
     
     <\/div> 
    \/\/ C++ program for Huffman Coding#include <bits\/stdc++.h>using namespace std; \/\/ A Huffman tree nodestruct MinHeapNode{    char data;                \/\/ One of the input characters    unsigned freq;             \/\/ Frequency of the character    MinHeapNode *left, *right; \/\/ Left and right child     MinHeapNode(char data, unsigned freq)    {        left = right = NULL;        this->data = data;        this->freq = freq;    }}; \/\/ For comparison of two heap nodes (needed in min heap)struct compare{    bool operator()(MinHeapNode* l, MinHeapNode* r)    {        return (l->freq > r->freq);    }}; \/\/ Prints huffman codes from the root of Huffman Tree.void printCodes(struct MinHeapNode* root, string str){    if (!root)        return;     if (root->data != '$')        cout << root->data << ": " << str << "\\n";     printCodes(root->left, str + "0");    printCodes(root->right, str + "1");} \/\/ The main function that builds a Huffman Tree and\/\/ print codes by traversing the built Huffman Treevoid HuffmanCodes(char data[], int freq[], int size){    struct MinHeapNode *left, *right, *top;     \/\/ Create a min heap & inserts all characters of data[]    priority_queue<MinHeapNode*, vector<MinHeapNode*>, compare> minHeap;    for (int i = 0; i < size; ++i)        minHeap.push(new MinHeapNode(data[i], freq[i]));     \/\/ Iterate while size of heap doesn't become 1    while (minHeap.size() != 1)    {        \/\/ Extract the two minimum freq items from min heap        left = minHeap.top();        minHeap.pop();         right = minHeap.top();        minHeap.pop();         \/\/ Create a new internal node with frequency equal to the        \/\/ sum of the two nodes frequencies. Make the two extracted        \/\/ node as left and right children of this new node. Add        \/\/ this node to the min heap        \/\/ '$' is a special value for internal nodes, not used        top = new MinHeapNode('$', left->freq + right->freq);        top->left = left;        top->right = right;        minHeap.push(top);    }     \/\/ Print Huffman codes using the Huffman tree built above    printCodes(minHeap.top(), "");} \/\/ Driver program to test above functionsint main(){    char arr[] = { 'a', 'b', 'c', 'd', 'e', 'f' };    int freq[] = { 5, 9, 12, 13, 16, 45 };    int size = sizeof(arr) \/ sizeof(arr[0]);     HuffmanCodes(arr, freq, size);     return 0;}\/\/ This code is contributed by Aditya Goel<\/code><\/pre> <\/div>\n
     <\/p>\n
    f: 0\r\nc: 100\r\nd: 101\r\na: 1100\r\nb: 1101\r\ne: 111<\/pre>\n
    Time complexity:<\/strong> O(nlogn) where n is the number of unique characters. If there are n nodes, extractMin() is called 2*(n \u2013 1) times. extractMin() takes O(logn) time as it calles minHeapify(). So, overall complexity is O(nlogn).<\/p>\n
    If the input array is sorted, there exists a linear time algorithm. We will soon be discussing in our next post.<\/p>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
    Huffman Coding – Greedy Algorithm – Huffman coding is a lossless data compression algorithm. The idea is to assign variable-legth codes to input characters.<\/p>\n","protected":false},"author":1,"featured_media":25368,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70144],"tags":[71082,71090,73006,71079,71063,73004,71083,71085,73009,73005,73007,71089,71100,71107,71086,73008,71080,71088,73010,71118,71115,71095,71087,71099,71106,71111,71073,71064,71102,71094],"class_list":["post-25056","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-greedy-algorithm","tag-application-of-huffman-coding-in-data-compression","tag-c-program-to-implement-huffman-code","tag-huffman-code-generator","tag-huffman-coding-algorithm-in-c","tag-huffman-coding-c-program","tag-huffman-coding-c","tag-huffman-coding-example","tag-huffman-coding-example-pdf","tag-huffman-coding-example-with-probabilities","tag-huffman-coding-in-c","tag-huffman-coding-java","tag-huffman-coding-program-in-c","tag-huffman-coding-program-in-c-with-output","tag-huffman-coding-program-in-java","tag-huffman-coding-steps","tag-huffman-coding-tutorial","tag-huffman-coding-with-example","tag-huffman-compression-algorithm","tag-huffman-decoding","tag-huffman-encoding-and-decoding-example-in-java","tag-huffman-encoding-tree","tag-huffman-program-in-c","tag-huffman-tree","tag-huffman-tree-c","tag-image-compression-using-huffman-coding-in-java","tag-simple-huffman-coding-c","tag-simple-huffman-coding-in-c","tag-source-code-for-huffman-coding-in-c","tag-write-a-program-for-huffman-coding","tag-write-a-program-for-huffman-coding-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25056","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25056"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25056\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/25368"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25056"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25056"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25056"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}