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

Heon Huh

dblp:98/6930 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2011
0000-0002-0041-9253ORCID · corroborated

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

Computer networks · 2 · 2 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › synchronization
frame synchronization
0.112011
Frame Synchronization of Coded Modulations in Time-Varying Channels via Per-Survivor Processing · IEEE Trans. Commun. 2011
Physical-layer communications
synchronization
0.112011
Frame Synchronization of Coded Modulations in Time-Varying Channels via Per-Survivor Processing · IEEE Trans. Commun. 2011
Coding theory › error-correcting codes
coded modulation
0.012011
Frame Synchronization of Coded Modulations in Time-Varying Channels via Per-Survivor Processing · IEEE Trans. Commun. 2011

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

trellis path search · 0.2per-survivor processing · 0.2maximum a posteriori estimation · 0.2
YearPublicationVenuePosition
2011 Frame Synchronization of Coded Modulations in Time-Varying Channels via Per-Survivor Processing
abstract
In this letter, an optimum frame synchronizer is proposed for coded modulations in channels with uncertainties. Coded modulations include various frame synchronization scenarios, e.g., convolutionally coded transmissions and nonlinear modulations with memory. Frame synchronization is proposed as a maximum a posteriori probability estimation implemented using trellis path search for Markov chain decoding. In addition, time-varying uncertainties such as frequency offset and phase noise are jointly estimated via per-survivor processing as frame synchronization proceeds. The proposed frame synchronizer exploits the coding gain of coded modulations to achieve better performance than conventional frame synchronizers. We show that the resulting frame synchronizer consists of a correlation term and two data correction terms. Numerical results show that the proposed frame synchronizer is robust to uncertainties at the receiver and it exhibits improved performance.
Heon Huh, James V. Krogmeier
IEEE Trans. Commun.1
2006 A Unified Approach to Optimum Frame Synchronization
abstract
In this paper, we present a unified approach for optimum frame synchronization where the observed symbols are modeled as the output of a Markov chain corrupted by additive white Gaussian noise (AWGN). This model encompasses many different frame synchronization situations e.g., convolutionally coded transmissions and nonlinear modulations with memory, such as continuous-phase modulation. The proposed frame synchronizer is implemented with trellis path search used for Markov chain decoding and provides better performance than conventional synchronizers because it is able to exploit coding gain. The proposed synchronizer includes many previously proposed synchronizers either as special cases or as suboptimal approximations. The numerical results show the performance gain of the proposed frame synchronizer for convolutional codes with linear modulation, transmission over known intersymbol-interference channels, and nonlinear continuous-phase modulation signals. The proposed frame synchronizer is derived for the case of continuous transmission but may also be applied to certain packet transmission scenarios
Heon Huh, James V. Krogmeier
IEEE Trans. Wirel. Commun.1