Hongsil Jeong

dblp:120/8067 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Coding theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation › coded modulation
bit-interleaved coded modulation
0.612022
Analysis and Design of QC-LDPC Coded BICM Ensembles Based on RCA Density Evolution · IEEE Trans. Commun. 2022
Physical-layer communications › modulation
coded modulation
0.612022
Analysis and Design of QC-LDPC Coded BICM Ensembles Based on RCA Density Evolution · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes › decoding › iterative decoding
density evolution
0.612022
Analysis and Design of QC-LDPC Coded BICM Ensembles Based on RCA Density Evolution · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes
LDPC codes
0.612022
Analysis and Design of QC-LDPC Coded BICM Ensembles Based on RCA Density Evolution · IEEE Trans. Commun. 2022
Coding theory › channel coding
polar codes
0.412019
Rate Matching for Polar Codes Based on Binary Domination · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › code construction › code modification
puncturing and shortening
0.412019
Rate Matching for Polar Codes Based on Binary Domination · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › forward error correction
rate matching
0.412019
Rate Matching for Polar Codes Based on Binary Domination · IEEE Trans. Commun. 2019

Methods — techniques the papers use, named apart from their topics

reciprocal channel approximation · 1.1protograph design · 1.1density evolution · 0.4binary domination · 0.4
YearPublicationVenuePosition
2026 Effective Masking Set for False Alarm Mitigation in Blind Detection of Polar Codes
Hongsil Jeong, Seijoon Shim
ICC2
2022 A Design of Layered Decoding for QC-LDPC Codes Based on Reciprocal Channel Approximation
abstract
This paper presents an analytically designed layered decoding algorithm for quasi-cyclic low-density parity-check (QC-LDPC) codes in the 5th Generation (5G) New Radio (NR) mobile communication system. First, a layered density evolution (DE) based on reciprocal channel approximation (RCA) is newly developed to accurately reflect the layered decoding operation in the decoder design. Using this technique, a single nested sequence is optimized in a greedy way to configure the processing order for any given number of layers. The error-correction performance is improved by up to 0.15 dB, while the number of iterations is reduced by about one simultaneously.
Min Jang, Kyeongyeon Kim, Seho Myung, Hongsil Jeong, Kyung-Joong Kim 0002, Sang-Hyo Kim
ISIT4
2022 Analysis and Design of QC-LDPC Coded BICM Ensembles Based on RCA Density Evolution
abstract
This paper presents density evolution (DE) techniques based on reciprocal channel approximation (RCA) for general bit-interleaved coded modulation (BICM) systems. The original RCA-based DE (RCA-DE) technique is implemented under the assumption of binary-input additive white Gaussian noise channels (BI-AWGNCs). In BICM systems, however,$M$-ary modulation schemes are generally used, and they can be regarded as to be a parallel transmission of$\log _{2} M$bits. Thus,$\log _{2} M$separate bit-level channels, which are not Gaussian equivalent, need to be considered. In order to extend the conventional RCA-DE technique to BICM systems, we first establish a model of protograph BICM ensembles. Two methods are developed based on the bit error rate (BER) and the BICM capacity in order to find a corresponding BI-AWGNC that models each of the bit-level channels. Using these methods, we implement the protograph RCA-DE technique for BICM systems and show that it achieves an accurate estimation. As a practical application of the proposed RCA-DE method, we design bit interleavers in order to achieve better BICM performance in the 3GPP New Radio (NR) LDPC coding system. Numerical results show that performance gain of up to 0.3 dB is consistently achieved over a wide range of parameter values.
Min Jang, Hongsil Jeong, Seho Myung, Kyung-Joong Kim 0002, Sang-Hyo Kim
IEEE Trans. Commun.2
2019 Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination
abstract
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 puncturing) or to be shortened are governed by binary domination. In particular, we show that binary domination completely determines incapable or shortened bit patterns for polar codes, and that all the possible incapable or shortened bit patterns can be identified. We then present the patterns of the corresponding encoder output bits to be punctured or fixed, when the incapable or shortened bits are given.
Min Jang, Seok-Ki Ahn, Hongsil Jeong, Kyung-Joong Kim 0002, Seho Myung, Sang-Hyo Kim, Kyeongcheol Yang
ISIT3
2019 Rate Matching for Polar Codes Based on Binary Domination
abstract
In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination. For punctured and shortened polar codes, we prove that the partial order by binary domination completely determines both incapable bit patterns (by puncturing) and fixed bit patterns (by shortening). In particular, we give a necessary and sufficient condition for an encoder output bit to be fixed by additionally shortening a single encoder input bit, as well as a necessary and sufficient condition for an encoder input bit to be made incapable by additionally puncturing a single encoder output bit. We also identify all the puncturing bit patterns yielding a given incapable bit pattern. These results provide a guidance to design a practical rate-matching scheme for polar codes. As an example, we present a rate-matching scheme based on our analytical observations. Numerical results show that it performs well over a wide range of code lengths and rates, compared with conventional rate-matching schemes.
Min Jang, Seok-Ki Ahn, Hongsil Jeong, Kyung-Joong Kim 0002, Seho Myung, Sang-Hyo Kim, Kyeongcheol Yang
IEEE Trans. Commun.3
2004 Adaptive spatial modulation for MIMO-OFDM
abstract
In this paper we propose and analyze an adaptive spatial modulation scheme for MIMO-OFDM systems which adaptively and optimally selects one of the following transmission modes: diversity, spatial multiplexing and a hybrid combination of these two modes. Two criterias are used for mode selection, namely, the minimum Euclidean distance and a simple threshold based stochastic method exploiting channel quality estimations. We consider practically implementable antenna configuration with four transmit antennas and two or four receive antennas. Simulation results show that considerable BER performance gains can be obtained by the adaptive spatial modulation system, as compared with systems based on fixed modulation schemes.
Chan-Byoung Chae, Marcos D. Katz, Changho Suh, Hongsil Jeong
WCNC4