Publication

LDPC codes for Gaussian broadcast channels

2004
Conference Papers

Abstract

We study coding over a class of two-user broadcast channels with additive white Gaussian noise and fading known at the receivers only. Joint decoding of low-density parity-check codes is analyzed. The message update rule at the mapping node linking the users' codes is derived and is shown to exhibit an interesting soft interference cancellation property. Good degree distributions are found using the differential evolution optimization technique and extrinsic information transfer analysis. The corresponding codes have rates close to the boundary of the achievable region for binary constrained input channels, both with and without fading. Simulation results for moderate blocklength show that the optimized codes operate within 1 dB of their thresholds.

Official source

https://infoscience.epfl.ch/entities/publication/f577726d-bcae-45e3-ad7b-e70fe1e44de9

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2004
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/f577726d-bcae-45e3-ad7b-e70fe1e44de9

About this result

Related concepts (32)

Low-density parity-check code

In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel. An LDPC code is constructed using a sparse Tanner graph (subclass of the bipartite graph). LDPC codes are , which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical maximum (the Shannon limit) for a symmetric memoryless channel.

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is that the sender encodes the message in a redundant way, most often by using an error correction code or error correcting code (ECC). The redundancy allows the receiver not only to detect errors that may occur anywhere in the message, but often to correct a limited number of errors.

Erasure code

In coding theory, an erasure code is a forward error correction (FEC) code under the assumption of bit erasures (rather than bit errors), which transforms a message of k symbols into a longer message (code word) with n symbols such that the original message can be recovered from a subset of the n symbols. The fraction r = k/n is called the code rate. The fraction k’/k, where k’ denotes the number of symbols required for recovery, is called reception efficiency.

Related publications (12)

LDPC codes for Gaussian broadcast channels

Chat with Graph Search

A Full-Custom Time-Domain Unary Sorter for Soft-Information Decoding in 65 nm CMOS

A methodology for the rigorous verification of plasma simulation codes

MATHICSE Technical Report : A certified reduced basis method for PDE-constrained parametric optimization problems by an adjoint-based approach