Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Mohammad Rowshan"'
Publikováno v:
IEEE Open Journal of the Communications Society, Vol 5, Pp 2585-2685 (2024)
Channel coding plays a pivotal role in ensuring reliable communication over wireless channels. With the growing need for ultra-reliable communication in emerging wireless use cases, the significance of channel coding has amplified. Furthermore, minim
Externí odkaz:
https://doaj.org/article/42dd3bc37c3f4b03a9485641fadb4220
Autor:
Mohammad Rowshan, Emanuele Viterbo
Publikováno v:
Entropy, Vol 24, Iss 9, p 1210 (2022)
In the successive cancellation (SC) list decoding, the tree pruning operation retains the L best paths with respect to a metric at every decoding step. However, the correct path might be among the L worst paths due to the imposed penalties. In this c
Externí odkaz:
https://doaj.org/article/eefc6abac7f545e0992e645e3975bdd4
Autor:
Mohammad Rowshan, Emanuele Viterbo
Publikováno v:
IEEE Transactions on Communications. 70:7160-7168
Autor:
Mohammad Rowshan, Jinhong Yuan
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Publikováno v:
IEEE Transactions on Vehicular Technology. 70:1434-1447
In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Ar{\i}kan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are
Autor:
Mohammad Rowshan, Emanuele Viterbo
Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a precoding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e8642c5243ac3ad7ce8d2b1cb76b152
http://arxiv.org/abs/2103.12483
http://arxiv.org/abs/2103.12483
Autor:
Emanuele Viterbo, Mohammad Rowshan
Publikováno v:
CCWC
In successive cancellation list (SCL) decoding, the tree pruning operation retains the $L$ best paths with respect to a metric at every decoding step. However, the correct path might be among the $L$ worst paths due to imposed penalties. In this case
Publikováno v:
CCWC
The quantization of intermediate log-likelihood ratios (LLRs) is a concern in the hardware implementation of the LLR-based tree search algorithms such as successive cancellation list (SCL) and sequential (SCS) decoding for polar codes (particularly f
Autor:
Emanuele Viterbo, Mohammad Rowshan
Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::673f0480f43a318025acbb02bc2b4590