Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Arıkan, Erdal"'
Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes is given. A
Externí odkaz:
http://arxiv.org/abs/2012.04990
Autor:
Arıkan, Erdal
This note is a written and extended version of the Shannon Lecture I gave at 2019 International Symposium on Information Theory. It gives an account of the original ideas that motivated the development of polar coding and discusses some new ideas for
Externí odkaz:
http://arxiv.org/abs/1908.09594
Autor:
Jayram, T. S., Arikan, Erdal
We give a unified treatment of some inequalities that are used in the proofs of channel polarization theorems involving a binary-input discrete memoryless channel.
Comment: 5 pages
Comment: 5 pages
Externí odkaz:
http://arxiv.org/abs/1607.00355
Autor:
Arıkan, Erdal
Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either given or
Externí odkaz:
http://arxiv.org/abs/1511.04838
Autor:
Arıkan, Erdal
A packing lemma is proved using a setting where the channel is a binary-input discrete memoryless channel $(\mathcal{X},w(y|x),\mathcal{Y})$, the code is selected at random subject to parity-check constraints, and the decoder is a joint typicality de
Externí odkaz:
http://arxiv.org/abs/1504.05793
Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: spatially coupled Low-Density Parity-Check (LDPC) codes, non-binary LDPC codes, and polar coding.
Comment: Accepted for publicati
Comment: Accepted for publicati
Externí odkaz:
http://arxiv.org/abs/1504.03916
Autor:
Arıkan, Erdal
We consider the evolution of variance of entropy (varentropy) in the course of a polar transform operation on binary data elements (BDEs). A BDE is a pair $(X,Y)$ consisting of a binary random variable $X$ and an arbitrary side information random var
Externí odkaz:
http://arxiv.org/abs/1501.05005
Autor:
Dizdar, Onur, Arıkan, Erdal
This paper proposes a high-throughput energy-efficient Successive Cancellation (SC) decoder architecture for polar codes based on combinational logic. The proposed combinational architecture operates at relatively low clock frequencies compared to se
Externí odkaz:
http://arxiv.org/abs/1412.3829
Autor:
Arikan, Erdal
The notion of source polarization is introduced and investigated. This complements the earlier work on channel polarization. An application to Slepian-Wolf coding is also considered. The paper is restricted to the case of binary alphabets. Extension
Externí odkaz:
http://arxiv.org/abs/1001.3087