Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1109/glocom...
Article . 2012 . Peer-reviewed
License: STM Policy #29
Data sources: Crossref
DBLP
Conference object . 2017
Data sources: DBLP
versions View all 2 versions
addClaim

Multi-level compress and forward coding for half-duplex relays

Authors: Jaweria Amjad; Momin Uppal; Saad B. Qaisar;

Multi-level compress and forward coding for half-duplex relays

Abstract

This paper presents a multi-level compress and forward coding scheme for a three-node relay network in which all transmissions are constrained to be from an M-ary PAM constellation. The proposed framework employs a uniform scalar quantizer followed by Slepian-Wolf coding at the relay. We first obtain a performance benchmark for the proposed scheme by deriving the corresponding information theoretical achievable rate. A practical coding scheme involving multi-level codes is then discussed. At the source node, we use multi-level low-density parity-check codes for error protection. At the relay node, we propose a multi-level distributed joint source-channel coding scheme that uses irregular repeat-accumulate codes, the rates of which are carefully chosen using the chain rule of entropy. For a block length of 2×105 symbols, the proposed scheme operates within 0.56 and 0.63 dB of the theoretical limits at transmission rates of 1.0 and 1.5 bits/sample, respectively.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    6
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
6
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!