Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
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.
A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...
Shannon, in his seminal work, formalized the transmission of data over a communication channel and determined its fundamental limits. He characterized the relation between communication rate and error probability and showed that as long as the communicatio ...
Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as fo ...
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 provably achieve the capacity of a wide array of channels under successive decoding. However, in terms of some practical aspects, these codes do not perform optimally and need further improvement. In this paper, we consider two such aspects: un ...
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 ...
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 ...
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 ...
Iterative detection and decoding (IDD) in multiple-input multiple-output (MIMO) wireless systems is known to achieve near channel capacity. The high computational complexity of IDD, however, poses significant challenges for practical implementations (in ter ...
In this paper, polar codes for the m-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Arıkan’s polarization technique applied individually to each user transforms independent uses of a m-user binary input MAC into suc ...
Institute of Electrical and Electronics Engineers2012
