• Libraries
    • Log in to:
    View Item 
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Distributed joint source-channel code design for GMAC using irregular LDPC codes

    Thumbnail
    View/Open
    1687-1499-2014-3.xml (231.4Kb)
    1687-1499-2014-3.pdf (1.301Mb)
    Date
    2014-01-09
    Author
    Shahid, Iqbal
    Yahampath, Pradeepa
    Metadata
    Show full item record
    Abstract
    Abstract Separate source and channel coding is known to be sub-optimal for communicating correlated sources over a Gaussian multiple access channel (GMAC). This paper presents an approach to designing distributed joint source-channel (DJSC) codes for encoding correlated binary sources over a two-user GMAC, using systematic irregular low-density parity check (LDPC) codes. The degree profile defining the LDPC code is optimized for the joint source probabilities using extrinsic information transfer (EXIT) analysis and linear programming. A key issue addressed is the Gaussian modeling of log-likelihood ratios (LLRs) generated by nodes representing the joint source probabilities in the combined factor graph of the two LDPC codes, referred to as source-channel factor (SCF) nodes. It is shown that the analytical expressions based on additive combining of incoming LLRs, as done in variable nodes and parity check nodes of the graph of a single LDPC code, cannot be used with SCF nodes. To this end, we propose a numerical approach based on Monte-Carlo simulations to fit a Gaussian density to outgoing LLRs from the SCF nodes, which makes the EXIT analysis of the joint decoder tractable. Experimental results are presented which show that LDPC codes designed with the proposed approach outperforms previously reported DJSC codes for GMAC. Furthermore, they demonstrate that when the sources are strongly dependent, the proposed DJSC codes can achieve code rates higher than the theoretical upper-bound for separate source and channel coding.
    URI
    http://hdl.handle.net/1993/23269
    DOI
    10.1186/1687-1499-2014-3
    Collections
    • Price Faculty of Engineering Scholarly Works [48]
    • University of Manitoba Scholarship [1952]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of MSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV