Zobrazeno 1 - 10
of 271
pro vyhledávání: '"Kyeongcheol Yang"'
Publikováno v:
IEEE Access, Vol 11, Pp 97699-97715 (2023)
In the conventional successive cancellation (SC) decoder for polar codes, all the future bits to be estimated later are treated as random variables. However, polar codes inevitably involve frozen bits, and their concatenated coding schemes also inclu
Externí odkaz:
https://doaj.org/article/83644ade167248eca95ffba2fa8e7747
Autor:
Daeyeol Yang, Kyeongcheol Yang
Publikováno v:
IEEE Access, Vol 8, Pp 163758-163768 (2020)
The successive-cancellation flip (SCFlip) decoder and its variants provide a significant coding gain with the average complexity practically identical to that of the successive cancellation (SC) decoder in a wide range of signal-to-noise ratios (SNRs
Externí odkaz:
https://doaj.org/article/084a2168b1674533807575f14818e55c
Publikováno v:
IEEE Transactions on Communications. 69:5701-5713
Shaped polar codes were recently proposed to improve the spectral efficiency of polar coded modulation, based on probabilistic shaping. The key principle for them is to adjust the probability of occurrence of 1’s in each codeword by introducing the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7de66cf32154720527d312107d2f5c1c
https://doi.org/10.1109/tcomm.2021.3093314
https://doi.org/10.1109/tcomm.2021.3093314
Publikováno v:
IEEE Transactions on Communications. 69:4254-4266
Concatenated polar codes under successive cancellation list (SCL) decoding have excellent error-correction performance. However, their expected error-detection capability becomes degraded, when we increase the list size of the SCL decoder in order to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0f4dea0ac314770ea6359e813aa2e05
https://doi.org/10.1109/tcomm.2021.3070610
https://doi.org/10.1109/tcomm.2021.3070610
Autor:
Kyeongcheol Yang, Daeyeol Yang
Publikováno v:
IEEE Transactions on Wireless Communications. 19:8261-8271
Integer-forcing (IF) receivers are a class of linear multiple-input multiple-output (MIMO) receivers to achieve near-optimal performance under quasi-static channels, with almost the same complexity as that of conventional linear receivers. Instead of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c02faca233af560ca41354f51c09084a
https://doi.org/10.1109/twc.2020.3021102
https://doi.org/10.1109/twc.2020.3021102
Autor:
Min Jang, Hong-Sil Jeong, Kyeongcheol Yang, Seho Myung, Sang-Hyo Kim, Kyung-Joong Kim, Seok-Ki Ahn
Publikováno v:
IEEE Transactions on Communications. 67:6668-6681
In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination which plays a key role in polar code construction. We first prove that the orders of encoder input bits to be made incapable (by p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0478c90249d21ca2517735674fa1867c
https://doi.org/10.1109/tcomm.2019.2930502
https://doi.org/10.1109/tcomm.2019.2930502
Publikováno v:
IEEE Transactions on Broadcasting. 65:489-495
Recently, low-density parity-check (LDPC) codes have been adopted in Advanced Television Systems Committee 3.0 and 3rd Generation Partnership Project 5G standards. In this paper, we present their structures in detail. They are delicately designed, ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8743ac1f7d6cd01c4f0739a1e1a3149
https://doi.org/10.1109/tbc.2018.2874541
https://doi.org/10.1109/tbc.2018.2874541
Autor:
Kyeongcheol Yang, Sunghye Cho
Publikováno v:
IEEE Wireless Communications Letters. 8:109-112
The min-sum algorithm as an approximation of the sum-product algorithm (SPA) for decoding of LDPC codes has much lower computational complexity, but slightly worse performance than the SPA. However, severe performance degradation might occur when it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e93a83ee45fe89acc156e7d8d94d984f
https://doi.org/10.1109/lwc.2018.2859993
https://doi.org/10.1109/lwc.2018.2859993
Publikováno v:
IEEE Transactions on Communications. 66:5028-5040
Short cycles in a nonbinary low-density parity-check (NB-LDPC) code may be even more harmful to its performance if they do not satisfy the so-called full rank condition (FRC). This is because they may induce low-weight codewords or absorbing sets in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5568aeb5d8192b91ae5fac1f32ffc8a
https://doi.org/10.1109/tcomm.2018.2849076
https://doi.org/10.1109/tcomm.2018.2849076
Publikováno v:
Journal of Communications and Networks. 20:345-353
Block turbo codes (BTCs) under iterative decoding are product codes showing excellent performance with reasonable complexity, whose component codes are conventionally decoded in two stages. The Chase algorithm is employed in the first stage to make a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b40acf99245220168633ae17878b8c89
https://doi.org/10.1109/jcn.2018.000050
https://doi.org/10.1109/jcn.2018.000050