Channel coding and modulation based on chaotic systems
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.
We consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over a binary-input memoryless symmetric channel W. In particular, we study the asymptotics of the cumulative distribution, P(Z(n ...
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
The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...
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 ...
This paper considers a framework where data from correlated sources are transmitted with help of network coding in ad-hoc network topologies. The correlated data are encoded independently at sensors and network coding is employed in the intermediate nodes ...
Institute of Electrical and Electronics Engineers2013
Building on polar code constructions proposed by
the authors for deterministic broadcast channels, two theorems
are introduced in the present paper for noisy two-user broadcast
channels. The theorems establish polar code constructions for two
important ...
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 ...
In their recent paper, Chang et al. presented a method for iterative decoding of FEC-based multiple description codes in image transmission. In this correspondence we clarify that an outer interleaver used in the above work was previously proposed for the ...
Institute of Electrical and Electronics Engineers2013
A challenging problem related to the design of polar codes is "robustness against channel parameter variations'', as stated in Arıkan's original work. In this paper, we describe how the problem of robust polar code design can be viewed as a mismatch decodi ...
We investigate the problem of distributed sensors' failure detection in networks with a small number of defective sensors, whose measurements differ significantly from neighbouring sensor measurements. We build on the sparse nature of the binary sensor fai ...
