Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Arman Fazeli"'
Publikováno v:
Entropy, Vol 23, Iss 7, p 841 (2021)
Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation deco
Externí odkaz:
https://doaj.org/article/f05dc48573ae4a2da6568c6c99d0390b
Autor:
Sharad Sambhwani, Zdravko Boos, Sidharth Dalmia, Arman Fazeli, Bertram Gunzelmann, Anatoliy Ioffe, Murali Narasimha, Francesco Negro, Laxminarayana Pillutla, John Zhou
Publikováno v:
IEEE Wireless Communications. 29:6-8
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::954b9a6a0d657aadcf767af15857b897
https://doi.org/10.1109/mwc.2022.9749182
https://doi.org/10.1109/mwc.2022.9749182
Publikováno v:
IEEE Transactions on Information Theory. :1-1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e4c8b4a3b81a71a7e8f2c01f6fc8b1c
https://doi.org/10.1109/tit.2023.3243191
https://doi.org/10.1109/tit.2023.3243191
Publikováno v:
2021 IEEE Globecom Workshops (GC Wkshps).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfc97f3cad9f8f0c01ac70a474e8c7d1
https://doi.org/10.1109/gcwkshps52748.2021.9681935
https://doi.org/10.1109/gcwkshps52748.2021.9681935
Publikováno v:
ISIT
The problem of channel polarization for an arbitrary sequence $\{W_{i}\}_{i=0}^{n-1}$ of $n$ independent channels, referred to as a nonstationary sequence of channels, is considered. Also, each of the channels is used only once for communication. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb09f0c6ffe37e613369798b5accd371
https://doi.org/10.1109/isit45174.2021.9518110
https://doi.org/10.1109/isit45174.2021.9518110
Publikováno v:
ISIT
Successive-cancellation list (SCL) decoding is a widely used and studied decoding algorithm for polar codes. For short blocklengths, empirical evidence shows that SCL decoding with moderate list sizes (say, $L \leq 32$ ) closely matches the performan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4817363f15d7610bb6e655026036ce3f
https://doi.org/10.1109/isit45174.2021.9517940
https://doi.org/10.1109/isit45174.2021.9517940
Publikováno v:
ISIT
In this work, we present a deterministic algorithm for computing the entire weight distribution of polar codes. As the first step, we derive an efficient recursive procedure to compute the weight distribution that arises in successive cancellation de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9dcb73c8b7529eeb5d2c9e3c7bf1ff5
https://doi.org/10.1109/isit45174.2021.9517950
https://doi.org/10.1109/isit45174.2021.9517950
Publikováno v:
ICC
Recent advances in the flash memory technology call for more efficient error-correction codes (ECCs) than the conventional, yet very popular, ones such as BCH codes. The ability to make multiple voltage reads allows one to estimate soft values at the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::555ed73f055ecc3f3d5da35112adcd50
https://doi.org/10.1109/icc42927.2021.9500536
https://doi.org/10.1109/icc42927.2021.9500536
Publikováno v:
Entropy
Entropy, Vol 23, Iss 841, p 841 (2021)
Volume 23
Issue 7
ISIT
Entropy, Vol 23, Iss 841, p 841 (2021)
Volume 23
Issue 7
ISIT
Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short block lengths is far from optimal. Arikan has recently p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9ca62b41183fb9865c62e70d8bd78cb
http://arxiv.org/abs/2005.13711
http://arxiv.org/abs/2005.13711
Autor:
Arman Fazeli, Alexander Vardy, Seyyed Ali Hashemi, Andrea Goldsmith, John M. Cioffi, Marco Mondelli
Publikováno v:
ISIT
This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements $P$ that can perform SSC decoding operatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d06668cf24f3038ab2f502816b50cfcf