Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yeong-Hyeon Kwon

dblp:33/2512 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Computer networks · 2 · 1 first-author

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.

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

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
modulation
0.112008
Optimal erasure selection of M-ary PAM signaling for errors and erasures decoding algorithms · IEEE Trans. Commun. 2008
Coding theory › error-correcting codes › decoding
errors-and-erasures decoding
0.112008
Optimal erasure selection of M-ary PAM signaling for errors and erasures decoding algorithms · IEEE Trans. Commun. 2008

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

threshold optimization · 0.2simulation · 0.2
YearPublicationVenuePosition
2008 Optimal erasure selection of M-ary PAM signaling for errors and erasures decoding algorithms
abstract
Erasure selection for errors-and-erasures decoding algorithms is investigated and analyzed, where declaring erasures provides additional gain for hard decision decoding. To derive an analytical criterion for optimal erasure selection, we first investigate erasure effects on decoding performance, by which a metric function for erasure selection is derived. From the derived metric, a suboptimal threshold is defined, which can be used for errors and erasures decoding of large code-distance channel codes. Moreover, application to M-ary (M>2) PAM constellation is also described. For verification of the proposed erasure threshold, simulation results with popular channel codes are included.
Yeong-Hyeon Kwon, Mi-Kyung Oh, Dong-Jo Park
IEEE Trans. Commun.1
2005 Reduced modulation modes for bit and power allocation in multi-carrier transmissions
abstract
A new scheme is proposed to optimally reduce the modulation modes for bit and power allocation algorithm in multi-carrier transmissions. By reducing the modulation modes, computational load and hardware complexity can be reduced without any performance degradation. When modulation modes for rectangular QAM are available at a transmitter, it is shown that the modulation modes for rectangular QAM can be reduced to those for square QAM which is the subset of rectangular QAM. After identifying a power allocation property of rectangular QAM, it is proved that the optimal allocation with square QAM has exactly the same performance as that with rectangular QAM. Numerical results show the reduction of computational load and verify our theoretic presentations.
Yeong-Hyeon Kwon, Dong-Jo Park
ICC2