Concept

Codes de parité à faible densité

Publications associées (416)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the Convergence Speed of Spatially Coupled LDPC Ensembles

Vahid Aref

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemb ...

2013

Polar coding for arbitrary DMCs

Emre Telatar, Rajai Nasser

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. The block error probability under successive cancellation decoding decays exponentially with the square root of the block length. It is ...

2013

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes

Rüdiger Urbanke, Nicolas Macris, Rafah El-Khatib

Spatial coupling has recently emerged as a powerful paradigm to construct graphical models that work well under low-complexity message-passing algorithms. Although much progress has been made on the analysis of spatially coupled models under message passin ...

Ieee2013

A Class of Generalized RS-Codes with Faster Encoding and Decoding Algorithms

Mohammad Amin Shokrollahi

In this paper we study a particular class of generalized Reed-Solomon codes and introduce encoding and decoding algorithms for such codes that speed up current hardware implementations by a factor p wherein p can be any divisor of the size of the multiplic ...

Ieee2013

A Parallelized Layered QC-LDPC Decoder for IEEE 802.11ad

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Alessandro Cevrero, Nicholas Alexander Preyss

We present a doubly parallelized layered quasi-cyclic low density parity-check decoder for the emerging IEEE 802.11ad multigigabit wireless standard. The decoding algorithm is equivalent to a nonparallelized layered decoder and, thus, retains its favorable ...

IEEE2013

Polar Codes for the Two-User Multiple-Access Channel

Emre Telatar, Eren Sasoglu

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded tran ...

Institute of Electrical and Electronics Engineers2013

Polarization Theorems for Arbitrary DMCs

Emre Telatar, Rajai Nasser

A polarization phenomenon in a special sense is shown for an arbitrary discrete memoryless channel (DMC) by imposing a quasigroup structure on the input alphabet. The same technique is used to derive a polarization theorem for an arbitrary multiple access ...

IEEE2013

LLR Compression for BICM Systems Using Large Constellations

Bixio Rimoldi, Stefano Rosati

Digital video broadcasting (DVB-C2) and other modern communication standards increase diversity by means of a symbol-level interleaver that spans over several codewords. Deinterleaving at the receiver requires a large memory, which has a significant impact ...

Institute of Electrical and Electronics Engineers2013

Scaling Exponent of List Decoders with Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Ieee2013

A Lower Bound on Achievable Rates by Polar Codes with Mismatch Polar Decoding

Mine Alsan

In this paper we show that mismatched polar codes over symmetric B-DMCs symmetrized under the same permutation can achieve rates of at least I (W, V) bits whenever I (W, V) > 0, where W denotes the communication channel, V the mismatched channel used in th ...

Ieee2013