Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Shannon Fanon

    Uploaded by

    TARUN SINGH SVNIT

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Shannon Fanon

    Uploaded by

    TARUN SINGH SVNIT
    29 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    29 views3 pages

    Shannon Fanon

    Uploaded by

    TARUN SINGH SVNIT

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    DIGITAL COMMUNICATION 2023

    EXPERIMENT NO-4.
    AIM: To study source coding using implementation of Shanon -Fano Coding on
    MATLAB.

    APPARATUS: MATLAB Software.

    THEORY:
    Shannon-Fano coding is a technique used in information theory and data compression for
    assigning variable-length codes to symbols based on their probabilities of occurrence
    1. Probability- Based :
    Shannon-Fano coding is a probabilistic coding technique used to represent symbols with
    shorter codes for more probable symbols and longer codes for less probable symbols. This
    results in efficient data compression by reducing the average code length.
    2. Symbol Probabilities:
    You start with a set of symbols that you want to encode, such as characters in a text document
    or values in a data stream. Each symbol is associated with a probability that represents its
    likelihood of occurring in the input data.
    3. Sorting Symbols:
    Symbols are sorted in descending order of their probabilities. The sorting process ensures that
    symbols with higher probabilities are assigned shorter codes and symbols with lower
    probabilities are assigned longer codes.
    4. Partitioning:
    The sorted list of symbols is divided into two subsets in a way that minimizes the difference
    in the probabilities between the subsets. This partitioning process is typically done recursively,
    dividing the symbols into two subsets, each with its own prefix (e.g., '0' and '1'). The goal is
    to create subsets where the sum of the probabilities in each subset is as close as possible.
    5. Code Assignment:
    Once the symbols are partitioned into subsets, binary codes are assigned to each subset. A
    common approach is to assign '0' to one subset and '1' to the other. The assigned codes are built
    by appending '0' or '1' to the existing codes of the subsets at each level of partitioning.
    6. Encoding:
    To encode the input data, replace each symbol with its corresponding binary code based on the
    partitioning and code assignment. The entire input data is then represented as a sequence of
    binary digits.
    7. Decoding:
    To decode the encoded data, you start from the beginning and traverse the code sequence. At
    each step, you follow the code's binary digits down the partition tree until you reach a leaf
    node. When you reach a leaf node, you output the corresponding symbol and reset the traversal
    to the root . Continue this process until you have decoded the entire input data.

    S.V.N.I.T, SURAT
    DIGITAL COMMUNICATION 2023
    MATLAB Code:

    clc;
    clear all;

    p=[.27 .20 .17 .16 .06 .06 .04 .04];


    sta=[];
    ar=[];
    coded=[];
    other=[];

    first=0;
    final=length(p);
    sta=[first final];

    for f=1:length(p)
    other=[];
    ar=[];
    for h=1:(length(sta)-1)
    first=sta(h)+1;
    final=sta(h+1);
    if(first>=final)
    other=[other; 2];
    continue;
    end
    asum=0;
    difmat=[];
    for i=first:final
    asum=asum+p(i);
    resum=0;
    for j=i+1:final;
    resum=resum+p(j);
    end
    dif=abs(asum-resum);
    difmat=[difmat dif];
    end
    small=min(difmat);
    k=1;
    for i=first:final
    if(small==difmat(k))
    break;
    end
    k=k+1;
    end
    index=i;
    ar=[ar index];
    ind=(index+1)-first;
    remind=final-index ;
    other=[other; zeros(ind,1); ones(remind,1)];
    end
    sta=[ar sta];
    sta=sort(sta);
    coded=[coded other];
    if(length(sta)>length(p)) %break when all sub groups have one element
    break;
    end
    end

    S.V.N.I.T, SURAT
    DIGITAL COMMUNICATION 2023
    len=[];
    for i=1:length(p)
    word=[];
    for j=1:f
    if(coded(i,j)==2)
    break;
    end
    word=[word coded(i,j)];
    end
    len=[len length(word)];
    fprintf('\nSymbol %d code ==> ',i);
    disp(word)
    end

    OUTPUT:

    Symbol 1 code ==> 0 0

    Symbol 2 code ==> 0 1

    Symbol 3 code ==> 1 0 0

    Symbol 4 code ==> 1 0 1

    Symbol 5 code ==> 1 1 0 0

    Symbol 6 code ==> 1 1 0 1

    Symbol 7 code ==> 1 1 1 0

    Symbol 8 code ==> 1 1 1 1

    S.V.N.I.T, SURAT

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy