Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    9 21P

    Uploaded by

    anisettimanikanta

    Copyright:

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

    9 21P

    Uploaded by

    anisettimanikanta
    6 views1 page

    Original Title

    769764-9-21P

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    6 views1 page

    9 21P

    Uploaded by

    anisettimanikanta

    Copyright:

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

    769764-9-21P AID: 124831 | 19/06/2021

    Consider a noise less channel, for noise less channel that output is same as that of input
    then conditional entropy,
    X
    H    H  X ,Y   H  X 
    Y 
     H  X, X   H  X 
     H X H X
    0
    Therefore for noise less channel,
    X
    H 0
    Y 

    Therefore,
    X 
    H  X ,Y   H   H Y
    Y 
     H Y
    I  X ,Y   H  X 
    Similarly,
    X
    H 0
    When,  Y  then,
    H  X ,Y   H  X 
    Therefore,
    I  X ,Y   H  Y 
    Hence, proved.

    Channel capacity of a noise less channel can be expressed as,


    C  max I  X , Y 
     max  H  X  orH  Y  
    C  max  H  X  orH  Y  
    Hence, channel capacity is bits/symbol.

    You might also like