Rice Univesrity Logo
    • FAQ
    • Deposit your work
    • Login
    View Item 
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • George R. Brown School of Engineering
    • Electrical and Computer Engineering
    • ECE Publications
    • View Item
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • George R. Brown School of Engineering
    • Electrical and Computer Engineering
    • ECE Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Joint Source Channel Coding for Discrete Memoryless Channels

    Thumbnail
    Name:
    Bha2000May2JointSourc.PS
    Size:
    597.0Kb
    Format:
    Postscript
    View/Open
    Author
    Bharadwaj, Vinay
    Date
    2000-05-20
    Abstract
    The design of optimal joint source/channel coding and decoding is examined for dis­ crete memoryless channels with end­to­end distortion as the criterion for reliable com­ munication. Joint source/channel encoders which map sequences of source symbols directly to sequences of channel symbols without any intermediate "bit" representa­ tion of source are considered. Optimum joint source/channel decoder that minimizes end­to­end distortion for a given encoder mapping is derived. The encoder mapping can be many to one, in the sense that many source sequences can be mapped to one sequence of channel symbols. To begin with, as an exercise, random coding bound on end­to­end distortion is derived for a general Maximum A Posteriori (MAP) decoder which has some estimate on the apriori probabilities of source symbols. It is shown that, the KL distance of the actual apriori probabilities with the estimated ones plays an important role. Then, a random coding bound on end­to­end distortion is derived with our optimal minimum distortion decoder mentioned above for the case when all source symbols are equally likely. It is shown that the performance increase with min­ imum distortion decoding as opposed to MAP (same as Maximum Likelihood (ML) decoding in this case when all source symbols are equally likely) is characterized by the faster decay of end­to­end distortion with respect to channel use.
    Description
    Masters Thesis
    Citation
    V. Bharadwaj, "Joint Source Channel Coding for Discrete Memoryless Channels," Masters Thesis, 2000.
    Keyword
    joint source/channel; Maximum A Posteriori (MAP); Maximum Likelihood (ML); decoding; joint source/channel; More... Maximum A Posteriori (MAP); Maximum Likelihood (ML); decoding Less...
    Type
    Thesis
    Citable link to this page
    https://hdl.handle.net/1911/19731
    Metadata
    Show full item record
    Collections
    • ECE Publications [1468]

    Home | FAQ | Contact Us | Privacy Notice | Accessibility Statement
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892
    Site Map

     

    Searching scope

    Browse

    Entire ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsType

    My Account

    Login

    Statistics

    View Usage Statistics

    Home | FAQ | Contact Us | Privacy Notice | Accessibility Statement
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892
    Site Map