Low complexity code design for the 2-user Gaussian multiple access channel

TL;DR: This paper provides the achievable rate of SWCNSQ based CF relaying as a performance benchmark, and presents a practical code design using low-density parity-check (LDPC) codes for error protection at the source, and nested scalar quantization plus irregular-repeat accumulation (IRA) code codes for CF coding at the relay.

TL;DR: BICM PNC systems exhibit different decoding behavior from conventional BICM point-to-point systems, and Gray mapping gives rise to best PNC rate for MUD-XOR and XOR-CD systems among several bits- to-symbol mappings under study.

TL;DR: Preliminary results indicate that conjunction of PIC and joint detection could provide substantial improvement without any complexity growth of the emitter in a MC-CDMA like up-link framework.

TL;DR: A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.

TL;DR: This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution.

TL;DR: The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon.

TL;DR: It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities.