Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Mustafa Cemil Coskun"'
Autor:
Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier, Henry D. Pfister
A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c71fbf9e1f1d2735cde15c73a127dd34
https://doi.org/10.1109/tit.2022.3207802
https://doi.org/10.1109/tit.2022.3207802
Publikováno v:
IEEE Communications Letters. 25:1786-1790
A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via successive cancellation (SC) decoding and the constraints imposed by th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93e28940200e1038d10188b9d0ff44cd
https://doi.org/10.1109/lcomm.2021.3061650
https://doi.org/10.1109/lcomm.2021.3061650
Autor:
Mustafa Cemil Coskun, Peihong Yuan
Publikováno v:
ITW
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0d7ef5e3fd3414eacfda8825018fb10
https://doi.org/10.1109/itw48936.2021.9611445
https://doi.org/10.1109/itw48936.2021.9611445
Publikováno v:
IEEE Transactions on Communications. 67:1521-1536
We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the practically r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e59d4c7c98ea9d887d5c44de768c9560
https://doi.org/10.1109/tcomm.2018.2874993
https://doi.org/10.1109/tcomm.2018.2874993
Autor:
Mustafa Cemil Coskun, Henry D. Pfister
This work identifies information-theoretic quantities that are closely related to the required list size on average for successive cancellation list (SCL) decoding to implement maximum-likelihood decoding over general binary memoryless symmetric (BMS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8593b1d5785b51bc1fb646dadc1fd963
Autor:
Henry D. Pfister, Mustafa Cemil Coskun
Publikováno v:
SPCOM
Successive cancellation list decoding of polar codes provides very good performance for short to moderate block lengths. However, the list size required to approach the performance of maximum-likelihood decoding is still not well understood theoretic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2189de420fe007d813cac4c244b32706
https://doi.org/10.1109/spcom50965.2020.9179593
https://doi.org/10.1109/spcom50965.2020.9179593
Publikováno v:
ISIT
A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder assigns a dummy variable to an information bit whenever it is erased
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ace24719160f212a7a955f52ca7e8b78
http://arxiv.org/abs/2004.05969
http://arxiv.org/abs/2004.05969
Publikováno v:
ACSSC
The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This setting is of particular interest for applications requiring low-compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dab3188d89fd5d4513ddaf1d41cbde81
https://elib.dlr.de/131881/
https://elib.dlr.de/131881/
Publikováno v:
ACSSC
In this paper, the advantages of list decoding for short packet transmission over fading channels with an unknown state are illustrated. The principle is applied to polar codes (under successive cancellation list decoding) and to general short binary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::461d9ea30e5075428dae93114d7ddd91
https://elib.dlr.de/131872/
https://elib.dlr.de/131872/
This letter proposes successive cancellation list (SCL) decoding of product codes with Reed--Muller (RM) component codes. SCL decoding relies on a product code description based on the $2\times 2$ Hadamard kernel, which enables interpreting the code
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2765c1aa4f404891a46aa9c42e46c8f9
http://arxiv.org/abs/1908.10397
http://arxiv.org/abs/1908.10397