Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders
Graph Chatbot
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.
In this paper we consider the finite-length performance of turbo codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] and of Repeat-Accumulate codes [3] to this ens ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
Abstract: The ring-on-ring bending principle allows the fabrication of simple, low-cost thick-film piezoresistive sensors for compressive forces in the 10 to 400 N range. However some imperfections are encountered in its basic embodiment, such as relativel ...
We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns ...
In spite of an immense interest from both the academic and the industrial communities, a practical multipleinput multiple-output (MIMO) transceiver architecture, capable of approaching channel capacity boundaries in realistic channel conditions remains lar ...
In this thesis, a new class of codes on graphs based on chaotic dynamical systems are proposed. In particular, trellis coded modulation and iteratively decodable codes on graphs are studied. The codes are designed by controlling symbolic dynamics of chaoti ...
We consider communication over a binary erasure channel with low density parity check codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code ensembles, in the asymptotic li ...
A method for communicating the content of a live data stream to a receiver using a plurality of channels comprising two encoder channels used to encode the live data content prior to transmission. Initially a plurality of segments of a live data stream are ...
Recently the decay of correlations between bits of low density generator matrix (LDGM) codes have been investigated by using high temperature expansions from statistical physics \cite{KuMa07}. In this work we apply these ideas to a special class of low den ...
In this paper, we present an overview of the JPWL standardization activity. JPWL is an extension of JPEG 2000 for the efficient transmission of JPEG 2000 images over an error-prone wireless network. More specifically, JPWL supports a set of tools for error ...
In off-line packetized streaming, rateless forward error correction (FEC) codes spectacularly improve the reliability of transmission over lossy networks. This success relies on time diversity, which in its turn relies on unrestricted buffering time at the ...
